./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 c00e63dc 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-?-c00e63d-m [2025-02-06 19:00:31,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:00:31,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:00:31,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:00:31,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:00:31,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:00:31,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:00:31,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:00:31,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:00:31,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:00:31,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:00:31,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:00:31,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:00:31,862 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:00:31,862 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:00:31,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:00:31,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:00:31,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:00:31,864 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:00:31,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:00:31,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:00:31,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:00:31,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:00:31,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:00:31,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:00:31,865 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:00:31,865 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-02-06 19:00:32,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:00:32,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:00:32,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:00:32,157 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:00:32,157 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:00:32,158 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-02-06 19:00:33,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d517fff5/bc72979585e6407b9f25efde21254f85/FLAG91cdf4753 [2025-02-06 19:00:33,531 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:00:33,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2025-02-06 19:00:33,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d517fff5/bc72979585e6407b9f25efde21254f85/FLAG91cdf4753 [2025-02-06 19:00:33,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d517fff5/bc72979585e6407b9f25efde21254f85 [2025-02-06 19:00:33,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:00:33,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:00:33,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:00:33,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:00:33,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:00:33,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:00:33" (1/1) ... [2025-02-06 19:00:33,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e16877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:33, skipping insertion in model container [2025-02-06 19:00:33,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:00:33" (1/1) ... [2025-02-06 19:00:33,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:00:33,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:00:34,002 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:00:34,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:00:34,021 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:00:34,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34 WrapperNode [2025-02-06 19:00:34,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:00:34,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:00:34,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:00:34,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:00:34,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,037 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2025-02-06 19:00:34,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:00:34,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:00:34,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:00:34,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:00:34,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,048 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 19:00:34,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,049 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:00:34,053 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:00:34,053 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:00:34,053 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:00:34,054 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (1/1) ... [2025-02-06 19:00:34,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:34,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:34,080 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-02-06 19:00:34,084 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-02-06 19:00:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2025-02-06 19:00:34,101 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2025-02-06 19:00:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:00:34,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:00:34,137 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:00:34,138 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:00:34,229 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 19:00:34,229 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:00:34,234 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:00:34,234 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:00:34,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:00:34 BoogieIcfgContainer [2025-02-06 19:00:34,234 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:00:34,235 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:00:34,235 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:00:34,238 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:00:34,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:00:34,239 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:00:33" (1/3) ... [2025-02-06 19:00:34,239 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e47f5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:00:34, skipping insertion in model container [2025-02-06 19:00:34,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:00:34,239 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:00:34" (2/3) ... [2025-02-06 19:00:34,240 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e47f5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:00:34, skipping insertion in model container [2025-02-06 19:00:34,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:00:34,240 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:00:34" (3/3) ... [2025-02-06 19:00:34,241 INFO L363 chiAutomizerObserver]: Analyzing ICFG Parts.c [2025-02-06 19:00:34,269 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:00:34,269 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:00:34,269 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:00:34,269 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:00:34,270 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:00:34,270 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:00:34,270 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:00:34,270 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:00:34,273 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-02-06 19:00:34,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-02-06 19:00:34,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:34,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:34,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:00:34,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:00:34,286 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:00:34,286 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-02-06 19:00:34,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-02-06 19:00:34,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:34,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:34,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:00:34,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:00:34,292 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-02-06 19:00:34,292 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-02-06 19:00:34,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:34,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1876795, now seen corresponding path program 1 times [2025-02-06 19:00:34,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:34,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381892594] [2025-02-06 19:00:34,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:34,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:34,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:00:34,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:00:34,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:34,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:34,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:00:34,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:00:34,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:34,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:34,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:34,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1565, now seen corresponding path program 1 times [2025-02-06 19:00:34,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:34,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878997486] [2025-02-06 19:00:34,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:34,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:34,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:00:34,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:00:34,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:34,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:34,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:00:34,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:00:34,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:34,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:34,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:34,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1803600599, now seen corresponding path program 1 times [2025-02-06 19:00:34,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:34,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808129970] [2025-02-06 19:00:34,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:34,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:34,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:00:34,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:00:34,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:34,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:34,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808129970] [2025-02-06 19:00:34,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808129970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:00:34,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:00:34,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:00:34,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481993555] [2025-02-06 19:00:34,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:00:34,452 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:34,452 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:34,453 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:34,453 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:34,453 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:34,453 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:34,453 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:34,453 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:34,453 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration1_Loop [2025-02-06 19:00:34,453 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:34,454 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:34,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:34,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:34,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:34,508 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:34,509 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:34,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:34,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:34,512 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-02-06 19:00:34,513 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-02-06 19:00:34,515 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:34,515 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:34,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-06 19:00:34,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:34,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:34,535 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-02-06 19:00:34,537 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-02-06 19:00:34,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:34,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:34,605 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:34,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:34,611 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:34,611 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:34,611 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:34,611 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:34,611 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:34,611 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:34,611 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:34,611 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:34,612 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration1_Loop [2025-02-06 19:00:34,612 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:34,612 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:34,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:34,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:34,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:34,651 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:34,654 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:34,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:34,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:34,659 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-02-06 19:00:34,660 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-02-06 19:00:34,661 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-02-06 19:00:34,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:34,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:34,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:34,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:34,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:34,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:34,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:34,692 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:34,705 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-02-06 19:00:34,709 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-02-06 19:00:34,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:34,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:34,714 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-02-06 19:00:34,716 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-02-06 19:00:34,717 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:34,718 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:34,718 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:34,719 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-02-06 19:00:34,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:34,733 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:34,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:34,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:00:34,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:00:34,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:34,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:00:34,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:34,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:00:34,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:00:34,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:34,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:00:34,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:34,810 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-02-06 19:00:34,811 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-02-06 19:00:34,842 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-02-06 19:00:34,843 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-02-06 19:00:34,845 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-02-06 19:00:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-02-06 19:00:34,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-06 19:00:34,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:34,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-06 19:00:34,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:34,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-06 19:00:34,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:34,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2025-02-06 19:00:34,852 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-02-06 19:00:34,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 34 transitions. [2025-02-06 19:00:34,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-06 19:00:34,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-02-06 19:00:34,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 34 transitions. [2025-02-06 19:00:34,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:34,857 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-02-06 19:00:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 34 transitions. [2025-02-06 19:00:34,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-02-06 19:00:34,871 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-02-06 19:00:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2025-02-06 19:00:34,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-02-06 19:00:34,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:34,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:00:34,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:00:34,874 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-02-06 19:00:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:34,896 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2025-02-06 19:00:34,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2025-02-06 19:00:34,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-06 19:00:34,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 29 transitions. [2025-02-06 19:00:34,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-02-06 19:00:34,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-02-06 19:00:34,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2025-02-06 19:00:34,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:00:34,898 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-02-06 19:00:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2025-02-06 19:00:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-02-06 19:00:34,899 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-02-06 19:00:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2025-02-06 19:00:34,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-02-06 19:00:34,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:00:34,901 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-02-06 19:00:34,901 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:00:34,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2025-02-06 19:00:34,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-02-06 19:00:34,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:34,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:34,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:00:34,902 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:34,902 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-02-06 19:00:34,902 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;" >"#40#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-02-06 19:00:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1876795, now seen corresponding path program 2 times [2025-02-06 19:00:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351898247] [2025-02-06 19:00:34,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:34,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:00:34,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:00:34,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:00:34,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:34,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:34,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:00:34,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:00:34,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:34,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:34,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:34,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1695627319, now seen corresponding path program 1 times [2025-02-06 19:00:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834977823] [2025-02-06 19:00:34,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:34,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:34,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:00:34,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:00:34,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:34,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:34,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:00:34,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:00:34,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:34,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:34,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash -534800835, now seen corresponding path program 1 times [2025-02-06 19:00:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:34,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856214721] [2025-02-06 19:00:34,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:34,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:34,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:00:34,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:00:34,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:34,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:34,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:00:34,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:00:34,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:34,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:34,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:34,998 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-02-06 19:00:35,028 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:35,029 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:35,029 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:35,029 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:35,029 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:35,029 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:35,029 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:35,029 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:35,029 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2025-02-06 19:00:35,029 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:35,029 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:35,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,064 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:35,064 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:35,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:35,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:35,066 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-02-06 19:00:35,067 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-02-06 19:00:35,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:35,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:35,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:00:35,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:35,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:35,088 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-02-06 19:00:35,089 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-02-06 19:00:35,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:35,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:35,111 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:35,115 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-02-06 19:00:35,115 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:35,115 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:35,115 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:35,115 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:35,115 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:35,115 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:35,115 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:35,115 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:35,115 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2025-02-06 19:00:35,115 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:35,115 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:35,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,154 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:35,154 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:35,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:35,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:35,156 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-02-06 19:00:35,157 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-02-06 19:00:35,158 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-02-06 19:00:35,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:35,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:35,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:35,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:35,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:35,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:35,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:35,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:35,175 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-02-06 19:00:35,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:35,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:35,181 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-02-06 19:00:35,182 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-02-06 19:00:35,183 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-02-06 19:00:35,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:35,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:35,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:35,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:35,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:35,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:35,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:35,197 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:35,198 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:00:35,198 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:00:35,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:35,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:35,201 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-02-06 19:00:35,204 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-02-06 19:00:35,204 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:35,205 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:35,205 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:35,205 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-02-06 19:00:35,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:35,211 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:35,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:35,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:00:35,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:00:35,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:35,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:35,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:00:35,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:35,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:00:35,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:00:35,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:35,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:35,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:00:35,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:35,307 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-02-06 19:00:35,308 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-02-06 19:00:35,487 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-02-06 19:00:35,488 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-02-06 19:00:35,488 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-02-06 19:00:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2025-02-06 19:00:35,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 4 letters. Loop has 9 letters. [2025-02-06 19:00:35,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:35,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 13 letters. Loop has 9 letters. [2025-02-06 19:00:35,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:35,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 64 transitions. Stem has 4 letters. Loop has 18 letters. [2025-02-06 19:00:35,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:35,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 240 transitions. [2025-02-06 19:00:35,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-02-06 19:00:35,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 240 transitions. [2025-02-06 19:00:35,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2025-02-06 19:00:35,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2025-02-06 19:00:35,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 240 transitions. [2025-02-06 19:00:35,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:35,498 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 240 transitions. [2025-02-06 19:00:35,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 240 transitions. [2025-02-06 19:00:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 126. [2025-02-06 19:00:35,507 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-02-06 19:00:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 191 transitions. [2025-02-06 19:00:35,509 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 191 transitions. [2025-02-06 19:00:35,509 INFO L432 stractBuchiCegarLoop]: Abstraction has 126 states and 191 transitions. [2025-02-06 19:00:35,509 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:00:35,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 191 transitions. [2025-02-06 19:00:35,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-02-06 19:00:35,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:35,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:35,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:00:35,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:35,511 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-02-06 19:00:35,511 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;" >"#40#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-02-06 19:00:35,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash 58180664, now seen corresponding path program 1 times [2025-02-06 19:00:35,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:35,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514040303] [2025-02-06 19:00:35,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:35,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:35,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:35,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:35,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:35,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:35,515 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:35,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:35,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:35,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:35,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:35,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:35,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:35,517 INFO L85 PathProgramCache]: Analyzing trace with hash -493408852, now seen corresponding path program 1 times [2025-02-06 19:00:35,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:35,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736243223] [2025-02-06 19:00:35,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:35,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:35,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:00:35,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:00:35,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:35,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:35,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:35,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736243223] [2025-02-06 19:00:35,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736243223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:00:35,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:00:35,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 19:00:35,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537608546] [2025-02-06 19:00:35,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:00:35,605 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:00:35,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:35,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:00:35,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:00:35,606 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-02-06 19:00:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:35,749 INFO L93 Difference]: Finished difference Result 229 states and 436 transitions. [2025-02-06 19:00:35,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 229 states and 436 transitions. [2025-02-06 19:00:35,756 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-02-06 19:00:35,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 229 states to 226 states and 433 transitions. [2025-02-06 19:00:35,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-02-06 19:00:35,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-02-06 19:00:35,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 433 transitions. [2025-02-06 19:00:35,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:35,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 226 states and 433 transitions. [2025-02-06 19:00:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 433 transitions. [2025-02-06 19:00:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 167. [2025-02-06 19:00:35,776 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-02-06 19:00:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 280 transitions. [2025-02-06 19:00:35,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 280 transitions. [2025-02-06 19:00:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 19:00:35,779 INFO L432 stractBuchiCegarLoop]: Abstraction has 167 states and 280 transitions. [2025-02-06 19:00:35,779 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:00:35,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 280 transitions. [2025-02-06 19:00:35,780 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2025-02-06 19:00:35,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:35,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:35,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:00:35,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:35,781 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-02-06 19:00:35,781 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;" >"#40#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2025-02-06 19:00:35,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash 58180664, now seen corresponding path program 2 times [2025-02-06 19:00:35,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:35,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13985843] [2025-02-06 19:00:35,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:35,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:35,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:35,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:35,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:00:35,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:35,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:35,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:35,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:35,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:35,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:35,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:35,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash 75464136, now seen corresponding path program 1 times [2025-02-06 19:00:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:35,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616173389] [2025-02-06 19:00:35,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:35,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:35,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:00:35,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:00:35,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:35,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:35,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:35,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:00:35,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:00:35,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:35,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:35,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:35,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash -525919489, now seen corresponding path program 1 times [2025-02-06 19:00:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:35,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34730549] [2025-02-06 19:00:35,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:35,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:35,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:00:35,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:00:35,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:35,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:35,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:35,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34730549] [2025-02-06 19:00:35,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34730549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:00:35,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:00:35,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 19:00:35,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751460739] [2025-02-06 19:00:35,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:00:35,898 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:35,898 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:35,898 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:35,898 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:35,899 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:35,899 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:35,899 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:35,899 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:35,899 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration4_Loop [2025-02-06 19:00:35,899 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:35,899 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:35,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:35,923 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:35,923 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:35,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:35,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:35,928 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-02-06 19:00:35,928 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-02-06 19:00:35,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:35,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:35,940 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:35,940 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-02-06 19:00:35,946 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-02-06 19:00:35,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:35,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:35,950 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-02-06 19:00:35,951 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-02-06 19:00:35,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:35,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:35,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 19:00:35,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:35,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:35,970 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-02-06 19:00:35,972 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-02-06 19:00:35,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:35,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:36,009 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:36,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-06 19:00:36,014 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:36,014 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:36,014 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:36,014 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:36,014 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:36,014 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,014 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:36,014 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:36,014 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration4_Loop [2025-02-06 19:00:36,014 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:36,014 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:36,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:36,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:36,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:36,069 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:36,070 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:36,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:36,077 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-02-06 19:00:36,082 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-02-06 19:00:36,082 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-02-06 19:00:36,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:36,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:36,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:36,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:36,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:36,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:36,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:36,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:36,097 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:00:36,097 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:00:36,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:36,099 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-02-06 19:00:36,100 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-02-06 19:00:36,104 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:36,104 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:36,104 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:36,104 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-02-06 19:00:36,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:36,110 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:36,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:36,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:36,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:36,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:36,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:36,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:00:36,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:36,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:00:36,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:00:36,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:36,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:36,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:00:36,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:36,179 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-02-06 19:00:36,179 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-02-06 19:00:36,306 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-02-06 19:00:36,307 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-02-06 19:00:36,307 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-02-06 19:00:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2025-02-06 19:00:36,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 5 letters. Loop has 8 letters. [2025-02-06 19:00:36,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:36,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 13 letters. Loop has 8 letters. [2025-02-06 19:00:36,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:36,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 5 letters. Loop has 16 letters. [2025-02-06 19:00:36,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:36,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 958 states and 1806 transitions. [2025-02-06 19:00:36,319 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 47 [2025-02-06 19:00:36,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 958 states to 838 states and 1552 transitions. [2025-02-06 19:00:36,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2025-02-06 19:00:36,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2025-02-06 19:00:36,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 838 states and 1552 transitions. [2025-02-06 19:00:36,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:36,335 INFO L218 hiAutomatonCegarLoop]: Abstraction has 838 states and 1552 transitions. [2025-02-06 19:00:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states and 1552 transitions. [2025-02-06 19:00:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 675. [2025-02-06 19:00:36,367 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-02-06 19:00:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1132 transitions. [2025-02-06 19:00:36,372 INFO L240 hiAutomatonCegarLoop]: Abstraction has 675 states and 1132 transitions. [2025-02-06 19:00:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:36,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 19:00:36,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 19:00:36,373 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-02-06 19:00:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:36,417 INFO L93 Difference]: Finished difference Result 736 states and 1284 transitions. [2025-02-06 19:00:36,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 736 states and 1284 transitions. [2025-02-06 19:00:36,424 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 44 [2025-02-06 19:00:36,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 736 states to 311 states and 534 transitions. [2025-02-06 19:00:36,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2025-02-06 19:00:36,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 204 [2025-02-06 19:00:36,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 534 transitions. [2025-02-06 19:00:36,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:36,429 INFO L218 hiAutomatonCegarLoop]: Abstraction has 311 states and 534 transitions. [2025-02-06 19:00:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 534 transitions. [2025-02-06 19:00:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 255. [2025-02-06 19:00:36,437 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-02-06 19:00:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 405 transitions. [2025-02-06 19:00:36,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 255 states and 405 transitions. [2025-02-06 19:00:36,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 19:00:36,440 INFO L432 stractBuchiCegarLoop]: Abstraction has 255 states and 405 transitions. [2025-02-06 19:00:36,440 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:00:36,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 405 transitions. [2025-02-06 19:00:36,443 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 44 [2025-02-06 19:00:36,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:36,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:36,443 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:36,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:36,444 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;" >"#40#return;" [2025-02-06 19:00:36,444 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;" >"#40#return;" [2025-02-06 19:00:36,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1188268990, now seen corresponding path program 1 times [2025-02-06 19:00:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:36,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867448291] [2025-02-06 19:00:36,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:36,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:36,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:00:36,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:00:36,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:36,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:36,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:36,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:00:36,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:00:36,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:36,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:36,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:36,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:36,452 INFO L85 PathProgramCache]: Analyzing trace with hash -685329803, now seen corresponding path program 1 times [2025-02-06 19:00:36,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:36,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750049486] [2025-02-06 19:00:36,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:36,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:36,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:00:36,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:00:36,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:36,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:36,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:36,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:00:36,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:00:36,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:36,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:36,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:36,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1047599080, now seen corresponding path program 1 times [2025-02-06 19:00:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:36,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884460727] [2025-02-06 19:00:36,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:36,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:36,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:00:36,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:00:36,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:36,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:36,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:36,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:00:36,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:00:36,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:36,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:36,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:36,490 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-02-06 19:00:36,529 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:36,529 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:36,529 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:36,529 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:36,529 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:36,529 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,529 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:36,529 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:36,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2025-02-06 19:00:36,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:36,530 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:36,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:36,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:36,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:36,550 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:36,550 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:36,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:36,552 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-02-06 19:00:36,557 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-02-06 19:00:36,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:36,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:36,569 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:36,569 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-02-06 19:00:36,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:36,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:36,577 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-02-06 19:00:36,578 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-02-06 19:00:36,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:36,580 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:36,597 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:36,597 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-02-06 19:00:36,603 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-02-06 19:00:36,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:36,606 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-02-06 19:00:36,607 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-02-06 19:00:36,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:36,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:36,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-02-06 19:00:36,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:36,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-02-06 19:00:36,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-02-06 19:00:36,633 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:36,633 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:36,766 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:36,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 19:00:36,771 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:36,771 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:36,771 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:36,771 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:36,771 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:36,772 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,772 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:36,772 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:36,772 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2025-02-06 19:00:36,772 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:36,772 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:36,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:36,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:36,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:36,806 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:36,806 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:36,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:36,808 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-02-06 19:00:36,817 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-02-06 19:00:36,817 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-02-06 19:00:36,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:36,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:36,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:36,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:36,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:36,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:36,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:36,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:36,837 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-02-06 19:00:36,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:36,840 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-02-06 19:00:36,841 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-02-06 19:00:36,842 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-02-06 19:00:36,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:36,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:36,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:36,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:36,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:36,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:36,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:36,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:36,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:36,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:36,863 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-02-06 19:00:36,864 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-02-06 19:00:36,865 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-02-06 19:00:36,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:36,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:36,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:36,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:36,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:36,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:36,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:36,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:36,881 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-06 19:00:36,881 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:00:36,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:36,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:36,884 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-02-06 19:00:36,888 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-02-06 19:00:36,888 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:36,888 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:36,888 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:36,889 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-02-06 19:00:36,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:36,904 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:36,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:36,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:00:36,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:00:36,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:36,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:36,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:00:36,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:37,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:00:37,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:00:37,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:37,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:37,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:00:37,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:37,063 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-02-06 19:00:37,063 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-02-06 19:00:37,152 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-02-06 19:00:37,152 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-02-06 19:00:37,153 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-02-06 19:00:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2025-02-06 19:00:37,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 7 letters. [2025-02-06 19:00:37,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:37,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 18 letters. Loop has 7 letters. [2025-02-06 19:00:37,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:37,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 11 letters. Loop has 14 letters. [2025-02-06 19:00:37,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:37,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 597 transitions. [2025-02-06 19:00:37,162 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2025-02-06 19:00:37,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 315 states and 490 transitions. [2025-02-06 19:00:37,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2025-02-06 19:00:37,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2025-02-06 19:00:37,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 490 transitions. [2025-02-06 19:00:37,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:37,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 315 states and 490 transitions. [2025-02-06 19:00:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 490 transitions. [2025-02-06 19:00:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2025-02-06 19:00:37,178 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-02-06 19:00:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 489 transitions. [2025-02-06 19:00:37,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 314 states and 489 transitions. [2025-02-06 19:00:37,180 INFO L432 stractBuchiCegarLoop]: Abstraction has 314 states and 489 transitions. [2025-02-06 19:00:37,180 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:00:37,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 489 transitions. [2025-02-06 19:00:37,182 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2025-02-06 19:00:37,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:37,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:37,182 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:37,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:00:37,183 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-02-06 19:00:37,183 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-02-06 19:00:37,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:37,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1818072937, now seen corresponding path program 1 times [2025-02-06 19:00:37,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:37,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656644155] [2025-02-06 19:00:37,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:37,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:37,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:00:37,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:00:37,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:37,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:37,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:37,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656644155] [2025-02-06 19:00:37,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656644155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:00:37,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:00:37,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 19:00:37,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149596135] [2025-02-06 19:00:37,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:00:37,212 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:00:37,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash 39094691, now seen corresponding path program 1 times [2025-02-06 19:00:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:37,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934058867] [2025-02-06 19:00:37,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:37,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:37,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:37,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:37,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:37,216 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:37,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:37,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:37,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:37,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:37,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:37,265 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:37,265 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:37,265 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:37,265 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:37,265 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:37,265 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:37,265 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:37,265 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:37,265 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2025-02-06 19:00:37,265 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:37,265 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:37,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,312 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:37,312 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:37,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:37,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:37,315 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-02-06 19:00:37,317 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-02-06 19:00:37,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:37,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:37,328 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:37,328 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:00:37,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:37,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:37,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:37,340 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-02-06 19:00:37,341 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-02-06 19:00:37,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:37,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:37,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 19:00:37,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:37,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:37,367 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-02-06 19:00:37,368 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-02-06 19:00:37,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:37,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:37,507 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:37,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 19:00:37,513 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:37,513 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:37,513 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:37,513 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:37,513 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:37,513 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:37,513 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:37,514 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:37,514 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2025-02-06 19:00:37,514 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:37,514 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:37,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:37,562 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:37,562 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:37,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:37,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:37,568 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-02-06 19:00:37,571 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-02-06 19:00:37,572 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-02-06 19:00:37,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:37,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:37,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:37,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:37,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:37,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:37,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:37,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:37,591 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-02-06 19:00:37,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:37,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:37,593 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-02-06 19:00:37,598 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-02-06 19:00:37,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:00:37,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:37,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:37,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:37,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:37,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:37,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:37,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:37,613 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:37,616 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:00:37,616 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:00:37,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:37,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:37,620 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-02-06 19:00:37,624 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-02-06 19:00:37,625 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:37,626 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:37,626 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:37,626 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-02-06 19:00:37,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:37,632 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:37,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:37,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:00:37,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:00:37,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:37,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:37,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:00:37,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:37,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:37,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:37,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:37,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:37,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:00:37,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:37,725 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-02-06 19:00:37,725 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-02-06 19:00:37,833 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-02-06 19:00:37,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:00:37,837 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-02-06 19:00:37,839 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-02-06 19:00:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2025-02-06 19:00:37,840 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-02-06 19:00:37,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 12 letters. Loop has 5 letters. [2025-02-06 19:00:37,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:37,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 17 letters. Loop has 5 letters. [2025-02-06 19:00:37,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:37,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 12 letters. Loop has 10 letters. [2025-02-06 19:00:37,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:37,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1007 states and 2044 transitions. [2025-02-06 19:00:37,855 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 165 [2025-02-06 19:00:37,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1007 states to 912 states and 1870 transitions. [2025-02-06 19:00:37,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 493 [2025-02-06 19:00:37,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 501 [2025-02-06 19:00:37,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 912 states and 1870 transitions. [2025-02-06 19:00:37,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:37,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 912 states and 1870 transitions. [2025-02-06 19:00:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states and 1870 transitions. [2025-02-06 19:00:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 810. [2025-02-06 19:00:37,909 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-02-06 19:00:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1541 transitions. [2025-02-06 19:00:37,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 810 states and 1541 transitions. [2025-02-06 19:00:37,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:37,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 19:00:37,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 19:00:37,919 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-02-06 19:00:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:37,949 INFO L93 Difference]: Finished difference Result 716 states and 1339 transitions. [2025-02-06 19:00:37,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 716 states and 1339 transitions. [2025-02-06 19:00:37,957 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 104 [2025-02-06 19:00:37,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 716 states to 715 states and 1338 transitions. [2025-02-06 19:00:37,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2025-02-06 19:00:37,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2025-02-06 19:00:37,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 715 states and 1338 transitions. [2025-02-06 19:00:37,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:37,968 INFO L218 hiAutomatonCegarLoop]: Abstraction has 715 states and 1338 transitions. [2025-02-06 19:00:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states and 1338 transitions. [2025-02-06 19:00:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 707. [2025-02-06 19:00:37,990 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-02-06 19:00:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1330 transitions. [2025-02-06 19:00:37,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 707 states and 1330 transitions. [2025-02-06 19:00:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 19:00:37,999 INFO L432 stractBuchiCegarLoop]: Abstraction has 707 states and 1330 transitions. [2025-02-06 19:00:37,999 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:00:37,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 707 states and 1330 transitions. [2025-02-06 19:00:38,003 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 102 [2025-02-06 19:00:38,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:38,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:38,004 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:38,004 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-02-06 19:00:38,004 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;" >"#40#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-02-06 19:00:38,004 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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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-02-06 19:00:38,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash 601043318, now seen corresponding path program 2 times [2025-02-06 19:00:38,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:38,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279148734] [2025-02-06 19:00:38,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:38,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:38,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 19:00:38,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:00:38,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:00:38,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:38,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:38,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279148734] [2025-02-06 19:00:38,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279148734] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:38,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434341872] [2025-02-06 19:00:38,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:38,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:38,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:38,065 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-02-06 19:00:38,067 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-02-06 19:00:38,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 19:00:38,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:00:38,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:00:38,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:38,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:00:38,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:38,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:00:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:38,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434341872] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:00:38,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:00:38,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 19:00:38,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676405588] [2025-02-06 19:00:38,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:00:38,155 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:00:38,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:38,155 INFO L85 PathProgramCache]: Analyzing trace with hash -313480764, now seen corresponding path program 1 times [2025-02-06 19:00:38,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:38,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595078569] [2025-02-06 19:00:38,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:38,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:38,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:00:38,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:00:38,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:38,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 19:00:38,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:38,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595078569] [2025-02-06 19:00:38,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595078569] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:38,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95614489] [2025-02-06 19:00:38,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:38,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:38,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:38,310 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-02-06 19:00:38,311 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-02-06 19:00:38,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:00:38,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:00:38,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:38,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:38,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:00:38,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 19:00:38,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:00:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 19:00:38,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95614489] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:00:38,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:00:38,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-02-06 19:00:38,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249959482] [2025-02-06 19:00:38,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:00:38,542 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:00:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:38,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 19:00:38,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 19:00:38,542 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-02-06 19:00:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:38,573 INFO L93 Difference]: Finished difference Result 755 states and 1413 transitions. [2025-02-06 19:00:38,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 755 states and 1413 transitions. [2025-02-06 19:00:38,579 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 112 [2025-02-06 19:00:38,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 755 states to 752 states and 1409 transitions. [2025-02-06 19:00:38,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2025-02-06 19:00:38,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 388 [2025-02-06 19:00:38,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 752 states and 1409 transitions. [2025-02-06 19:00:38,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:38,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 752 states and 1409 transitions. [2025-02-06 19:00:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states and 1409 transitions. [2025-02-06 19:00:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 706. [2025-02-06 19:00:38,601 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-02-06 19:00:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1328 transitions. [2025-02-06 19:00:38,605 INFO L240 hiAutomatonCegarLoop]: Abstraction has 706 states and 1328 transitions. [2025-02-06 19:00:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:00:38,606 INFO L432 stractBuchiCegarLoop]: Abstraction has 706 states and 1328 transitions. [2025-02-06 19:00:38,606 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:00:38,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 706 states and 1328 transitions. [2025-02-06 19:00:38,609 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 102 [2025-02-06 19:00:38,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:38,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:38,610 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:00:38,610 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-02-06 19:00:38,611 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;" >"#40#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;" >"#40#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-02-06 19:00:38,611 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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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-02-06 19:00:38,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1791803684, now seen corresponding path program 3 times [2025-02-06 19:00:38,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:38,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584185634] [2025-02-06 19:00:38,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:00:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:38,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-02-06 19:00:38,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:00:38,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:00:38,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:38,617 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:38,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:00:38,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:00:38,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:38,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:38,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:38,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash -313480764, now seen corresponding path program 2 times [2025-02-06 19:00:38,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:38,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974466055] [2025-02-06 19:00:38,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:38,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:38,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 19:00:38,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:00:38,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:00:38,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 19:00:38,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:38,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974466055] [2025-02-06 19:00:38,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974466055] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:38,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874052335] [2025-02-06 19:00:38,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:38,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:38,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:38,704 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-02-06 19:00:38,707 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-02-06 19:00:38,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-06 19:00:38,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:00:38,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:00:38,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:38,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:00:38,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 19:00:38,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:00:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 19:00:38,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874052335] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:00:38,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:00:38,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-02-06 19:00:38,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204339362] [2025-02-06 19:00:38,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:00:38,943 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:00:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:38,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 19:00:38,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-02-06 19:00:38,944 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-02-06 19:00:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:39,215 INFO L93 Difference]: Finished difference Result 1107 states and 2858 transitions. [2025-02-06 19:00:39,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1107 states and 2858 transitions. [2025-02-06 19:00:39,229 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 181 [2025-02-06 19:00:39,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1107 states to 1090 states and 2809 transitions. [2025-02-06 19:00:39,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 602 [2025-02-06 19:00:39,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 602 [2025-02-06 19:00:39,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1090 states and 2809 transitions. [2025-02-06 19:00:39,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:39,252 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1090 states and 2809 transitions. [2025-02-06 19:00:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states and 2809 transitions. [2025-02-06 19:00:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 749. [2025-02-06 19:00:39,286 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-02-06 19:00:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1565 transitions. [2025-02-06 19:00:39,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 749 states and 1565 transitions. [2025-02-06 19:00:39,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 19:00:39,292 INFO L432 stractBuchiCegarLoop]: Abstraction has 749 states and 1565 transitions. [2025-02-06 19:00:39,292 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:00:39,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 749 states and 1565 transitions. [2025-02-06 19:00:39,296 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 109 [2025-02-06 19:00:39,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:39,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:39,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:00:39,297 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-02-06 19:00:39,297 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;" >"#40#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;" >"#40#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-02-06 19:00:39,297 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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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-02-06 19:00:39,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:39,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1791803684, now seen corresponding path program 4 times [2025-02-06 19:00:39,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:39,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950460595] [2025-02-06 19:00:39,298 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:00:39,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:39,300 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-02-06 19:00:39,302 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:00:39,302 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:00:39,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:39,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:39,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:00:39,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:00:39,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:39,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:39,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:39,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:39,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1663446188, now seen corresponding path program 3 times [2025-02-06 19:00:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:39,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037314133] [2025-02-06 19:00:39,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:00:39,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:39,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-02-06 19:00:39,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 52 statements. [2025-02-06 19:00:39,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:00:39,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-06 19:00:39,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:39,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037314133] [2025-02-06 19:00:39,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037314133] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:39,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047754173] [2025-02-06 19:00:39,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:00:39,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:39,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:39,405 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-02-06 19:00:39,407 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-02-06 19:00:39,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-02-06 19:00:39,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 52 statements. [2025-02-06 19:00:39,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:00:39,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:39,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:00:39,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-06 19:00:39,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:00:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-06 19:00:39,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047754173] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:00:39,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:00:39,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2025-02-06 19:00:39,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363297349] [2025-02-06 19:00:39,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:00:39,838 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:00:39,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:39,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 19:00:39,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-02-06 19:00:39,838 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-02-06 19:00:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:40,195 INFO L93 Difference]: Finished difference Result 1355 states and 2923 transitions. [2025-02-06 19:00:40,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1355 states and 2923 transitions. [2025-02-06 19:00:40,208 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 160 [2025-02-06 19:00:40,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1355 states to 1279 states and 2785 transitions. [2025-02-06 19:00:40,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2025-02-06 19:00:40,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 675 [2025-02-06 19:00:40,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 2785 transitions. [2025-02-06 19:00:40,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:40,225 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1279 states and 2785 transitions. [2025-02-06 19:00:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 2785 transitions. [2025-02-06 19:00:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 996. [2025-02-06 19:00:40,285 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-02-06 19:00:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 2112 transitions. [2025-02-06 19:00:40,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 996 states and 2112 transitions. [2025-02-06 19:00:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 19:00:40,295 INFO L432 stractBuchiCegarLoop]: Abstraction has 996 states and 2112 transitions. [2025-02-06 19:00:40,295 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:00:40,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 996 states and 2112 transitions. [2025-02-06 19:00:40,301 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 110 [2025-02-06 19:00:40,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:40,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:40,302 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-02-06 19:00:40,302 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:00:40,302 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;" >"#40#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-02-06 19:00:40,302 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-02-06 19:00:40,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1956724682, now seen corresponding path program 1 times [2025-02-06 19:00:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:40,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612281812] [2025-02-06 19:00:40,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:40,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:40,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:00:40,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:00:40,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:40,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 19:00:40,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:40,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612281812] [2025-02-06 19:00:40,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612281812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:00:40,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:00:40,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 19:00:40,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144349573] [2025-02-06 19:00:40,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:00:40,340 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:00:40,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash 39094726, now seen corresponding path program 1 times [2025-02-06 19:00:40,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:40,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804230771] [2025-02-06 19:00:40,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:40,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:40,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:40,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:40,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:40,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:40,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:40,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:40,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:40,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:40,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:40,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:40,398 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:40,398 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:40,398 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:40,398 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:40,398 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:40,398 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,398 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:40,398 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:40,398 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration10_Loop [2025-02-06 19:00:40,398 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:40,398 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:40,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,442 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:40,442 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:40,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,444 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-02-06 19:00:40,449 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-02-06 19:00:40,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:40,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:40,460 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:40,460 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-02-06 19:00:40,466 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-02-06 19:00:40,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,468 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-02-06 19:00:40,469 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-02-06 19:00:40,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:40,473 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:40,483 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:40,483 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-02-06 19:00:40,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:40,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,491 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-02-06 19:00:40,492 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-02-06 19:00:40,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:40,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:40,505 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:40,505 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:00:40,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:40,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,513 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-02-06 19:00:40,513 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-02-06 19:00:40,515 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:40,515 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:40,529 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:40,529 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:00:40,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:40,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,541 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-02-06 19:00:40,545 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-02-06 19:00:40,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:40,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:40,556 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:40,556 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-02-06 19:00:40,566 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-02-06 19:00:40,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,569 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-02-06 19:00:40,570 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-02-06 19:00:40,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:40,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:40,587 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-02-06 19:00:40,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,590 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-02-06 19:00:40,591 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-02-06 19:00:40,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:40,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:40,633 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:40,637 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-02-06 19:00:40,637 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:40,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:40,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:40,638 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:40,638 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:40,638 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,638 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:40,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:40,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration10_Loop [2025-02-06 19:00:40,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:40,638 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:40,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:40,709 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:40,709 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:40,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,711 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-02-06 19:00:40,716 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-02-06 19:00:40,717 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-02-06 19:00:40,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:40,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:40,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:40,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:40,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:40,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:40,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:40,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:40,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:40,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,735 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-02-06 19:00:40,736 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-02-06 19:00:40,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:00:40,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:40,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:40,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:40,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:40,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:40,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:40,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:40,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:40,755 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-02-06 19:00:40,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,757 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-02-06 19:00:40,758 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-02-06 19:00:40,760 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-02-06 19:00:40,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:40,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:40,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:40,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:40,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:40,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:40,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:40,771 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:40,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:40,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,778 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-02-06 19:00:40,780 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-02-06 19:00:40,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-02-06 19:00:40,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:40,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:40,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:40,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:40,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:40,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:40,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:40,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:40,797 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-02-06 19:00:40,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,799 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-02-06 19:00:40,801 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-02-06 19:00:40,801 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-02-06 19:00:40,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:40,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:40,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:40,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:40,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:40,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:40,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:40,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:40,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:40,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,820 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-02-06 19:00:40,825 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-02-06 19:00:40,826 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-02-06 19:00:40,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:40,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:40,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:40,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:40,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:40,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:40,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:40,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:40,840 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-06 19:00:40,840 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:00:40,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:40,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:40,843 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-02-06 19:00:40,846 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-02-06 19:00:40,846 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:40,846 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:40,846 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:40,846 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2025-02-06 19:00:40,852 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-02-06 19:00:40,853 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:40,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:40,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:00:40,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:00:40,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:40,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:40,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:00:40,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:40,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:40,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:40,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:40,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:40,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:00:40,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:40,984 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-02-06 19:00:40,985 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-02-06 19:00:41,092 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-02-06 19:00:41,092 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-02-06 19:00:41,093 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-02-06 19:00:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2025-02-06 19:00:41,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 24 letters. Loop has 5 letters. [2025-02-06 19:00:41,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:41,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 29 letters. Loop has 5 letters. [2025-02-06 19:00:41,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:41,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 24 letters. Loop has 10 letters. [2025-02-06 19:00:41,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:41,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1889 states and 3790 transitions. [2025-02-06 19:00:41,108 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 122 [2025-02-06 19:00:41,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1889 states to 1647 states and 3417 transitions. [2025-02-06 19:00:41,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 718 [2025-02-06 19:00:41,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 744 [2025-02-06 19:00:41,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1647 states and 3417 transitions. [2025-02-06 19:00:41,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:41,126 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1647 states and 3417 transitions. [2025-02-06 19:00:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states and 3417 transitions. [2025-02-06 19:00:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1563. [2025-02-06 19:00:41,162 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-02-06 19:00:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 3199 transitions. [2025-02-06 19:00:41,169 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1563 states and 3199 transitions. [2025-02-06 19:00:41,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:41,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 19:00:41,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 19:00:41,170 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-02-06 19:00:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:41,198 INFO L93 Difference]: Finished difference Result 1287 states and 2712 transitions. [2025-02-06 19:00:41,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1287 states and 2712 transitions. [2025-02-06 19:00:41,208 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 78 [2025-02-06 19:00:41,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1287 states to 1271 states and 2695 transitions. [2025-02-06 19:00:41,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2025-02-06 19:00:41,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 518 [2025-02-06 19:00:41,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1271 states and 2695 transitions. [2025-02-06 19:00:41,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:41,221 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-02-06 19:00:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states and 2695 transitions. [2025-02-06 19:00:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2025-02-06 19:00:41,248 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-02-06 19:00:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2695 transitions. [2025-02-06 19:00:41,253 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-02-06 19:00:41,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 19:00:41,254 INFO L432 stractBuchiCegarLoop]: Abstraction has 1271 states and 2695 transitions. [2025-02-06 19:00:41,254 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:00:41,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1271 states and 2695 transitions. [2025-02-06 19:00:41,260 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 78 [2025-02-06 19:00:41,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:41,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:41,261 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:00:41,261 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:41,261 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;" >"#40#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;" >"#40#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;" >"#40#return;" [2025-02-06 19:00:41,261 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;" >"#40#return;" [2025-02-06 19:00:41,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:41,261 INFO L85 PathProgramCache]: Analyzing trace with hash -66487454, now seen corresponding path program 5 times [2025-02-06 19:00:41,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:41,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153481150] [2025-02-06 19:00:41,261 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:00:41,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:41,264 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-02-06 19:00:41,267 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:00:41,267 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 19:00:41,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 19:00:41,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:41,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153481150] [2025-02-06 19:00:41,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153481150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:00:41,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:00:41,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 19:00:41,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217515896] [2025-02-06 19:00:41,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:00:41,305 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:00:41,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -685329803, now seen corresponding path program 2 times [2025-02-06 19:00:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600101078] [2025-02-06 19:00:41,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:41,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:00:41,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:00:41,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:00:41,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:41,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:41,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:00:41,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:00:41,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:41,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:41,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:41,354 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:41,354 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:41,354 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:41,354 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:41,354 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:41,354 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:41,354 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:41,354 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:41,354 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2025-02-06 19:00:41,354 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:41,354 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:41,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:41,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:41,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:41,379 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:41,379 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:41,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:41,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:41,381 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-02-06 19:00:41,382 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-02-06 19:00:41,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:41,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:41,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-06 19:00:41,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:41,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:41,414 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-02-06 19:00:41,415 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-02-06 19:00:41,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:41,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:41,501 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:41,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-02-06 19:00:41,506 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:41,506 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:41,506 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:41,506 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:41,506 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:41,506 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:41,506 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:41,506 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:41,506 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2025-02-06 19:00:41,506 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:41,506 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:41,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:41,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:41,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:41,550 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:41,551 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:41,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:41,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:41,552 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-02-06 19:00:41,554 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-02-06 19:00:41,555 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-02-06 19:00:41,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:41,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:41,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:41,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:41,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:41,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:41,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:41,567 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:41,569 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-06 19:00:41,569 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:00:41,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:41,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:41,571 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-02-06 19:00:41,573 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-02-06 19:00:41,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:41,574 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:41,574 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:41,574 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-02-06 19:00:41,579 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-02-06 19:00:41,580 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:41,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:41,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 19:00:41,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:00:41,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:41,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:41,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:00:41,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:41,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:00:41,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:00:41,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:41,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:41,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:00:41,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:41,812 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-02-06 19:00:41,812 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-02-06 19:00:41,874 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-02-06 19:00:41,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:41,893 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-02-06 19:00:41,894 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-02-06 19:00:41,894 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-02-06 19:00:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2025-02-06 19:00:41,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 27 letters. Loop has 7 letters. [2025-02-06 19:00:41,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:41,895 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:00:41,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:41,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 19:00:41,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:00:41,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:41,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:41,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:00:41,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:42,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:00:42,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:00:42,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:42,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:42,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:00:42,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:42,114 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-02-06 19:00:42,117 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-02-06 19:00:42,165 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-02-06 19:00:42,169 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-02-06 19:00:42,169 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-02-06 19:00:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-02-06 19:00:42,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 27 letters. Loop has 7 letters. [2025-02-06 19:00:42,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:42,169 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:00:42,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:42,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 19:00:42,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:00:42,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:42,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:42,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:00:42,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:42,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:00:42,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:00:42,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:42,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:42,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:00:42,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:42,395 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-02-06 19:00:42,395 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-02-06 19:00:42,504 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-02-06 19:00:42,505 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-02-06 19:00:42,505 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-02-06 19:00:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2025-02-06 19:00:42,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 27 letters. Loop has 7 letters. [2025-02-06 19:00:42,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:42,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 34 letters. Loop has 7 letters. [2025-02-06 19:00:42,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:42,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 27 letters. Loop has 14 letters. [2025-02-06 19:00:42,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:42,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2445 states and 5285 transitions. [2025-02-06 19:00:42,524 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 57 [2025-02-06 19:00:42,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2445 states to 2000 states and 4030 transitions. [2025-02-06 19:00:42,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2025-02-06 19:00:42,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 383 [2025-02-06 19:00:42,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2000 states and 4030 transitions. [2025-02-06 19:00:42,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:42,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2000 states and 4030 transitions. [2025-02-06 19:00:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states and 4030 transitions. [2025-02-06 19:00:42,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1924. [2025-02-06 19:00:42,582 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-02-06 19:00:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3879 transitions. [2025-02-06 19:00:42,590 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1924 states and 3879 transitions. [2025-02-06 19:00:42,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:42,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:00:42,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:00:42,590 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-02-06 19:00:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:42,696 INFO L93 Difference]: Finished difference Result 1127 states and 2232 transitions. [2025-02-06 19:00:42,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1127 states and 2232 transitions. [2025-02-06 19:00:42,702 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-02-06 19:00:42,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1127 states to 620 states and 1244 transitions. [2025-02-06 19:00:42,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2025-02-06 19:00:42,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 244 [2025-02-06 19:00:42,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 620 states and 1244 transitions. [2025-02-06 19:00:42,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:42,708 INFO L218 hiAutomatonCegarLoop]: Abstraction has 620 states and 1244 transitions. [2025-02-06 19:00:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states and 1244 transitions. [2025-02-06 19:00:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 574. [2025-02-06 19:00:42,718 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-02-06 19:00:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1150 transitions. [2025-02-06 19:00:42,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 574 states and 1150 transitions. [2025-02-06 19:00:42,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:00:42,721 INFO L432 stractBuchiCegarLoop]: Abstraction has 574 states and 1150 transitions. [2025-02-06 19:00:42,721 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:00:42,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 1150 transitions. [2025-02-06 19:00:42,723 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-02-06 19:00:42,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:42,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:42,723 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-02-06 19:00:42,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:42,724 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-02-06 19:00:42,724 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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-02-06 19:00:42,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1871664325, now seen corresponding path program 1 times [2025-02-06 19:00:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:42,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112685444] [2025-02-06 19:00:42,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:42,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:42,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 19:00:42,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 19:00:42,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:42,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:42,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:42,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 19:00:42,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 19:00:42,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:42,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:42,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:42,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1821627982, now seen corresponding path program 1 times [2025-02-06 19:00:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:42,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362349303] [2025-02-06 19:00:42,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:42,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:42,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:00:42,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:00:42,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:42,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:42,736 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:42,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:00:42,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:00:42,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:42,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:42,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:42,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:42,738 INFO L85 PathProgramCache]: Analyzing trace with hash -14481902, now seen corresponding path program 2 times [2025-02-06 19:00:42,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:42,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707097818] [2025-02-06 19:00:42,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:42,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:42,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-02-06 19:00:42,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 19:00:42,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:00:42,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 19:00:42,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:42,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707097818] [2025-02-06 19:00:42,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707097818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:42,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709839840] [2025-02-06 19:00:42,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:42,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:42,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:42,812 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-02-06 19:00:42,815 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-02-06 19:00:42,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-02-06 19:00:42,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 19:00:42,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:00:42,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:42,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:00:42,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:00:42,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:00:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 19:00:42,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709839840] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:00:42,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:00:42,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-02-06 19:00:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182420984] [2025-02-06 19:00:42,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:00:43,072 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:43,072 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:43,072 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:43,072 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:43,072 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:43,072 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,072 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:43,072 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:43,072 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2025-02-06 19:00:43,072 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:43,072 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:43,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,137 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:43,137 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:43,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,139 INFO L229 MonitoredProcess]: Starting monitored process 53 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-02-06 19:00:43,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-02-06 19:00:43,141 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:43,141 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:43,152 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:43,152 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-02-06 19:00:43,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-02-06 19:00:43,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,161 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-02-06 19:00:43,162 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-02-06 19:00:43,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:43,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:43,178 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:43,178 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:00:43,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:43,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,186 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-02-06 19:00:43,187 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-02-06 19:00:43,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:43,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:43,199 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:43,199 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:00:43,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:43,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,207 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-02-06 19:00:43,208 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-02-06 19:00:43,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:43,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:43,219 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:43,219 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-02-06 19:00:43,224 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-02-06 19:00:43,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,227 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-02-06 19:00:43,228 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-02-06 19:00:43,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:43,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:43,238 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:43,239 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-02-06 19:00:43,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-02-06 19:00:43,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,247 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-02-06 19:00:43,247 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-02-06 19:00:43,249 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:43,249 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:43,264 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-02-06 19:00:43,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,267 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-02-06 19:00:43,268 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-02-06 19:00:43,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:43,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:43,365 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:43,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:43,370 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:43,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:43,370 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:43,370 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:43,370 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:43,370 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,370 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:43,370 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:43,370 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2025-02-06 19:00:43,370 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:43,370 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:43,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:43,428 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:43,428 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:43,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,430 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-02-06 19:00:43,432 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-02-06 19:00:43,433 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-02-06 19:00:43,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:43,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:43,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:43,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:43,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:43,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:43,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:43,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:43,460 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-02-06 19:00:43,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,465 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-02-06 19:00:43,477 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-02-06 19:00:43,478 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-02-06 19:00:43,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:43,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:43,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:43,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:43,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:43,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:43,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:43,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:43,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-02-06 19:00:43,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,498 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-02-06 19:00:43,503 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-02-06 19:00:43,503 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-02-06 19:00:43,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:43,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:43,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:43,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:43,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:43,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:43,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:43,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:43,521 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-02-06 19:00:43,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,527 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-02-06 19:00:43,528 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-02-06 19:00:43,529 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-02-06 19:00:43,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:43,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:43,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:43,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:43,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:43,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:43,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:43,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:43,549 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-02-06 19:00:43,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,551 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-02-06 19:00:43,553 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-02-06 19:00:43,553 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-02-06 19:00:43,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:43,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:43,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:43,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:43,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:43,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:43,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:43,566 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:43,571 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:00:43,571 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:00:43,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:43,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:43,574 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-02-06 19:00:43,575 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-02-06 19:00:43,576 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:43,576 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:43,576 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:43,576 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-02-06 19:00:43,582 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-02-06 19:00:43,582 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:43,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:43,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 19:00:43,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 19:00:43,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:43,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:43,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:00:43,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:43,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:00:43,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:00:43,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:43,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:43,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:00:43,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:43,807 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-02-06 19:00:43,807 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 574 states and 1150 transitions. cyclomatic complexity: 595 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-02-06 19:00:43,978 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 574 states and 1150 transitions. cyclomatic complexity: 595. 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 2135 states and 4399 transitions. Complement of second has 41 states. [2025-02-06 19:00:43,979 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-02-06 19:00:43,980 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-02-06 19:00:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2025-02-06 19:00:43,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 41 letters. Loop has 10 letters. [2025-02-06 19:00:43,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:43,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 51 letters. Loop has 10 letters. [2025-02-06 19:00:43,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:43,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 41 letters. Loop has 20 letters. [2025-02-06 19:00:43,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:43,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2135 states and 4399 transitions. [2025-02-06 19:00:43,994 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 100 [2025-02-06 19:00:44,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2135 states to 1599 states and 3530 transitions. [2025-02-06 19:00:44,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 441 [2025-02-06 19:00:44,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 488 [2025-02-06 19:00:44,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1599 states and 3530 transitions. [2025-02-06 19:00:44,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:44,014 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1599 states and 3530 transitions. [2025-02-06 19:00:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states and 3530 transitions. [2025-02-06 19:00:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1386. [2025-02-06 19:00:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 909 states have (on average 1.2530253025302531) internal successors, (1139), 1034 states have internal predecessors, (1139), 262 states have call successors, (268), 151 states have call predecessors, (268), 215 states have return successors, (1330), 200 states have call predecessors, (1330), 247 states have call successors, (1330) [2025-02-06 19:00:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2737 transitions. [2025-02-06 19:00:44,052 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1386 states and 2737 transitions. [2025-02-06 19:00:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:44,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:00:44,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:00:44,052 INFO L87 Difference]: Start difference. First operand 1386 states and 2737 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-02-06 19:00:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:44,124 INFO L93 Difference]: Finished difference Result 1694 states and 3159 transitions. [2025-02-06 19:00:44,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1694 states and 3159 transitions. [2025-02-06 19:00:44,133 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 109 [2025-02-06 19:00:44,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1694 states to 1594 states and 3025 transitions. [2025-02-06 19:00:44,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 460 [2025-02-06 19:00:44,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 460 [2025-02-06 19:00:44,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1594 states and 3025 transitions. [2025-02-06 19:00:44,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:44,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1594 states and 3025 transitions. [2025-02-06 19:00:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states and 3025 transitions. [2025-02-06 19:00:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1544. [2025-02-06 19:00:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1006 states have (on average 1.2495029821073558) internal successors, (1257), 1145 states have internal predecessors, (1257), 296 states have call successors, (304), 167 states have call predecessors, (304), 242 states have return successors, (1398), 231 states have call predecessors, (1398), 276 states have call successors, (1398) [2025-02-06 19:00:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2959 transitions. [2025-02-06 19:00:44,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1544 states and 2959 transitions. [2025-02-06 19:00:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 19:00:44,184 INFO L432 stractBuchiCegarLoop]: Abstraction has 1544 states and 2959 transitions. [2025-02-06 19:00:44,184 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:00:44,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1544 states and 2959 transitions. [2025-02-06 19:00:44,189 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 107 [2025-02-06 19:00:44,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:44,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:44,190 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-02-06 19:00:44,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:00:44,190 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" [2025-02-06 19:00:44,190 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-02-06 19:00:44,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1076834671, now seen corresponding path program 1 times [2025-02-06 19:00:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:44,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129763431] [2025-02-06 19:00:44,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:44,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:44,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 19:00:44,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:00:44,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:44,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 19:00:44,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:44,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129763431] [2025-02-06 19:00:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129763431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:44,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343090270] [2025-02-06 19:00:44,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:44,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:44,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:44,263 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:00:44,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-02-06 19:00:44,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 19:00:44,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:00:44,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:44,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:44,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:00:44,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 19:00:44,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:00:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 19:00:44,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343090270] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:00:44,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:00:44,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-02-06 19:00:44,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440968773] [2025-02-06 19:00:44,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:00:44,388 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:00:44,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash 37130476, now seen corresponding path program 2 times [2025-02-06 19:00:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553804525] [2025-02-06 19:00:44,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:44,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:44,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:44,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:44,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:00:44,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:44,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:44,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:44,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:44,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:44,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:44,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:44,490 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:44,490 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:44,491 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:44,491 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:44,491 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:44,491 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:44,491 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:44,491 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:44,491 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2025-02-06 19:00:44,491 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:44,491 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:44,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:44,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:44,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:44,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:44,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:44,540 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:44,540 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:44,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:44,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:44,542 INFO L229 MonitoredProcess]: Starting monitored process 67 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-02-06 19:00:44,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-02-06 19:00:44,547 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:44,547 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:44,558 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:44,558 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-02-06 19:00:44,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:44,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:44,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:44,570 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-02-06 19:00:44,571 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-02-06 19:00:44,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:44,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:44,594 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:44,594 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-02-06 19:00:44,607 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-02-06 19:00:44,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:44,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:44,612 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-02-06 19:00:44,613 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-02-06 19:00:44,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:44,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:44,640 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-02-06 19:00:44,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:44,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:44,642 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-02-06 19:00:44,642 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-02-06 19:00:44,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:44,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:44,905 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:44,914 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-02-06 19:00:44,915 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:44,915 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:44,915 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:44,915 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:44,915 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:44,915 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:44,915 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:44,915 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:44,915 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2025-02-06 19:00:44,915 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:44,915 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:44,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:44,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:44,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:44,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:44,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:44,967 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:44,967 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:44,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:44,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:44,969 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-02-06 19:00:44,970 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-02-06 19:00:44,971 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-02-06 19:00:44,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:44,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:44,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:44,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:44,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:44,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:44,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:44,985 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:44,988 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:00:44,988 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:00:44,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:44,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:44,990 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-02-06 19:00:44,991 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-02-06 19:00:44,992 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:44,992 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:44,992 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:44,992 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-02-06 19:00:44,998 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-02-06 19:00:44,998 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:45,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:45,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 19:00:45,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:00:45,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:45,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:45,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:00:45,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:45,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-02-06 19:00:45,153 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-02-06 19:00:45,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:45,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:45,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:45,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:45,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:00:45,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:45,304 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-02-06 19:00:45,304 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460 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-02-06 19:00:45,370 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460. 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 1635 states and 3065 transitions. Complement of second has 15 states. [2025-02-06 19:00:45,371 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-02-06 19:00:45,371 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-02-06 19:00:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2025-02-06 19:00:45,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 49 letters. Loop has 5 letters. [2025-02-06 19:00:45,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:45,372 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:00:45,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:45,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 19:00:45,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:00:45,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:45,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:45,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:00:45,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:45,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:45,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:45,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:45,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:45,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:00:45,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:45,549 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-02-06 19:00:45,550 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460 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-02-06 19:00:45,611 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460. 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 1635 states and 3065 transitions. Complement of second has 15 states. [2025-02-06 19:00:45,611 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-02-06 19:00:45,612 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-02-06 19:00:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2025-02-06 19:00:45,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 49 letters. Loop has 5 letters. [2025-02-06 19:00:45,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:45,612 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:00:45,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:45,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 19:00:45,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:00:45,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:45,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:45,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:00:45,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:45,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:00:45,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:00:45,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:45,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:45,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:00:45,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:45,788 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-02-06 19:00:45,788 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460 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-02-06 19:00:45,877 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1544 states and 2959 transitions. cyclomatic complexity: 1460. 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 2295 states and 4136 transitions. Complement of second has 20 states. [2025-02-06 19:00:45,878 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-02-06 19:00:45,878 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-02-06 19:00:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2025-02-06 19:00:45,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 49 letters. Loop has 5 letters. [2025-02-06 19:00:45,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:45,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 54 letters. Loop has 5 letters. [2025-02-06 19:00:45,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:45,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 49 letters. Loop has 10 letters. [2025-02-06 19:00:45,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:45,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2295 states and 4136 transitions. [2025-02-06 19:00:45,890 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 107 [2025-02-06 19:00:45,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2295 states to 1866 states and 3619 transitions. [2025-02-06 19:00:45,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2025-02-06 19:00:45,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 472 [2025-02-06 19:00:45,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1866 states and 3619 transitions. [2025-02-06 19:00:45,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:45,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1866 states and 3619 transitions. [2025-02-06 19:00:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states and 3619 transitions. [2025-02-06 19:00:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1731. [2025-02-06 19:00:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1110 states have (on average 1.2720720720720722) internal successors, (1412), 1292 states have internal predecessors, (1412), 375 states have call successors, (383), 206 states have call predecessors, (383), 246 states have return successors, (1365), 232 states have call predecessors, (1365), 357 states have call successors, (1365) [2025-02-06 19:00:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3160 transitions. [2025-02-06 19:00:45,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1731 states and 3160 transitions. [2025-02-06 19:00:45,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:45,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:00:45,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:00:45,947 INFO L87 Difference]: Start difference. First operand 1731 states and 3160 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-02-06 19:00:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:46,032 INFO L93 Difference]: Finished difference Result 1730 states and 3132 transitions. [2025-02-06 19:00:46,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1730 states and 3132 transitions. [2025-02-06 19:00:46,040 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 101 [2025-02-06 19:00:46,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1730 states to 1706 states and 3106 transitions. [2025-02-06 19:00:46,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 441 [2025-02-06 19:00:46,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 441 [2025-02-06 19:00:46,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1706 states and 3106 transitions. [2025-02-06 19:00:46,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:46,054 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1706 states and 3106 transitions. [2025-02-06 19:00:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states and 3106 transitions. [2025-02-06 19:00:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1673. [2025-02-06 19:00:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1072 states have (on average 1.271455223880597) internal successors, (1363), 1250 states have internal predecessors, (1363), 361 states have call successors, (367), 200 states have call predecessors, (367), 240 states have return successors, (1334), 222 states have call predecessors, (1334), 347 states have call successors, (1334) [2025-02-06 19:00:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 3064 transitions. [2025-02-06 19:00:46,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1673 states and 3064 transitions. [2025-02-06 19:00:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 19:00:46,088 INFO L432 stractBuchiCegarLoop]: Abstraction has 1673 states and 3064 transitions. [2025-02-06 19:00:46,088 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-06 19:00:46,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1673 states and 3064 transitions. [2025-02-06 19:00:46,093 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 99 [2025-02-06 19:00:46,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:46,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:46,093 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-02-06 19:00:46,094 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 19:00:46,094 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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-02-06 19:00:46,094 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#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);" [2025-02-06 19:00:46,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash -64031317, now seen corresponding path program 1 times [2025-02-06 19:00:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:46,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133405305] [2025-02-06 19:00:46,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:46,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:46,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 19:00:46,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 19:00:46,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:46,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-06 19:00:46,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:46,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133405305] [2025-02-06 19:00:46,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133405305] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:46,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926863720] [2025-02-06 19:00:46,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:46,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:46,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:46,180 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:00:46,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-02-06 19:00:46,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 19:00:46,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 19:00:46,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:46,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:46,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:00:46,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-06 19:00:46,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:00:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-06 19:00:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926863720] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:00:46,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:00:46,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-02-06 19:00:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986790809] [2025-02-06 19:00:46,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:00:46,321 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:00:46,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:46,321 INFO L85 PathProgramCache]: Analyzing trace with hash -928346155, now seen corresponding path program 2 times [2025-02-06 19:00:46,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:46,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30295260] [2025-02-06 19:00:46,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:46,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-06 19:00:46,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:00:46,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:00:46,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:46,324 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:46,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:00:46,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:00:46,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:46,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:46,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:46,533 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:46,533 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:46,533 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:46,533 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:46,533 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:46,533 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:46,533 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:46,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:46,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2025-02-06 19:00:46,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:46,533 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:46,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:46,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:46,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:46,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:46,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:46,592 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:46,592 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:46,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:46,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:46,594 INFO L229 MonitoredProcess]: Starting monitored process 74 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-02-06 19:00:46,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-02-06 19:00:46,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:46,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:46,606 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:46,606 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-02-06 19:00:46,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-02-06 19:00:46,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:46,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:46,614 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-02-06 19:00:46,615 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-02-06 19:00:46,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:46,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:46,626 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:46,626 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:00:46,631 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-02-06 19:00:46,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:46,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:46,634 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-02-06 19:00:46,635 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-02-06 19:00:46,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:46,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:46,646 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:46,646 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-02-06 19:00:46,651 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-02-06 19:00:46,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:46,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:46,653 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-02-06 19:00:46,653 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-02-06 19:00:46,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:46,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:46,667 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:46,667 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-02-06 19:00:46,672 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-02-06 19:00:46,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:46,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:46,674 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-02-06 19:00:46,674 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-02-06 19:00:46,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:46,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:46,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:46,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:46,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:46,703 INFO L229 MonitoredProcess]: Starting monitored process 79 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-02-06 19:00:46,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-02-06 19:00:46,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:46,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:46,931 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:46,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:46,940 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:46,940 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:46,940 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:46,940 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:46,940 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:46,940 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:46,940 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:46,940 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:46,940 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2025-02-06 19:00:46,940 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:46,940 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:46,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:46,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:46,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:46,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:46,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:46,992 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:46,992 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:46,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:46,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:46,994 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-02-06 19:00:46,995 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-02-06 19:00:46,996 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-02-06 19:00:47,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:47,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:47,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:47,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:47,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:47,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:47,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:47,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:47,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-02-06 19:00:47,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:47,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:47,015 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-02-06 19:00:47,016 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-02-06 19:00:47,016 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-02-06 19:00:47,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:47,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:47,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:47,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:47,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:47,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:47,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:47,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:47,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:47,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:47,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:47,035 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-02-06 19:00:47,036 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-02-06 19:00:47,038 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-02-06 19:00:47,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:47,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:47,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:47,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:47,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:47,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:47,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:47,052 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:47,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:00:47,055 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:00:47,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:47,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:47,057 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-02-06 19:00:47,059 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-02-06 19:00:47,059 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:47,059 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:47,059 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:47,059 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-02-06 19:00:47,067 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-02-06 19:00:47,067 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:47,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:47,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 19:00:47,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 19:00:47,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:47,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:47,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:00:47,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:47,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:00:47,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:00:47,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:47,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:47,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:00:47,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:47,395 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-02-06 19:00:47,396 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432 Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:00:47,662 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 8219 states and 15420 transitions. Complement of second has 50 states. [2025-02-06 19:00:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2025-02-06 19:00:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:00:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2025-02-06 19:00:47,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 79 transitions. Stem has 61 letters. Loop has 15 letters. [2025-02-06 19:00:47,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:47,664 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:00:47,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:47,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 19:00:47,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 19:00:47,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:47,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:47,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:00:47,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:47,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:47,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:00:47,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:00:47,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:47,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:47,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:00:47,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:47,988 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-02-06 19:00:47,989 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432 Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:00:48,258 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 8523 states and 16556 transitions. Complement of second has 48 states. [2025-02-06 19:00:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2025-02-06 19:00:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:00:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2025-02-06 19:00:48,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 72 transitions. Stem has 61 letters. Loop has 15 letters. [2025-02-06 19:00:48,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:48,259 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:00:48,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:48,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 19:00:48,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 19:00:48,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:48,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:48,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:00:48,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:48,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:00:48,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:00:48,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:48,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:48,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:00:48,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:48,551 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-02-06 19:00:48,552 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432 Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:00:48,977 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1673 states and 3064 transitions. cyclomatic complexity: 1432. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 20358 states and 40513 transitions. Complement of second has 334 states. [2025-02-06 19:00:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2025-02-06 19:00:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:00:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2025-02-06 19:00:48,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 61 letters. Loop has 15 letters. [2025-02-06 19:00:48,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:48,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 76 letters. Loop has 15 letters. [2025-02-06 19:00:48,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:48,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 87 transitions. Stem has 61 letters. Loop has 30 letters. [2025-02-06 19:00:48,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:48,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20358 states and 40513 transitions. [2025-02-06 19:00:49,116 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 104 [2025-02-06 19:00:49,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20358 states to 11007 states and 25018 transitions. [2025-02-06 19:00:49,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1082 [2025-02-06 19:00:49,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1254 [2025-02-06 19:00:49,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11007 states and 25018 transitions. [2025-02-06 19:00:49,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:49,465 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11007 states and 25018 transitions. [2025-02-06 19:00:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11007 states and 25018 transitions. [2025-02-06 19:00:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11007 to 8039. [2025-02-06 19:00:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8039 states, 5055 states have (on average 1.2660731948565775) internal successors, (6400), 5880 states have internal predecessors, (6400), 1945 states have call successors, (1997), 993 states have call predecessors, (1997), 1039 states have return successors, (4995), 1165 states have call predecessors, (4995), 1920 states have call successors, (4995) [2025-02-06 19:00:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8039 states to 8039 states and 13392 transitions. [2025-02-06 19:00:49,725 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8039 states and 13392 transitions. [2025-02-06 19:00:49,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:49,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 19:00:49,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 19:00:49,727 INFO L87 Difference]: Start difference. First operand 8039 states and 13392 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-02-06 19:00:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:49,812 INFO L93 Difference]: Finished difference Result 8082 states and 13470 transitions. [2025-02-06 19:00:49,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8082 states and 13470 transitions. [2025-02-06 19:00:49,934 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 84 [2025-02-06 19:00:49,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8082 states to 8068 states and 13453 transitions. [2025-02-06 19:00:49,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 941 [2025-02-06 19:00:49,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 941 [2025-02-06 19:00:49,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8068 states and 13453 transitions. [2025-02-06 19:00:50,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:50,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8068 states and 13453 transitions. [2025-02-06 19:00:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8068 states and 13453 transitions. [2025-02-06 19:00:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8068 to 8042. [2025-02-06 19:00:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8042 states, 5057 states have (on average 1.265967965196757) internal successors, (6402), 5882 states have internal predecessors, (6402), 1946 states have call successors, (1998), 993 states have call predecessors, (1998), 1039 states have return successors, (4996), 1166 states have call predecessors, (4996), 1921 states have call successors, (4996) [2025-02-06 19:00:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8042 states to 8042 states and 13396 transitions. [2025-02-06 19:00:50,231 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8042 states and 13396 transitions. [2025-02-06 19:00:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 19:00:50,232 INFO L432 stractBuchiCegarLoop]: Abstraction has 8042 states and 13396 transitions. [2025-02-06 19:00:50,232 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-06 19:00:50,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8042 states and 13396 transitions. [2025-02-06 19:00:50,246 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 75 [2025-02-06 19:00:50,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:50,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:50,247 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 6, 6, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:50,247 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:50,247 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" [2025-02-06 19:00:50,247 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;#res := 1;" "assume true;" >"#38#return;" [2025-02-06 19:00:50,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1195528394, now seen corresponding path program 2 times [2025-02-06 19:00:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:50,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724725059] [2025-02-06 19:00:50,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:50,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:50,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-02-06 19:00:50,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 19:00:50,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:00:50,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 19:00:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724725059] [2025-02-06 19:00:50,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724725059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:00:50,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:00:50,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 19:00:50,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129062687] [2025-02-06 19:00:50,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:00:50,290 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:00:50,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:50,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1417212244, now seen corresponding path program 3 times [2025-02-06 19:00:50,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:50,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172915504] [2025-02-06 19:00:50,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:00:50,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:50,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 2 equivalence classes. [2025-02-06 19:00:50,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:00:50,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 19:00:50,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:50,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:50,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:00:50,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:00:50,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:50,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:50,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:50,401 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:50,401 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:50,401 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:50,401 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:50,401 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:50,401 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:50,401 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:50,402 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:50,402 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2025-02-06 19:00:50,402 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:50,402 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:50,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:50,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:50,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:50,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:50,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:50,451 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:50,451 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:50,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:50,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:50,453 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-02-06 19:00:50,455 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-02-06 19:00:50,455 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:50,455 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:50,466 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:50,466 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-02-06 19:00:50,473 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-02-06 19:00:50,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:50,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:50,475 INFO L229 MonitoredProcess]: Starting monitored process 85 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-02-06 19:00:50,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-02-06 19:00:50,477 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:50,477 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:50,487 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:50,488 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-02-06 19:00:50,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-02-06 19:00:50,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:50,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:50,495 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-02-06 19:00:50,495 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-02-06 19:00:50,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:50,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:50,506 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:00:50,507 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-02-06 19:00:50,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-02-06 19:00:50,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:50,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:50,513 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-02-06 19:00:50,515 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-02-06 19:00:50,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:50,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:50,539 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-02-06 19:00:50,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:50,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:50,541 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-02-06 19:00:50,542 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-02-06 19:00:50,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:50,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:50,850 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:50,859 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-02-06 19:00:50,860 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:50,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:50,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:50,860 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:50,860 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:50,860 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:50,860 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:50,860 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:50,860 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2025-02-06 19:00:50,860 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:50,860 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:50,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:50,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:50,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:50,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:50,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:50,908 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:50,908 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:50,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:50,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:50,910 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-02-06 19:00:50,911 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-02-06 19:00:50,912 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-02-06 19:00:50,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:50,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:50,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:50,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:50,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:50,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:50,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:50,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:50,928 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-02-06 19:00:50,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:50,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:50,930 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-02-06 19:00:50,931 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-02-06 19:00:50,931 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-02-06 19:00:50,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:50,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:50,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:50,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:50,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:50,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:50,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:50,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:00:50,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-02-06 19:00:50,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:50,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:50,950 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-02-06 19:00:50,951 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-02-06 19:00:50,952 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-02-06 19:00:50,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:50,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:50,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:50,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:50,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:50,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:50,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:50,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:50,969 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:00:50,969 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:00:50,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:50,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:50,971 INFO L229 MonitoredProcess]: Starting monitored process 92 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-02-06 19:00:50,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-02-06 19:00:50,973 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:50,973 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:50,973 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:50,973 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2025-02-06 19:00:50,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:50,979 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:50,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:50,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 19:00:51,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 19:00:51,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:51,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:51,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:00:51,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:51,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:00:51,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:00:51,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:51,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:51,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:00:51,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:51,260 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-02-06 19:00:51,260 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525 Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 19:00:51,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-02-06 19:00:51,658 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 20125 states and 32565 transitions. Complement of second has 28 states. [2025-02-06 19:00:51,658 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-02-06 19:00:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 19:00:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2025-02-06 19:00:51,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 57 transitions. Stem has 68 letters. Loop has 10 letters. [2025-02-06 19:00:51,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:51,660 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:00:51,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:51,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 19:00:51,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 19:00:51,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:51,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:51,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:00:51,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:52,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:00:52,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:00:52,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:52,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:52,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:00:52,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:52,125 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-02-06 19:00:52,125 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525 Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 19:00:52,570 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 21481 states and 35900 transitions. Complement of second has 60 states. [2025-02-06 19:00:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2025-02-06 19:00:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 19:00:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 110 transitions. [2025-02-06 19:00:52,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 110 transitions. Stem has 68 letters. Loop has 10 letters. [2025-02-06 19:00:52,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:52,571 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:00:52,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:52,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 19:00:52,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 19:00:52,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:52,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:52,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:00:52,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:52,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:00:52,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:00:52,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:52,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:52,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:00:52,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:00:52,927 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-02-06 19:00:52,927 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525 Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 19:00:53,532 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8042 states and 13396 transitions. cyclomatic complexity: 5525. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 39296 states and 72125 transitions. Complement of second has 196 states. [2025-02-06 19:00:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2025-02-06 19:00:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 19:00:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2025-02-06 19:00:53,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 73 transitions. Stem has 68 letters. Loop has 10 letters. [2025-02-06 19:00:53,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:53,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 73 transitions. Stem has 78 letters. Loop has 10 letters. [2025-02-06 19:00:53,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:53,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 73 transitions. Stem has 68 letters. Loop has 20 letters. [2025-02-06 19:00:53,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:53,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39296 states and 72125 transitions. [2025-02-06 19:00:53,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-02-06 19:00:54,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39296 states to 13098 states and 25722 transitions. [2025-02-06 19:00:54,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 798 [2025-02-06 19:00:54,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 868 [2025-02-06 19:00:54,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13098 states and 25722 transitions. [2025-02-06 19:00:54,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:54,006 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13098 states and 25722 transitions. [2025-02-06 19:00:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13098 states and 25722 transitions. [2025-02-06 19:00:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13098 to 9822. [2025-02-06 19:00:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9822 states, 6090 states have (on average 1.2494252873563219) internal successors, (7609), 7005 states have internal predecessors, (7609), 2480 states have call successors, (2606), 1220 states have call predecessors, (2606), 1252 states have return successors, (5938), 1596 states have call predecessors, (5938), 2478 states have call successors, (5938) [2025-02-06 19:00:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9822 states to 9822 states and 16153 transitions. [2025-02-06 19:00:54,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9822 states and 16153 transitions. [2025-02-06 19:00:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:54,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 19:00:54,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 19:00:54,309 INFO L87 Difference]: Start difference. First operand 9822 states and 16153 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 19:00:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:54,404 INFO L93 Difference]: Finished difference Result 9899 states and 15811 transitions. [2025-02-06 19:00:54,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9899 states and 15811 transitions. [2025-02-06 19:00:54,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-02-06 19:00:54,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9899 states to 9547 states and 15449 transitions. [2025-02-06 19:00:54,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 582 [2025-02-06 19:00:54,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 582 [2025-02-06 19:00:54,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9547 states and 15449 transitions. [2025-02-06 19:00:54,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:54,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9547 states and 15449 transitions. [2025-02-06 19:00:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states and 15449 transitions. [2025-02-06 19:00:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 9406. [2025-02-06 19:00:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9406 states, 5842 states have (on average 1.2307428962684013) internal successors, (7190), 6700 states have internal predecessors, (7190), 2429 states have call successors, (2544), 1187 states have call predecessors, (2544), 1135 states have return successors, (5391), 1518 states have call predecessors, (5391), 2427 states have call successors, (5391) [2025-02-06 19:00:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9406 states to 9406 states and 15125 transitions. [2025-02-06 19:00:54,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9406 states and 15125 transitions. [2025-02-06 19:00:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 19:00:54,791 INFO L432 stractBuchiCegarLoop]: Abstraction has 9406 states and 15125 transitions. [2025-02-06 19:00:54,791 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-06 19:00:54,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9406 states and 15125 transitions. [2025-02-06 19:00:54,817 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-02-06 19:00:54,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:54,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:54,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 7, 7, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:54,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 9, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:54,819 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#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;#res := 0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" [2025-02-06 19:00:54,819 INFO L754 eck$LassoCheckResult]: Loop: "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;" >"#38#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~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;#res := 0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" [2025-02-06 19:00:54,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1889861346, now seen corresponding path program 1 times [2025-02-06 19:00:54,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:54,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516444398] [2025-02-06 19:00:54,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:54,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:54,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 19:00:54,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 19:00:54,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:54,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 57 proven. 23 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-02-06 19:00:54,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:54,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516444398] [2025-02-06 19:00:54,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516444398] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:54,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269430271] [2025-02-06 19:00:54,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:54,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:54,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:54,905 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:00:54,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2025-02-06 19:00:54,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 19:00:54,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 19:00:54,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:54,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:54,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:00:54,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-02-06 19:00:54,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:00:54,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269430271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:00:54,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:00:54,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-02-06 19:00:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033653947] [2025-02-06 19:00:54,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:00:54,968 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:00:54,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1560956917, now seen corresponding path program 1 times [2025-02-06 19:00:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:54,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723924065] [2025-02-06 19:00:54,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:54,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:54,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 19:00:54,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 19:00:54,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:54,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 71 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-06 19:00:55,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:55,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723924065] [2025-02-06 19:00:55,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723924065] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:55,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041168023] [2025-02-06 19:00:55,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:55,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:55,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:55,140 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:00:55,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2025-02-06 19:00:55,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 19:00:55,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 19:00:55,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:55,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:55,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:00:55,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 71 proven. 78 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-06 19:00:55,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:00:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 72 proven. 82 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-06 19:00:55,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041168023] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:00:55,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:00:55,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 18 [2025-02-06 19:00:55,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094609133] [2025-02-06 19:00:55,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:00:55,915 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:00:55,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:55,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 19:00:55,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-02-06 19:00:55,916 INFO L87 Difference]: Start difference. First operand 9406 states and 15125 transitions. cyclomatic complexity: 5883 Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 13 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (19), 9 states have call predecessors, (19), 13 states have call successors, (19) [2025-02-06 19:00:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:56,214 INFO L93 Difference]: Finished difference Result 11320 states and 19697 transitions. [2025-02-06 19:00:56,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11320 states and 19697 transitions. [2025-02-06 19:00:56,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-02-06 19:00:56,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11320 states to 7783 states and 13646 transitions. [2025-02-06 19:00:56,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 502 [2025-02-06 19:00:56,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 502 [2025-02-06 19:00:56,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7783 states and 13646 transitions. [2025-02-06 19:00:56,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:56,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7783 states and 13646 transitions. [2025-02-06 19:00:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7783 states and 13646 transitions. [2025-02-06 19:00:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7783 to 6518. [2025-02-06 19:00:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6518 states, 4069 states have (on average 1.211354141066601) internal successors, (4929), 4637 states have internal predecessors, (4929), 1666 states have call successors, (1733), 824 states have call predecessors, (1733), 783 states have return successors, (3547), 1056 states have call predecessors, (3547), 1664 states have call successors, (3547) [2025-02-06 19:00:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6518 states to 6518 states and 10209 transitions. [2025-02-06 19:00:56,469 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6518 states and 10209 transitions. [2025-02-06 19:00:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 19:00:56,470 INFO L432 stractBuchiCegarLoop]: Abstraction has 6518 states and 10209 transitions. [2025-02-06 19:00:56,470 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-02-06 19:00:56,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6518 states and 10209 transitions. [2025-02-06 19:00:56,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-06 19:00:56,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:56,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:56,482 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 7, 6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:56,483 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:00:56,483 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" [2025-02-06 19:00:56,483 INFO L754 eck$LassoCheckResult]: Loop: "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;" >"#38#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;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" [2025-02-06 19:00:56,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1302591480, now seen corresponding path program 2 times [2025-02-06 19:00:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:56,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120830560] [2025-02-06 19:00:56,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:56,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:56,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-02-06 19:00:56,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 19:00:56,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:00:56,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-02-06 19:00:56,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120830560] [2025-02-06 19:00:56,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120830560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941173837] [2025-02-06 19:00:56,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:56,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:56,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:56,536 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:00:56,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2025-02-06 19:00:56,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-02-06 19:00:56,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 19:00:56,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:00:56,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:56,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:00:56,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-06 19:00:56,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:00:56,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941173837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:00:56,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:00:56,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-02-06 19:00:56,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413727284] [2025-02-06 19:00:56,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:00:56,592 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:00:56,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1972220672, now seen corresponding path program 1 times [2025-02-06 19:00:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:56,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950709490] [2025-02-06 19:00:56,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:56,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:56,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 19:00:56,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:00:56,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:56,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 19:00:56,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950709490] [2025-02-06 19:00:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950709490] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227805721] [2025-02-06 19:00:56,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:56,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:56,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:56,677 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:00:56,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-02-06 19:00:56,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 19:00:56,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:00:56,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:56,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:56,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:00:56,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 19:00:56,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:00:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 19:00:57,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227805721] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:00:57,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:00:57,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2025-02-06 19:00:57,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941024866] [2025-02-06 19:00:57,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:00:57,065 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:00:57,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:57,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 19:00:57,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 19:00:57,065 INFO L87 Difference]: Start difference. First operand 6518 states and 10209 transitions. cyclomatic complexity: 3814 Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 7 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-06 19:00:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:57,192 INFO L93 Difference]: Finished difference Result 6277 states and 9455 transitions. [2025-02-06 19:00:57,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6277 states and 9455 transitions. [2025-02-06 19:00:57,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-02-06 19:00:57,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6277 states to 3283 states and 4714 transitions. [2025-02-06 19:00:57,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 286 [2025-02-06 19:00:57,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 324 [2025-02-06 19:00:57,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3283 states and 4714 transitions. [2025-02-06 19:00:57,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:57,228 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3283 states and 4714 transitions. [2025-02-06 19:00:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states and 4714 transitions. [2025-02-06 19:00:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 2820. [2025-02-06 19:00:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 1829 states have (on average 1.1607435757244395) internal successors, (2123), 2020 states have internal predecessors, (2123), 656 states have call successors, (679), 365 states have call predecessors, (679), 335 states have return successors, (1109), 434 states have call predecessors, (1109), 654 states have call successors, (1109) [2025-02-06 19:00:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3911 transitions. [2025-02-06 19:00:57,259 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2820 states and 3911 transitions. [2025-02-06 19:00:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 19:00:57,259 INFO L432 stractBuchiCegarLoop]: Abstraction has 2820 states and 3911 transitions. [2025-02-06 19:00:57,259 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-02-06 19:00:57,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2820 states and 3911 transitions. [2025-02-06 19:00:57,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-06 19:00:57,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:57,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:57,263 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 7, 6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:57,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:00:57,264 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" [2025-02-06 19:00:57,264 INFO L754 eck$LassoCheckResult]: Loop: "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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" [2025-02-06 19:00:57,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:57,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1302591480, now seen corresponding path program 3 times [2025-02-06 19:00:57,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:57,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238612957] [2025-02-06 19:00:57,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:00:57,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:57,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 5 equivalence classes. [2025-02-06 19:00:57,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 62 of 74 statements. [2025-02-06 19:00:57,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:00:57,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-02-06 19:00:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238612957] [2025-02-06 19:00:57,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238612957] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155876546] [2025-02-06 19:00:57,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:00:57,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:57,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:57,315 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:00:57,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2025-02-06 19:00:57,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 5 equivalence classes. [2025-02-06 19:00:57,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 62 of 74 statements. [2025-02-06 19:00:57,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:00:57,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:57,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:00:57,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-06 19:00:57,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:00:57,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155876546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:00:57,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:00:57,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2025-02-06 19:00:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833766208] [2025-02-06 19:00:57,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:00:57,370 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:00:57,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash -443579339, now seen corresponding path program 2 times [2025-02-06 19:00:57,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:57,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808045528] [2025-02-06 19:00:57,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:00:57,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:57,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-06 19:00:57,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:00:57,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:00:57,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:57,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:57,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 19:00:57,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:00:57,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:57,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:57,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:00:57,640 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:57,641 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:57,641 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:57,641 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:57,641 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:00:57,641 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:57,641 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:57,641 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:57,641 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2025-02-06 19:00:57,641 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:57,641 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:57,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:57,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:57,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:57,686 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:57,686 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:00:57,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:57,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:57,688 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-02-06 19:00:57,690 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-02-06 19:00:57,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:00:57,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:57,708 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-02-06 19:00:57,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:57,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:57,710 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-02-06 19:00:57,711 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-02-06 19:00:57,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:00:57,712 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:00:57,743 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:00:57,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-02-06 19:00:57,748 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:00:57,748 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:00:57,748 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:00:57,748 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:00:57,748 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:00:57,748 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:57,748 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:00:57,748 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:00:57,748 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2025-02-06 19:00:57,748 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:00:57,748 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:00:57,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:57,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:57,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:00:57,794 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:00:57,794 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:00:57,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:57,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:57,796 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-02-06 19:00:57,801 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-02-06 19:00:57,801 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-02-06 19:00:57,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:00:57,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:00:57,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:00:57,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:00:57,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:00:57,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:00:57,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:00:57,816 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:00:57,819 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-06 19:00:57,819 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-06 19:00:57,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:00:57,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:57,821 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-02-06 19:00:57,827 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-02-06 19:00:57,827 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:00:57,827 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:00:57,827 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:00:57,827 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-02-06 19:00:57,833 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-02-06 19:00:57,834 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:00:57,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:57,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 19:00:57,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 19:00:57,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:57,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:57,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:00:57,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:58,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 19:00:58,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:00:58,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:58,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:58,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:00:58,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 19:00:58,196 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-06 19:00:58,196 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2820 states and 3911 transitions. cyclomatic complexity: 1129 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 19:00:58,217 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2820 states and 3911 transitions. cyclomatic complexity: 1129. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 2838 states and 3931 transitions. Complement of second has 9 states. [2025-02-06 19:00:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 19:00:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 19:00:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-02-06 19:00:58,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 74 letters. Loop has 29 letters. [2025-02-06 19:00:58,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:58,218 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:00:58,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:58,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 19:00:58,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 19:00:58,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:58,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:58,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:00:58,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:58,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 19:00:58,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:00:58,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:58,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:58,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:00:58,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 19:00:58,533 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-06 19:00:58,533 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2820 states and 3911 transitions. cyclomatic complexity: 1129 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 19:00:58,552 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2820 states and 3911 transitions. cyclomatic complexity: 1129. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 2838 states and 3931 transitions. Complement of second has 9 states. [2025-02-06 19:00:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 19:00:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 19:00:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-02-06 19:00:58,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 74 letters. Loop has 29 letters. [2025-02-06 19:00:58,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:58,552 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:00:58,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:58,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 19:00:58,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 19:00:58,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:58,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:58,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:00:58,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:58,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 19:00:58,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:00:58,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:58,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:58,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:00:58,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 19:00:58,931 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-06 19:00:58,931 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2820 states and 3911 transitions. cyclomatic complexity: 1129 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 19:00:58,997 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2820 states and 3911 transitions. cyclomatic complexity: 1129. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 5620 states and 7803 transitions. Complement of second has 10 states. [2025-02-06 19:00:58,997 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-02-06 19:00:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 19:00:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2025-02-06 19:00:58,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 74 letters. Loop has 29 letters. [2025-02-06 19:00:58,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:58,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 103 letters. Loop has 29 letters. [2025-02-06 19:00:58,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:58,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 74 letters. Loop has 58 letters. [2025-02-06 19:00:58,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:00:58,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5620 states and 7803 transitions. [2025-02-06 19:00:59,015 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-06 19:00:59,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-02-06 19:00:59,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5620 states to 2821 states and 3912 transitions. [2025-02-06 19:00:59,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2025-02-06 19:00:59,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2025-02-06 19:00:59,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2821 states and 3912 transitions. [2025-02-06 19:00:59,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:59,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2821 states and 3912 transitions. [2025-02-06 19:00:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states and 3912 transitions. [2025-02-06 19:00:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2820. [2025-02-06 19:00:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 1829 states have (on average 1.1607435757244395) internal successors, (2123), 2020 states have internal predecessors, (2123), 656 states have call successors, (679), 365 states have call predecessors, (679), 335 states have return successors, (1109), 434 states have call predecessors, (1109), 654 states have call successors, (1109) [2025-02-06 19:00:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3911 transitions. [2025-02-06 19:00:59,103 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2820 states and 3911 transitions. [2025-02-06 19:00:59,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:00:59,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:00:59,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:00:59,103 INFO L87 Difference]: Start difference. First operand 2820 states and 3911 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-02-06 19:00:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:00:59,183 INFO L93 Difference]: Finished difference Result 2111 states and 2867 transitions. [2025-02-06 19:00:59,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2111 states and 2867 transitions. [2025-02-06 19:00:59,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-06 19:00:59,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2111 states to 2031 states and 2763 transitions. [2025-02-06 19:00:59,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2025-02-06 19:00:59,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 255 [2025-02-06 19:00:59,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2031 states and 2763 transitions. [2025-02-06 19:00:59,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:00:59,194 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2031 states and 2763 transitions. [2025-02-06 19:00:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states and 2763 transitions. [2025-02-06 19:00:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1943. [2025-02-06 19:00:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1264 states have (on average 1.1431962025316456) internal successors, (1445), 1379 states have internal predecessors, (1445), 444 states have call successors, (463), 252 states have call predecessors, (463), 235 states have return successors, (678), 311 states have call predecessors, (678), 442 states have call successors, (678) [2025-02-06 19:00:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2586 transitions. [2025-02-06 19:00:59,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1943 states and 2586 transitions. [2025-02-06 19:00:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:00:59,212 INFO L432 stractBuchiCegarLoop]: Abstraction has 1943 states and 2586 transitions. [2025-02-06 19:00:59,212 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-02-06 19:00:59,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1943 states and 2586 transitions. [2025-02-06 19:00:59,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-06 19:00:59,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:00:59,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:00:59,215 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 10, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:00:59,215 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-02-06 19:00:59,215 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:00:59,215 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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:00:59,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1122699400, now seen corresponding path program 4 times [2025-02-06 19:00:59,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:59,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5100076] [2025-02-06 19:00:59,216 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:00:59,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:59,219 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 120 statements into 2 equivalence classes. [2025-02-06 19:00:59,224 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 19:00:59,224 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:00:59,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 125 proven. 80 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-02-06 19:00:59,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:00:59,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5100076] [2025-02-06 19:00:59,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5100076] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:00:59,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593974099] [2025-02-06 19:00:59,303 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:00:59,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:00:59,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:00:59,305 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:00:59,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2025-02-06 19:00:59,335 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 120 statements into 2 equivalence classes. [2025-02-06 19:00:59,354 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 19:00:59,354 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:00:59,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:00:59,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:00:59,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:00:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 125 proven. 80 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-02-06 19:00:59,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:00:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 125 proven. 82 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-06 19:00:59,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593974099] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:00:59,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:00:59,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2025-02-06 19:00:59,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278609225] [2025-02-06 19:00:59,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:00:59,727 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:00:59,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:00:59,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1240692240, now seen corresponding path program 1 times [2025-02-06 19:00:59,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:00:59,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088820622] [2025-02-06 19:00:59,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:00:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:00:59,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 19:00:59,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 19:00:59,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:59,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:59,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:00:59,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 19:00:59,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 19:00:59,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:00:59,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:00:59,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:00,382 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:00,382 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:00,382 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:00,382 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:00,382 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:00,382 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:00,382 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:00,382 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:00,382 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration19_Loop [2025-02-06 19:01:00,382 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:00,382 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:00,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:00,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:00,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:00,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:00,419 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:00,419 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:00,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:00,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:00,421 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-02-06 19:01:00,422 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-02-06 19:01:00,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:00,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:00,434 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:00,434 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-02-06 19:01:00,441 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-02-06 19:01:00,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:00,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:00,443 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-02-06 19:01:00,444 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-02-06 19:01:00,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:00,445 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:00,461 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:00,462 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=2, ULTIMATE.start_main_~q~0#1=2} Honda state: {ULTIMATE.start_main_~x~0#1=2, ULTIMATE.start_main_~q~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 19:01:00,467 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-02-06 19:01:00,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:00,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:00,469 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-02-06 19:01:00,469 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-02-06 19:01:00,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:00,471 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:00,487 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-02-06 19:01:00,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:00,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:00,489 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-02-06 19:01:00,490 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-02-06 19:01:00,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:00,492 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:00,503 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:00,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-02-06 19:01:00,509 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:00,509 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:00,509 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:00,509 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:00,509 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:00,509 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:00,509 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:00,509 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:00,509 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration19_Loop [2025-02-06 19:01:00,509 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:00,509 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:00,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:00,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:00,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:00,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:00,543 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:00,543 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:00,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:00,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:00,545 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-02-06 19:01:00,546 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-02-06 19:01:00,547 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-02-06 19:01:00,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:00,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:00,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:00,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:00,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:00,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:00,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:00,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:00,565 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-02-06 19:01:00,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:00,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:00,568 INFO L229 MonitoredProcess]: Starting monitored process 108 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-02-06 19:01:00,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-02-06 19:01:00,571 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-02-06 19:01:00,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:00,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:00,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:00,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:00,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:00,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:00,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:00,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:00,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:00,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:00,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:00,591 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-02-06 19:01:00,592 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-02-06 19:01:00,593 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-02-06 19:01:00,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:00,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:00,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:00,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:00,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:00,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:00,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:00,604 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:00,606 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:00,606 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:01:00,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:00,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:00,608 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-02-06 19:01:00,608 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-02-06 19:01:00,609 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:00,609 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:00,609 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:00,609 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-02-06 19:01:00,615 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-02-06 19:01:00,616 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:00,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:00,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 19:01:00,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 19:01:00,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:00,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:00,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 19:01:00,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:01,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 19:01:01,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 19:01:01,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:01,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:01,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 19:01:01,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 14 proven. 47 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 19:01:01,425 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-02-06 19:01:01,425 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1943 states and 2586 transitions. cyclomatic complexity: 669 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-02-06 19:01:01,660 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1943 states and 2586 transitions. cyclomatic complexity: 669. 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 4444 states and 6151 transitions. Complement of second has 67 states. [2025-02-06 19:01:01,660 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-02-06 19:01:01,661 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-02-06 19:01:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 72 transitions. [2025-02-06 19:01:01,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 72 transitions. Stem has 120 letters. Loop has 60 letters. [2025-02-06 19:01:01,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:01,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 72 transitions. Stem has 180 letters. Loop has 60 letters. [2025-02-06 19:01:01,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:01,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 72 transitions. Stem has 120 letters. Loop has 120 letters. [2025-02-06 19:01:01,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:01,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4444 states and 6151 transitions. [2025-02-06 19:01:01,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2025-02-06 19:01:01,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4444 states to 4397 states and 6097 transitions. [2025-02-06 19:01:01,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 261 [2025-02-06 19:01:01,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 261 [2025-02-06 19:01:01,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4397 states and 6097 transitions. [2025-02-06 19:01:01,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:01,698 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4397 states and 6097 transitions. [2025-02-06 19:01:01,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states and 6097 transitions. [2025-02-06 19:01:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 3914. [2025-02-06 19:01:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3914 states, 2540 states have (on average 1.141732283464567) internal successors, (2900), 2769 states have internal predecessors, (2900), 893 states have call successors, (930), 507 states have call predecessors, (930), 481 states have return successors, (1361), 637 states have call predecessors, (1361), 891 states have call successors, (1361) [2025-02-06 19:01:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 5191 transitions. [2025-02-06 19:01:01,747 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3914 states and 5191 transitions. [2025-02-06 19:01:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:01,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 19:01:01,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 19:01:01,747 INFO L87 Difference]: Start difference. First operand 3914 states and 5191 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 8 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-06 19:01:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:01,955 INFO L93 Difference]: Finished difference Result 4914 states and 7438 transitions. [2025-02-06 19:01:01,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4914 states and 7438 transitions. [2025-02-06 19:01:01,974 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-06 19:01:02,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4914 states to 4518 states and 6690 transitions. [2025-02-06 19:01:02,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 287 [2025-02-06 19:01:02,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 287 [2025-02-06 19:01:02,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4518 states and 6690 transitions. [2025-02-06 19:01:02,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:02,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4518 states and 6690 transitions. [2025-02-06 19:01:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states and 6690 transitions. [2025-02-06 19:01:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3798. [2025-02-06 19:01:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3798 states, 2398 states have (on average 1.1359466221851542) internal successors, (2724), 2611 states have internal predecessors, (2724), 873 states have call successors, (907), 435 states have call predecessors, (907), 527 states have return successors, (1607), 751 states have call predecessors, (1607), 871 states have call successors, (1607) [2025-02-06 19:01:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 5238 transitions. [2025-02-06 19:01:02,053 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3798 states and 5238 transitions. [2025-02-06 19:01:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 19:01:02,054 INFO L432 stractBuchiCegarLoop]: Abstraction has 3798 states and 5238 transitions. [2025-02-06 19:01:02,054 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-02-06 19:01:02,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3798 states and 5238 transitions. [2025-02-06 19:01:02,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-06 19:01:02,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:02,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:02,061 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-02-06 19:01:02,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 13, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:02,061 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:02,061 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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:02,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 5 times [2025-02-06 19:01:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:02,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547106257] [2025-02-06 19:01:02,062 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:01:02,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:02,064 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 85 statements into 5 equivalence classes. [2025-02-06 19:01:02,071 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 19:01:02,072 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 19:01:02,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:02,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:02,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 19:01:02,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 19:01:02,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:02,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:02,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:02,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1175339157, now seen corresponding path program 2 times [2025-02-06 19:01:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:02,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807849639] [2025-02-06 19:01:02,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:02,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-02-06 19:01:02,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 19:01:02,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:02,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 82 proven. 236 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 19:01:02,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:02,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807849639] [2025-02-06 19:01:02,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807849639] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:02,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933286566] [2025-02-06 19:01:02,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:02,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:02,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:02,275 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:02,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2025-02-06 19:01:02,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-02-06 19:01:02,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 19:01:02,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:02,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:02,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:01:02,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 450 proven. 3 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-02-06 19:01:02,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 81 proven. 78 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-02-06 19:01:02,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933286566] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:02,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:02,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 21 [2025-02-06 19:01:02,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431732144] [2025-02-06 19:01:02,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:02,589 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:02,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:02,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 19:01:02,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-02-06 19:01:02,590 INFO L87 Difference]: Start difference. First operand 3798 states and 5238 transitions. cyclomatic complexity: 1491 Second operand has 21 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 13 states have call successors, (23), 2 states have call predecessors, (23), 8 states have return successors, (24), 13 states have call predecessors, (24), 13 states have call successors, (24) [2025-02-06 19:01:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:03,060 INFO L93 Difference]: Finished difference Result 4130 states and 5480 transitions. [2025-02-06 19:01:03,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4130 states and 5480 transitions. [2025-02-06 19:01:03,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-06 19:01:03,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4130 states to 1298 states and 1648 transitions. [2025-02-06 19:01:03,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2025-02-06 19:01:03,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2025-02-06 19:01:03,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1298 states and 1648 transitions. [2025-02-06 19:01:03,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:03,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1298 states and 1648 transitions. [2025-02-06 19:01:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states and 1648 transitions. [2025-02-06 19:01:03,129 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-02-06 19:01:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1024. [2025-02-06 19:01:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 686 states have (on average 1.0903790087463556) internal successors, (748), 717 states have internal predecessors, (748), 198 states have call successors, (209), 123 states have call predecessors, (209), 140 states have return successors, (279), 183 states have call predecessors, (279), 196 states have call successors, (279) [2025-02-06 19:01:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1236 transitions. [2025-02-06 19:01:03,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1024 states and 1236 transitions. [2025-02-06 19:01:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 19:01:03,134 INFO L432 stractBuchiCegarLoop]: Abstraction has 1024 states and 1236 transitions. [2025-02-06 19:01:03,134 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-02-06 19:01:03,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1024 states and 1236 transitions. [2025-02-06 19:01:03,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-06 19:01:03,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:03,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:03,136 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-02-06 19:01:03,136 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 19, 11, 9, 9, 9, 9, 9, 9, 8, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1] [2025-02-06 19:01:03,136 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:03,137 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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:03,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 6 times [2025-02-06 19:01:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937324726] [2025-02-06 19:01:03,138 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:01:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:03,141 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 85 statements into 5 equivalence classes. [2025-02-06 19:01:03,148 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 19:01:03,148 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 19:01:03,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:03,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:03,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 19:01:03,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 19:01:03,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:03,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:03,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:03,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2118065478, now seen corresponding path program 3 times [2025-02-06 19:01:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:03,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330921149] [2025-02-06 19:01:03,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:03,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 171 statements into 9 equivalence classes. [2025-02-06 19:01:03,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 168 of 171 statements. [2025-02-06 19:01:03,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-06 19:01:03,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 165 proven. 147 refuted. 0 times theorem prover too weak. 1150 trivial. 0 not checked. [2025-02-06 19:01:03,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:03,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330921149] [2025-02-06 19:01:03,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330921149] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:03,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310884840] [2025-02-06 19:01:03,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:03,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:03,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:03,352 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:03,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2025-02-06 19:01:03,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 171 statements into 9 equivalence classes. [2025-02-06 19:01:03,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 168 of 171 statements. [2025-02-06 19:01:03,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-06 19:01:03,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:03,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 19:01:03,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 164 proven. 148 refuted. 0 times theorem prover too weak. 1150 trivial. 0 not checked. [2025-02-06 19:01:03,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 164 proven. 148 refuted. 0 times theorem prover too weak. 1150 trivial. 0 not checked. [2025-02-06 19:01:03,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310884840] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:03,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:03,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2025-02-06 19:01:03,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594011223] [2025-02-06 19:01:03,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:03,915 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:03,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:03,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 19:01:03,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-02-06 19:01:03,916 INFO L87 Difference]: Start difference. First operand 1024 states and 1236 transitions. cyclomatic complexity: 228 Second operand has 17 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 10 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-06 19:01:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:04,091 INFO L93 Difference]: Finished difference Result 1128 states and 1398 transitions. [2025-02-06 19:01:04,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1128 states and 1398 transitions. [2025-02-06 19:01:04,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2025-02-06 19:01:04,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1128 states to 1128 states and 1398 transitions. [2025-02-06 19:01:04,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2025-02-06 19:01:04,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2025-02-06 19:01:04,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1128 states and 1398 transitions. [2025-02-06 19:01:04,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:04,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1128 states and 1398 transitions. [2025-02-06 19:01:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states and 1398 transitions. [2025-02-06 19:01:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1032. [2025-02-06 19:01:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 691 states have (on average 1.0897250361794502) internal successors, (753), 723 states have internal predecessors, (753), 198 states have call successors, (209), 123 states have call predecessors, (209), 143 states have return successors, (291), 185 states have call predecessors, (291), 196 states have call successors, (291) [2025-02-06 19:01:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1253 transitions. [2025-02-06 19:01:04,105 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1032 states and 1253 transitions. [2025-02-06 19:01:04,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 19:01:04,106 INFO L432 stractBuchiCegarLoop]: Abstraction has 1032 states and 1253 transitions. [2025-02-06 19:01:04,106 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-02-06 19:01:04,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1032 states and 1253 transitions. [2025-02-06 19:01:04,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-06 19:01:04,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:04,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:04,108 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-02-06 19:01:04,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 19, 11, 9, 9, 9, 9, 9, 9, 8, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1] [2025-02-06 19:01:04,108 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:04,110 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;" >"#40#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);" "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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:04,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 7 times [2025-02-06 19:01:04,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:04,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215621325] [2025-02-06 19:01:04,110 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:01:04,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:04,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 19:01:04,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 19:01:04,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:04,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:04,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:04,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 19:01:04,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 19:01:04,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:04,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:04,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:04,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1684047494, now seen corresponding path program 4 times [2025-02-06 19:01:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:04,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376595858] [2025-02-06 19:01:04,127 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:04,131 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 171 statements into 2 equivalence classes. [2025-02-06 19:01:04,141 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 19:01:04,141 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:01:04,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 173 proven. 164 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-02-06 19:01:04,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376595858] [2025-02-06 19:01:04,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376595858] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539346402] [2025-02-06 19:01:04,240 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:04,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:04,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:04,242 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:04,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2025-02-06 19:01:04,279 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 171 statements into 2 equivalence classes. [2025-02-06 19:01:04,309 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 19:01:04,310 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:01:04,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:04,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 19:01:04,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 779 proven. 208 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2025-02-06 19:01:04,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 105 proven. 410 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2025-02-06 19:01:04,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539346402] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:04,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:04,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 18] total 29 [2025-02-06 19:01:04,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508834952] [2025-02-06 19:01:04,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:04,974 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:04,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:04,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 19:01:04,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2025-02-06 19:01:04,975 INFO L87 Difference]: Start difference. First operand 1032 states and 1253 transitions. cyclomatic complexity: 237 Second operand has 29 states, 29 states have (on average 2.896551724137931) internal successors, (84), 27 states have internal predecessors, (84), 18 states have call successors, (27), 2 states have call predecessors, (27), 9 states have return successors, (31), 13 states have call predecessors, (31), 18 states have call successors, (31) [2025-02-06 19:01:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:05,770 INFO L93 Difference]: Finished difference Result 1615 states and 2107 transitions. [2025-02-06 19:01:05,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1615 states and 2107 transitions. [2025-02-06 19:01:05,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2025-02-06 19:01:05,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1615 states to 1581 states and 2010 transitions. [2025-02-06 19:01:05,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2025-02-06 19:01:05,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2025-02-06 19:01:05,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1581 states and 2010 transitions. [2025-02-06 19:01:05,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:05,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1581 states and 2010 transitions. [2025-02-06 19:01:05,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states and 2010 transitions. [2025-02-06 19:01:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1199. [2025-02-06 19:01:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 798 states have (on average 1.0789473684210527) internal successors, (861), 831 states have internal predecessors, (861), 223 states have call successors, (237), 136 states have call predecessors, (237), 178 states have return successors, (367), 231 states have call predecessors, (367), 221 states have call successors, (367) [2025-02-06 19:01:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1465 transitions. [2025-02-06 19:01:05,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1199 states and 1465 transitions. [2025-02-06 19:01:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 19:01:05,791 INFO L432 stractBuchiCegarLoop]: Abstraction has 1199 states and 1465 transitions. [2025-02-06 19:01:05,792 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-02-06 19:01:05,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1199 states and 1465 transitions. [2025-02-06 19:01:05,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2025-02-06 19:01:05,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:05,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:05,796 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-02-06 19:01:05,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 16, 9, 8, 8, 8, 8, 8, 8, 7, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:05,796 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:05,797 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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:05,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash 290039565, now seen corresponding path program 8 times [2025-02-06 19:01:05,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:05,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489088638] [2025-02-06 19:01:05,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:05,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-02-06 19:01:05,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 19:01:05,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:05,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:05,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:05,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 19:01:05,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 19:01:05,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:05,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:05,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:05,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash -672660034, now seen corresponding path program 5 times [2025-02-06 19:01:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055816646] [2025-02-06 19:01:05,814 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:01:05,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:05,817 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 149 statements into 7 equivalence classes. [2025-02-06 19:01:05,839 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 19:01:05,839 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-06 19:01:05,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:05,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:05,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 19:01:05,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 19:01:05,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:05,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:05,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:05,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1279671858, now seen corresponding path program 9 times [2025-02-06 19:01:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:05,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954035369] [2025-02-06 19:01:05,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:05,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:05,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 234 statements into 9 equivalence classes. [2025-02-06 19:01:05,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 218 of 234 statements. [2025-02-06 19:01:05,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 19:01:05,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 461 proven. 284 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2025-02-06 19:01:06,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:06,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954035369] [2025-02-06 19:01:06,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954035369] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:06,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577919061] [2025-02-06 19:01:06,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:06,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:06,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:06,165 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:06,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2025-02-06 19:01:06,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 234 statements into 9 equivalence classes. [2025-02-06 19:01:06,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 218 of 234 statements. [2025-02-06 19:01:06,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 19:01:06,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:06,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 19:01:06,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 217 proven. 254 refuted. 0 times theorem prover too weak. 2097 trivial. 0 not checked. [2025-02-06 19:01:06,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2568 backedges. 216 proven. 255 refuted. 0 times theorem prover too weak. 2097 trivial. 0 not checked. [2025-02-06 19:01:06,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577919061] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:06,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:06,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 31 [2025-02-06 19:01:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211908305] [2025-02-06 19:01:06,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:07,797 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:07,797 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:07,797 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:07,797 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:07,797 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:07,798 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:07,798 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:07,798 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:07,798 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration23_Loop [2025-02-06 19:01:07,798 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:07,798 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:07,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:07,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:07,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:07,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:07,826 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:07,826 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:07,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:07,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:07,828 INFO L229 MonitoredProcess]: Starting monitored process 115 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-02-06 19:01:07,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-02-06 19:01:07,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:07,831 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:07,841 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:07,841 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-02-06 19:01:07,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:07,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:07,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:07,850 INFO L229 MonitoredProcess]: Starting monitored process 116 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-02-06 19:01:07,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-02-06 19:01:07,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:07,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:07,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:07,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:07,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:07,869 INFO L229 MonitoredProcess]: Starting monitored process 117 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-02-06 19:01:07,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-02-06 19:01:07,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:07,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:07,882 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:07,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-02-06 19:01:07,892 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:07,892 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:07,892 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:07,892 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:07,892 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:07,892 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:07,892 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:07,892 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:07,892 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration23_Loop [2025-02-06 19:01:07,892 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:07,892 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:07,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:07,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:07,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:07,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:07,949 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:07,949 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:07,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:07,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:07,952 INFO L229 MonitoredProcess]: Starting monitored process 118 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-02-06 19:01:07,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-02-06 19:01:07,954 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-02-06 19:01:07,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:07,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:07,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:07,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:07,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:07,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:07,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:07,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:07,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:07,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:07,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:07,973 INFO L229 MonitoredProcess]: Starting monitored process 119 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-02-06 19:01:07,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-02-06 19:01:07,974 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-02-06 19:01:07,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:07,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:07,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:07,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:07,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:07,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:07,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:07,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:07,988 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:07,988 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:01:07,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:07,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:07,990 INFO L229 MonitoredProcess]: Starting monitored process 120 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-02-06 19:01:07,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-02-06 19:01:07,992 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:07,992 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:07,992 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:07,992 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 3 Supporting invariants [] [2025-02-06 19:01:07,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:07,999 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:08,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:08,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 19:01:08,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 19:01:08,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:08,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:08,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:01:08,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:08,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 19:01:08,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 19:01:08,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:08,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:08,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 19:01:08,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 24 proven. 245 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2025-02-06 19:01:08,804 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2025-02-06 19:01:08,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1199 states and 1465 transitions. cyclomatic complexity: 282 Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2025-02-06 19:01:09,092 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1199 states and 1465 transitions. cyclomatic complexity: 282. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) Result 3261 states and 4182 transitions. Complement of second has 101 states. [2025-02-06 19:01:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2025-02-06 19:01:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 87 transitions. [2025-02-06 19:01:09,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 87 transitions. Stem has 85 letters. Loop has 149 letters. [2025-02-06 19:01:09,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:09,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 87 transitions. Stem has 234 letters. Loop has 149 letters. [2025-02-06 19:01:09,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:09,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 87 transitions. Stem has 85 letters. Loop has 298 letters. [2025-02-06 19:01:09,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:09,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3261 states and 4182 transitions. [2025-02-06 19:01:09,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2025-02-06 19:01:09,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3261 states to 2750 states and 3486 transitions. [2025-02-06 19:01:09,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2025-02-06 19:01:09,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 300 [2025-02-06 19:01:09,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2750 states and 3486 transitions. [2025-02-06 19:01:09,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:09,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2750 states and 3486 transitions. [2025-02-06 19:01:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states and 3486 transitions. [2025-02-06 19:01:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2197. [2025-02-06 19:01:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2197 states, 1450 states have (on average 1.0772413793103448) internal successors, (1562), 1514 states have internal predecessors, (1562), 426 states have call successors, (452), 248 states have call predecessors, (452), 321 states have return successors, (681), 434 states have call predecessors, (681), 424 states have call successors, (681) [2025-02-06 19:01:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 2695 transitions. [2025-02-06 19:01:09,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2197 states and 2695 transitions. [2025-02-06 19:01:09,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:09,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 19:01:09,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2025-02-06 19:01:09,137 INFO L87 Difference]: Start difference. First operand 2197 states and 2695 transitions. Second operand has 32 states, 28 states have (on average 3.142857142857143) internal successors, (88), 28 states have internal predecessors, (88), 14 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (25), 18 states have call predecessors, (25), 14 states have call successors, (25) [2025-02-06 19:01:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:09,987 INFO L93 Difference]: Finished difference Result 2620 states and 3303 transitions. [2025-02-06 19:01:09,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2620 states and 3303 transitions. [2025-02-06 19:01:09,994 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2025-02-06 19:01:09,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2620 states to 1908 states and 2415 transitions. [2025-02-06 19:01:09,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2025-02-06 19:01:09,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2025-02-06 19:01:09,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1908 states and 2415 transitions. [2025-02-06 19:01:10,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:10,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1908 states and 2415 transitions. [2025-02-06 19:01:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states and 2415 transitions. [2025-02-06 19:01:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1654. [2025-02-06 19:01:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1145 states have (on average 1.0550218340611355) internal successors, (1208), 1181 states have internal predecessors, (1208), 294 states have call successors, (334), 196 states have call predecessors, (334), 215 states have return successors, (448), 276 states have call predecessors, (448), 292 states have call successors, (448) [2025-02-06 19:01:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 1990 transitions. [2025-02-06 19:01:10,017 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1654 states and 1990 transitions. [2025-02-06 19:01:10,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-06 19:01:10,018 INFO L432 stractBuchiCegarLoop]: Abstraction has 1654 states and 1990 transitions. [2025-02-06 19:01:10,018 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-02-06 19:01:10,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1654 states and 1990 transitions. [2025-02-06 19:01:10,021 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2025-02-06 19:01:10,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:10,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:10,022 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 11, 8, 7, 7, 6, 6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:01:10,022 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2025-02-06 19:01:10,023 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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-02-06 19:01:10,023 INFO L754 eck$LassoCheckResult]: Loop: "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);" "assume !(~q <= 0);" "assume ~q > ~p;" [2025-02-06 19:01:10,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2053666004, now seen corresponding path program 10 times [2025-02-06 19:01:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:10,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824148637] [2025-02-06 19:01:10,023 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:10,026 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 97 statements into 2 equivalence classes. [2025-02-06 19:01:10,034 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 19:01:10,034 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:01:10,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 83 proven. 38 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-06 19:01:10,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:10,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824148637] [2025-02-06 19:01:10,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824148637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:10,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525785630] [2025-02-06 19:01:10,112 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:10,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:10,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:10,114 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:10,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2025-02-06 19:01:10,150 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 97 statements into 2 equivalence classes. [2025-02-06 19:01:10,166 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 19:01:10,166 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:01:10,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:10,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:01:10,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 83 proven. 46 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-06 19:01:10,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 83 proven. 46 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-06 19:01:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525785630] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:10,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:10,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 23 [2025-02-06 19:01:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615703866] [2025-02-06 19:01:10,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:10,413 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:10,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1810248740, now seen corresponding path program 1 times [2025-02-06 19:01:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:10,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766609660] [2025-02-06 19:01:10,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:10,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:10,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:01:10,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:01:10,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:10,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766609660] [2025-02-06 19:01:10,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766609660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:10,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423514830] [2025-02-06 19:01:10,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:01:10,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:10,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:10,437 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:10,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2025-02-06 19:01:10,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:01:10,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:01:10,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:10,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:10,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:01:10,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:10,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:01:10,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423514830] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:10,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:10,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 19:01:10,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158635630] [2025-02-06 19:01:10,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:10,504 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:10,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:10,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:01:10,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:01:10,505 INFO L87 Difference]: Start difference. First operand 1654 states and 1990 transitions. cyclomatic complexity: 369 Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:01:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:10,553 INFO L93 Difference]: Finished difference Result 1657 states and 1992 transitions. [2025-02-06 19:01:10,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1657 states and 1992 transitions. [2025-02-06 19:01:10,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-02-06 19:01:10,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1657 states to 1285 states and 1486 transitions. [2025-02-06 19:01:10,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2025-02-06 19:01:10,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2025-02-06 19:01:10,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1285 states and 1486 transitions. [2025-02-06 19:01:10,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:10,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1285 states and 1486 transitions. [2025-02-06 19:01:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states and 1486 transitions. [2025-02-06 19:01:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1270. [2025-02-06 19:01:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 872 states have (on average 1.0527522935779816) internal successors, (918), 903 states have internal predecessors, (918), 223 states have call successors, (237), 157 states have call predecessors, (237), 175 states have return successors, (309), 209 states have call predecessors, (309), 223 states have call successors, (309) [2025-02-06 19:01:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1464 transitions. [2025-02-06 19:01:10,569 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1270 states and 1464 transitions. [2025-02-06 19:01:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:01:10,570 INFO L432 stractBuchiCegarLoop]: Abstraction has 1270 states and 1464 transitions. [2025-02-06 19:01:10,570 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-02-06 19:01:10,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1270 states and 1464 transitions. [2025-02-06 19:01:10,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-02-06 19:01:10,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:10,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:10,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:01:10,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [35, 35, 28, 16, 14, 14, 14, 14, 14, 14, 12, 7, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1] [2025-02-06 19:01:10,576 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:10,576 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;" >"#40#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);" "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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:10,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1770408651, now seen corresponding path program 11 times [2025-02-06 19:01:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:10,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160106668] [2025-02-06 19:01:10,577 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:01:10,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:10,580 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 121 statements into 6 equivalence classes. [2025-02-06 19:01:10,587 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 19:01:10,587 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-06 19:01:10,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:10,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:10,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 19:01:10,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 19:01:10,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:10,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:10,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:10,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:10,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1667657243, now seen corresponding path program 6 times [2025-02-06 19:01:10,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:10,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589699941] [2025-02-06 19:01:10,598 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:01:10,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:10,603 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 247 statements into 12 equivalence classes. [2025-02-06 19:01:10,648 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 219 of 247 statements. [2025-02-06 19:01:10,649 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-06 19:01:10,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:11,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-02-06 19:01:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3188 backedges. 914 proven. 470 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-02-06 19:01:11,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:11,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589699941] [2025-02-06 19:01:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589699941] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:11,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612975198] [2025-02-06 19:01:11,301 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:01:11,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:11,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:11,303 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:11,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2025-02-06 19:01:11,349 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 247 statements into 12 equivalence classes. [2025-02-06 19:01:11,393 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 219 of 247 statements. [2025-02-06 19:01:11,393 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-06 19:01:11,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:11,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 19:01:11,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3188 backedges. 886 proven. 482 refuted. 0 times theorem prover too weak. 1820 trivial. 0 not checked. [2025-02-06 19:01:11,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3188 backedges. 875 proven. 500 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-02-06 19:01:12,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612975198] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:12,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:12,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 18] total 34 [2025-02-06 19:01:12,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951689290] [2025-02-06 19:01:12,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:12,702 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:12,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:12,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 19:01:12,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1023, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 19:01:12,703 INFO L87 Difference]: Start difference. First operand 1270 states and 1464 transitions. cyclomatic complexity: 213 Second operand has 35 states, 28 states have (on average 3.5) internal successors, (98), 28 states have internal predecessors, (98), 22 states have call successors, (34), 1 states have call predecessors, (34), 9 states have return successors, (41), 19 states have call predecessors, (41), 22 states have call successors, (41) [2025-02-06 19:01:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:13,382 INFO L93 Difference]: Finished difference Result 1698 states and 2026 transitions. [2025-02-06 19:01:13,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1698 states and 2026 transitions. [2025-02-06 19:01:13,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-02-06 19:01:13,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1698 states to 1090 states and 1266 transitions. [2025-02-06 19:01:13,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2025-02-06 19:01:13,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2025-02-06 19:01:13,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1090 states and 1266 transitions. [2025-02-06 19:01:13,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:13,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1090 states and 1266 transitions. [2025-02-06 19:01:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states and 1266 transitions. [2025-02-06 19:01:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 986. [2025-02-06 19:01:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 693 states have (on average 1.0389610389610389) internal successors, (720), 707 states have internal predecessors, (720), 161 states have call successors, (175), 127 states have call predecessors, (175), 132 states have return successors, (225), 151 states have call predecessors, (225), 161 states have call successors, (225) [2025-02-06 19:01:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1120 transitions. [2025-02-06 19:01:13,398 INFO L240 hiAutomatonCegarLoop]: Abstraction has 986 states and 1120 transitions. [2025-02-06 19:01:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-06 19:01:13,401 INFO L432 stractBuchiCegarLoop]: Abstraction has 986 states and 1120 transitions. [2025-02-06 19:01:13,401 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-02-06 19:01:13,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 986 states and 1120 transitions. [2025-02-06 19:01:13,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-02-06 19:01:13,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:13,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:13,404 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:01:13,404 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [49, 49, 40, 24, 20, 20, 20, 20, 20, 20, 16, 9, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1] [2025-02-06 19:01:13,405 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:13,405 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;" >"#40#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);" "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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:13,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:13,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1770408651, now seen corresponding path program 12 times [2025-02-06 19:01:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:13,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930636000] [2025-02-06 19:01:13,406 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:01:13,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:13,409 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 121 statements into 6 equivalence classes. [2025-02-06 19:01:13,415 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 19:01:13,415 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-06 19:01:13,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:13,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:13,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 19:01:13,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 19:01:13,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:13,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:13,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:13,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:13,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1464293925, now seen corresponding path program 7 times [2025-02-06 19:01:13,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:13,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323261817] [2025-02-06 19:01:13,424 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:01:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:13,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-02-06 19:01:13,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-02-06 19:01:13,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:13,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:13,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:13,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-02-06 19:01:13,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-02-06 19:01:13,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:13,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:13,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:13,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:13,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1948532143, now seen corresponding path program 13 times [2025-02-06 19:01:13,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:13,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392343922] [2025-02-06 19:01:13,497 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:01:13,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:13,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-06 19:01:13,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-06 19:01:13,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:13,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10943 backedges. 342 proven. 834 refuted. 0 times theorem prover too weak. 9767 trivial. 0 not checked. [2025-02-06 19:01:13,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392343922] [2025-02-06 19:01:13,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392343922] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884997972] [2025-02-06 19:01:13,955 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:01:13,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:13,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:13,958 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:13,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2025-02-06 19:01:14,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-06 19:01:14,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-06 19:01:14,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:14,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:14,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:01:14,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10943 backedges. 5302 proven. 137 refuted. 0 times theorem prover too weak. 5504 trivial. 0 not checked. [2025-02-06 19:01:14,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10943 backedges. 348 proven. 827 refuted. 0 times theorem prover too weak. 9768 trivial. 0 not checked. [2025-02-06 19:01:14,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884997972] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:14,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:14,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 13] total 20 [2025-02-06 19:01:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551410776] [2025-02-06 19:01:14,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:18,881 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:18,881 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:18,881 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:18,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:18,882 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 19:01:18,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:18,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:18,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration26_Loop [2025-02-06 19:01:18,882 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:18,882 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:18,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:18,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:18,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:18,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:18,930 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:18,931 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 19:01:18,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:18,934 INFO L229 MonitoredProcess]: Starting monitored process 125 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-02-06 19:01:18,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-02-06 19:01:18,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:18,936 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:18,946 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 19:01:18,947 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-02-06 19:01:18,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:18,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:18,954 INFO L229 MonitoredProcess]: Starting monitored process 126 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-02-06 19:01:18,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-02-06 19:01:18,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 19:01:18,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:18,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-02-06 19:01:18,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:18,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:18,975 INFO L229 MonitoredProcess]: Starting monitored process 127 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-02-06 19:01:18,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-02-06 19:01:18,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 19:01:18,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 19:01:19,052 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 19:01:19,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:19,057 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:01:19,057 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:01:19,057 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:01:19,057 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:01:19,057 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:01:19,057 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:19,057 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:01:19,057 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:01:19,057 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration26_Loop [2025-02-06 19:01:19,057 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:01:19,057 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:01:19,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:19,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:19,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:19,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:01:19,108 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:01:19,108 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:01:19,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:19,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:19,111 INFO L229 MonitoredProcess]: Starting monitored process 128 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-02-06 19:01:19,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-02-06 19:01:19,114 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-02-06 19:01:19,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:19,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:19,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:19,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:19,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:19,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:19,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:19,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:01:19,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:19,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:19,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:19,133 INFO L229 MonitoredProcess]: Starting monitored process 129 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-02-06 19:01:19,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-02-06 19:01:19,135 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-02-06 19:01:19,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:01:19,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:01:19,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:01:19,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:01:19,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:01:19,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:01:19,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:01:19,150 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:01:19,153 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 19:01:19,153 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 19:01:19,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:01:19,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:19,158 INFO L229 MonitoredProcess]: Starting monitored process 130 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-02-06 19:01:19,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-02-06 19:01:19,160 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:01:19,160 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 19:01:19,160 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:01:19,160 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 5 Supporting invariants [] [2025-02-06 19:01:19,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-02-06 19:01:19,167 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 19:01:19,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:19,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 19:01:19,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 19:01:19,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:19,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:19,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 19:01:19,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:19,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-02-06 19:01:20,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-02-06 19:01:20,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:20,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:20,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 2238 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-02-06 19:01:20,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6377 backedges. 36 proven. 878 refuted. 0 times theorem prover too weak. 5463 trivial. 0 not checked. [2025-02-06 19:01:20,620 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2025-02-06 19:01:20,620 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 986 states and 1120 transitions. cyclomatic complexity: 149 Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-06 19:01:20,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-02-06 19:01:21,044 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 986 states and 1120 transitions. cyclomatic complexity: 149. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) Result 2384 states and 2797 transitions. Complement of second has 125 states. [2025-02-06 19:01:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 2 stem states 16 non-accepting loop states 1 accepting loop states [2025-02-06 19:01:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-06 19:01:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2025-02-06 19:01:21,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 104 transitions. Stem has 121 letters. Loop has 345 letters. [2025-02-06 19:01:21,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:21,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 104 transitions. Stem has 466 letters. Loop has 345 letters. [2025-02-06 19:01:21,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:21,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 104 transitions. Stem has 121 letters. Loop has 690 letters. [2025-02-06 19:01:21,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:01:21,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2384 states and 2797 transitions. [2025-02-06 19:01:21,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-02-06 19:01:21,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2384 states to 1982 states and 2364 transitions. [2025-02-06 19:01:21,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196 [2025-02-06 19:01:21,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2025-02-06 19:01:21,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1982 states and 2364 transitions. [2025-02-06 19:01:21,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:21,058 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1982 states and 2364 transitions. [2025-02-06 19:01:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states and 2364 transitions. [2025-02-06 19:01:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1654. [2025-02-06 19:01:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1147 states have (on average 1.0444638186573671) internal successors, (1198), 1172 states have internal predecessors, (1198), 278 states have call successors, (299), 206 states have call predecessors, (299), 229 states have return successors, (413), 275 states have call predecessors, (413), 278 states have call successors, (413) [2025-02-06 19:01:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 1910 transitions. [2025-02-06 19:01:21,071 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1654 states and 1910 transitions. [2025-02-06 19:01:21,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:21,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 19:01:21,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-02-06 19:01:21,072 INFO L87 Difference]: Start difference. First operand 1654 states and 1910 transitions. Second operand has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 16 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (25), 10 states have call predecessors, (25), 16 states have call successors, (25) [2025-02-06 19:01:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:21,370 INFO L93 Difference]: Finished difference Result 1776 states and 2104 transitions. [2025-02-06 19:01:21,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1776 states and 2104 transitions. [2025-02-06 19:01:21,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-02-06 19:01:21,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1776 states to 1722 states and 2034 transitions. [2025-02-06 19:01:21,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2025-02-06 19:01:21,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2025-02-06 19:01:21,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1722 states and 2034 transitions. [2025-02-06 19:01:21,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:21,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1722 states and 2034 transitions. [2025-02-06 19:01:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states and 2034 transitions. [2025-02-06 19:01:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1659. [2025-02-06 19:01:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1148 states have (on average 1.0452961672473868) internal successors, (1200), 1174 states have internal predecessors, (1200), 284 states have call successors, (308), 200 states have call predecessors, (308), 227 states have return successors, (432), 284 states have call predecessors, (432), 284 states have call successors, (432) [2025-02-06 19:01:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 1940 transitions. [2025-02-06 19:01:21,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1659 states and 1940 transitions. [2025-02-06 19:01:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 19:01:21,393 INFO L432 stractBuchiCegarLoop]: Abstraction has 1659 states and 1940 transitions. [2025-02-06 19:01:21,393 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-02-06 19:01:21,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1659 states and 1940 transitions. [2025-02-06 19:01:21,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-02-06 19:01:21,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:21,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:21,399 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [28, 28, 18, 12, 12, 12, 11, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1] [2025-02-06 19:01:21,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [51, 51, 42, 25, 21, 21, 21, 21, 21, 21, 17, 9, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1] [2025-02-06 19:01:21,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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:21,399 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;" >"#40#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);" "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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:21,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash -63891272, now seen corresponding path program 14 times [2025-02-06 19:01:21,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:21,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638103791] [2025-02-06 19:01:21,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:21,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:21,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 210 statements into 2 equivalence classes. [2025-02-06 19:01:21,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-02-06 19:01:21,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:21,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 250 proven. 118 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2025-02-06 19:01:21,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:21,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638103791] [2025-02-06 19:01:21,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638103791] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:21,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080055862] [2025-02-06 19:01:21,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:21,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:21,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:21,590 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:21,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2025-02-06 19:01:21,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 210 statements into 2 equivalence classes. [2025-02-06 19:01:21,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-02-06 19:01:21,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:21,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:21,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:01:21,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 1062 proven. 10 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2025-02-06 19:01:21,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 250 proven. 118 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2025-02-06 19:01:22,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080055862] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:22,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:22,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 17 [2025-02-06 19:01:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310998238] [2025-02-06 19:01:22,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:22,019 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:01:22,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2128696953, now seen corresponding path program 8 times [2025-02-06 19:01:22,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:22,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777402826] [2025-02-06 19:01:22,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:22,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 359 statements into 2 equivalence classes. [2025-02-06 19:01:22,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 359 of 359 statements. [2025-02-06 19:01:22,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:22,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6938 backedges. 177 proven. 1340 refuted. 0 times theorem prover too weak. 5421 trivial. 0 not checked. [2025-02-06 19:01:22,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777402826] [2025-02-06 19:01:22,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777402826] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26366422] [2025-02-06 19:01:22,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:01:22,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:22,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:22,641 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:22,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2025-02-06 19:01:22,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 359 statements into 2 equivalence classes. [2025-02-06 19:01:22,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 359 of 359 statements. [2025-02-06 19:01:22,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:01:22,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:22,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:01:22,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6938 backedges. 3639 proven. 399 refuted. 0 times theorem prover too weak. 2900 trivial. 0 not checked. [2025-02-06 19:01:22,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6938 backedges. 170 proven. 1353 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2025-02-06 19:01:23,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26366422] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:23,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:23,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 21] total 33 [2025-02-06 19:01:23,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038741994] [2025-02-06 19:01:23,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:23,956 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:23,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 19:01:23,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-02-06 19:01:23,957 INFO L87 Difference]: Start difference. First operand 1659 states and 1940 transitions. cyclomatic complexity: 309 Second operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 13 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 8 states have call predecessors, (19), 13 states have call successors, (19) [2025-02-06 19:01:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:24,145 INFO L93 Difference]: Finished difference Result 1521 states and 1721 transitions. [2025-02-06 19:01:24,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1521 states and 1721 transitions. [2025-02-06 19:01:24,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-02-06 19:01:24,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1521 states to 1433 states and 1625 transitions. [2025-02-06 19:01:24,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2025-02-06 19:01:24,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2025-02-06 19:01:24,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1433 states and 1625 transitions. [2025-02-06 19:01:24,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:24,152 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1433 states and 1625 transitions. [2025-02-06 19:01:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states and 1625 transitions. [2025-02-06 19:01:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1417. [2025-02-06 19:01:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 975 states have (on average 1.042051282051282) internal successors, (1016), 995 states have internal predecessors, (1016), 244 states have call successors, (255), 170 states have call predecessors, (255), 198 states have return successors, (335), 251 states have call predecessors, (335), 244 states have call successors, (335) [2025-02-06 19:01:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1606 transitions. [2025-02-06 19:01:24,161 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1417 states and 1606 transitions. [2025-02-06 19:01:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 19:01:24,162 INFO L432 stractBuchiCegarLoop]: Abstraction has 1417 states and 1606 transitions. [2025-02-06 19:01:24,162 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-02-06 19:01:24,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1417 states and 1606 transitions. [2025-02-06 19:01:24,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2025-02-06 19:01:24,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:24,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:24,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-02-06 19:01:24,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [51, 51, 42, 25, 21, 21, 21, 21, 21, 21, 17, 9, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1] [2025-02-06 19:01:24,166 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:24,166 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;" >"#40#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);" "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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:24,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:24,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2066472244, now seen corresponding path program 15 times [2025-02-06 19:01:24,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:24,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507245309] [2025-02-06 19:01:24,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:24,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 270 statements into 12 equivalence classes. [2025-02-06 19:01:24,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 19:01:24,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-06 19:01:24,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:24,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:24,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 19:01:24,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 19:01:24,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:24,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:24,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:24,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2128696953, now seen corresponding path program 9 times [2025-02-06 19:01:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:24,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205464775] [2025-02-06 19:01:24,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:24,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 359 statements into 15 equivalence classes. [2025-02-06 19:01:24,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 306 of 359 statements. [2025-02-06 19:01:24,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-06 19:01:24,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6938 backedges. 249 proven. 1075 refuted. 0 times theorem prover too weak. 5614 trivial. 0 not checked. [2025-02-06 19:01:24,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205464775] [2025-02-06 19:01:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205464775] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321021936] [2025-02-06 19:01:24,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:01:24,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:24,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:24,866 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:24,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2025-02-06 19:01:24,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 359 statements into 15 equivalence classes. [2025-02-06 19:01:25,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 306 of 359 statements. [2025-02-06 19:01:25,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-06 19:01:25,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:25,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 19:01:25,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6938 backedges. 239 proven. 1042 refuted. 0 times theorem prover too weak. 5657 trivial. 0 not checked. [2025-02-06 19:01:25,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:26,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6938 backedges. 237 proven. 1046 refuted. 0 times theorem prover too weak. 5655 trivial. 0 not checked. [2025-02-06 19:01:26,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321021936] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:26,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:26,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 17] total 35 [2025-02-06 19:01:26,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824792080] [2025-02-06 19:01:26,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:26,158 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:26,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:26,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 19:01:26,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 19:01:26,159 INFO L87 Difference]: Start difference. First operand 1417 states and 1606 transitions. cyclomatic complexity: 210 Second operand has 36 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 24 states have call successors, (30), 1 states have call predecessors, (30), 7 states have return successors, (31), 15 states have call predecessors, (31), 24 states have call successors, (31) [2025-02-06 19:01:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:26,687 INFO L93 Difference]: Finished difference Result 1579 states and 1832 transitions. [2025-02-06 19:01:26,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1579 states and 1832 transitions. [2025-02-06 19:01:26,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2025-02-06 19:01:26,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1579 states to 1579 states and 1830 transitions. [2025-02-06 19:01:26,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2025-02-06 19:01:26,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2025-02-06 19:01:26,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1579 states and 1830 transitions. [2025-02-06 19:01:26,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:01:26,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1579 states and 1830 transitions. [2025-02-06 19:01:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states and 1830 transitions. [2025-02-06 19:01:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1427. [2025-02-06 19:01:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 981 states have (on average 1.0417940876656473) internal successors, (1022), 1003 states have internal predecessors, (1022), 248 states have call successors, (259), 170 states have call predecessors, (259), 198 states have return successors, (343), 253 states have call predecessors, (343), 248 states have call successors, (343) [2025-02-06 19:01:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1624 transitions. [2025-02-06 19:01:26,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1427 states and 1624 transitions. [2025-02-06 19:01:26,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 19:01:26,709 INFO L432 stractBuchiCegarLoop]: Abstraction has 1427 states and 1624 transitions. [2025-02-06 19:01:26,709 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-02-06 19:01:26,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1427 states and 1624 transitions. [2025-02-06 19:01:26,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2025-02-06 19:01:26,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:01:26,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:01:26,712 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-02-06 19:01:26,712 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [68, 68, 56, 34, 28, 28, 28, 28, 28, 28, 22, 12, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2025-02-06 19:01:26,713 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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#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;" >"#40#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:26,713 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;" >"#40#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);" "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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#40#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;" >"#38#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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#38#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~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;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#38#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#36#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#40#return;" [2025-02-06 19:01:26,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2066472244, now seen corresponding path program 16 times [2025-02-06 19:01:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873585607] [2025-02-06 19:01:26,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:26,720 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 270 statements into 2 equivalence classes. [2025-02-06 19:01:26,733 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 19:01:26,733 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:01:26,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:26,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:01:26,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 19:01:26,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 19:01:26,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:01:26,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:01:26,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:01:26,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:01:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash -653066499, now seen corresponding path program 10 times [2025-02-06 19:01:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:01:26,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14980312] [2025-02-06 19:01:26,753 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:26,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:01:26,760 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 478 statements into 2 equivalence classes. [2025-02-06 19:01:26,786 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-06 19:01:26,786 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:01:26,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12428 backedges. 180 proven. 1891 refuted. 0 times theorem prover too weak. 10357 trivial. 0 not checked. [2025-02-06 19:01:27,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:01:27,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14980312] [2025-02-06 19:01:27,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14980312] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:01:27,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350674603] [2025-02-06 19:01:27,241 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:01:27,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:01:27,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:01:27,243 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:01:27,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2025-02-06 19:01:27,332 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 478 statements into 2 equivalence classes. [2025-02-06 19:01:27,418 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-06 19:01:27,418 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:01:27,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:01:27,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:01:27,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:01:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12428 backedges. 5694 proven. 399 refuted. 0 times theorem prover too weak. 6335 trivial. 0 not checked. [2025-02-06 19:01:27,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:01:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12428 backedges. 180 proven. 1906 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2025-02-06 19:01:28,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350674603] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:01:28,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:01:28,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 21] total 29 [2025-02-06 19:01:28,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037560871] [2025-02-06 19:01:28,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:01:28,625 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:01:28,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:01:28,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 19:01:28,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2025-02-06 19:01:28,627 INFO L87 Difference]: Start difference. First operand 1427 states and 1624 transitions. cyclomatic complexity: 218 Second operand has 29 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 27 states have internal predecessors, (88), 20 states have call successors, (27), 2 states have call predecessors, (27), 8 states have return successors, (32), 11 states have call predecessors, (32), 20 states have call successors, (32) [2025-02-06 19:01:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:01:29,343 INFO L93 Difference]: Finished difference Result 1737 states and 2044 transitions. [2025-02-06 19:01:29,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1737 states and 2044 transitions. [2025-02-06 19:01:29,348 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:01:29,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1737 states to 0 states and 0 transitions. [2025-02-06 19:01:29,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 19:01:29,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 19:01:29,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 19:01:29,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:01:29,348 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:01:29,348 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:01:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 19:01:29,349 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:01:29,349 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-02-06 19:01:29,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 19:01:29,349 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:01:29,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 19:01:29,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:01:29 BoogieIcfgContainer [2025-02-06 19:01:29,356 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:01:29,357 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:01:29,357 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:01:29,357 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:01:29,358 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:00:34" (3/4) ... [2025-02-06 19:01:29,359 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 19:01:29,360 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:01:29,361 INFO L158 Benchmark]: Toolchain (without parser) took 55482.39ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 115.4MB in the beginning and 169.7MB in the end (delta: -54.3MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:29,361 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:29,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.63ms. Allocated memory is still 142.6MB. Free memory was 115.4MB in the beginning and 104.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:29,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.06ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 104.0MB in the end (delta: 924.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:29,362 INFO L158 Benchmark]: Boogie Preprocessor took 13.84ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 102.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:29,363 INFO L158 Benchmark]: IcfgBuilder took 181.32ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 91.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:01:29,363 INFO L158 Benchmark]: BuchiAutomizer took 55121.76ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 91.3MB in the beginning and 169.8MB in the end (delta: -78.5MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2025-02-06 19:01:29,363 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 251.7MB. Free memory was 169.8MB in the beginning and 169.7MB in the end (delta: 73.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:01:29,364 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.63ms. Allocated memory is still 142.6MB. Free memory was 115.4MB in the beginning and 104.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.06ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 104.0MB in the end (delta: 924.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.84ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 102.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 181.32ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 91.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 55121.76ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 91.3MB in the beginning and 169.8MB in the end (delta: -78.5MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 251.7MB. Free memory was 169.8MB in the beginning and 169.7MB in the end (delta: 73.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 42 terminating modules (27 trivial, 10 deterministic, 5 nondeterministic). One deterministic module has affine ranking function ((long) -1 * p) and consists of 3 locations. One deterministic module has affine ranking function (((long) -2 * p) + 1) and consists of 8 locations. One deterministic module has affine ranking function (((long) -2 * q) + 1) and consists of 8 locations. One deterministic module has affine ranking function (((long) -1 * q) + x) and consists of 6 locations. One deterministic module has affine ranking function \old(q) and consists of 7 locations. One deterministic module has affine ranking function \old(p) and consists of 8 locations. One deterministic module has affine ranking function \old(q) and consists of 10 locations. One deterministic module has affine ranking function (((long) -2 * p) + 1) and consists of 14 locations. One deterministic module has affine ranking function (3 + ((long) -2 * p)) and consists of 16 locations. One deterministic module has affine ranking function (5 + ((long) -2 * p)) and consists of 19 locations. One nondeterministic module has affine ranking function (((long) -1 * q) + x) and consists of 6 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 11 locations. One nondeterministic module has affine ranking function q and consists of 13 locations. One nondeterministic module has affine ranking function (((long) -1 * q) + x) and consists of 6 locations. 27 modules have a trivial ranking function, the largest among these consists of 36 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 55.0s and 30 iterations. TraceHistogramMax:68. Analysis of lassos took 30.6s. Construction of modules took 5.2s. Büchi inclusion checks took 16.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 40. Automata minimization 2.0s AutomataMinimizationTime, 41 MinimizatonAttempts, 13392 StatesRemovedByMinimization, 40 NontrivialMinimizations. Non-live state removal took 2.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [10, 0, 5, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6487/7666 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2228 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2146 mSDsluCounter, 5509 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4099 mSDsCounter, 1625 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10075 IncrementalHoareTripleChecker+Invalid, 11700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1625 mSolverCounterUnsat, 1410 mSDtfsCounter, 10075 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT2 conc0 concLT5 SILN0 SILU0 SILI5 SILT8 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp85 ukn100 mio100 lsp100 div114 bol100 ite100 ukn100 eq158 hnf92 smp94 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 64ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 27 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 15 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-06 19:01:29,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2025-02-06 19:01:29,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Ended with exit code 0 [2025-02-06 19:01:29,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:29,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Ended with exit code 0 [2025-02-06 19:01:30,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:30,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:30,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:30,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2025-02-06 19:01:30,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2025-02-06 19:01:31,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2025-02-06 19:01:31,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:31,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:31,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:32,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:32,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:32,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:32,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2025-02-06 19:01:32,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:33,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:33,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:33,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:33,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:33,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:34,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-02-06 19:01:34,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-02-06 19:01:34,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE