./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-numeric/Parts.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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-?-8fc3dc6-m [2025-03-17 19:52:06,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:52:06,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:52:06,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:52:06,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:52:06,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:52:06,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:52:06,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:52:06,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:52:06,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:52:06,593 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:52:06,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:52:06,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:52:06,594 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:52:06,594 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:52:06,594 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:52:06,594 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:52:06,594 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:52:06,594 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:52:06,594 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:52:06,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:52:06,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:52:06,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:52:06,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:52:06,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:52:06,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:52:06,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:52:06,595 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:52:06,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:52:06,595 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:52:06,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:52:06,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:52:06,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:52:06,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:52:06,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:52:06,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:52:06,595 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:52:06,595 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/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-03-17 19:52:06,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:52:06,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:52:06,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:52:06,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:52:06,812 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:52:06,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Parts.c [2025-03-17 19:52:07,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ab46677/618903951902436fa950c28813464bbe/FLAG939fdf517 [2025-03-17 19:52:08,237 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:52:08,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2025-03-17 19:52:08,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ab46677/618903951902436fa950c28813464bbe/FLAG939fdf517 [2025-03-17 19:52:08,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ab46677/618903951902436fa950c28813464bbe [2025-03-17 19:52:08,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:52:08,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:52:08,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:52:08,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:52:08,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:52:08,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4128f156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08, skipping insertion in model container [2025-03-17 19:52:08,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:52:08,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:52:08,378 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:52:08,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:52:08,397 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:52:08,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08 WrapperNode [2025-03-17 19:52:08,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:52:08,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:52:08,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:52:08,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:52:08,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,417 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2025-03-17 19:52:08,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:52:08,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:52:08,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:52:08,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:52:08,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,427 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:52:08,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,430 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:52:08,438 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:52:08,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:52:08,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:52:08,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (1/1) ... [2025-03-17 19:52:08,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:08,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:08,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:08,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:52:08,494 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2025-03-17 19:52:08,494 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2025-03-17 19:52:08,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:52:08,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:52:08,532 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:52:08,533 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:52:08,636 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 19:52:08,637 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:52:08,642 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:52:08,642 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:52:08,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:52:08 BoogieIcfgContainer [2025-03-17 19:52:08,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:52:08,643 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:52:08,643 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:52:08,647 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:52:08,648 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:08,648 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:52:08" (1/3) ... [2025-03-17 19:52:08,649 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5545e004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:52:08, skipping insertion in model container [2025-03-17 19:52:08,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:08,649 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:52:08" (2/3) ... [2025-03-17 19:52:08,649 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5545e004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:52:08, skipping insertion in model container [2025-03-17 19:52:08,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:52:08,649 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:52:08" (3/3) ... [2025-03-17 19:52:08,651 INFO L363 chiAutomizerObserver]: Analyzing ICFG Parts.c [2025-03-17 19:52:08,689 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:52:08,689 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:52:08,689 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:52:08,689 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:52:08,689 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:52:08,689 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:52:08,690 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:52:08,690 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:52:08,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-03-17 19:52:08,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-17 19:52:08,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:08,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:08,710 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:52:08,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:52:08,711 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:52:08,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-03-17 19:52:08,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-17 19:52:08,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:08,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:08,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:52:08,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:52:08,717 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-03-17 19:52:08,717 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-03-17 19:52:08,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash 59544, now seen corresponding path program 1 times [2025-03-17 19:52:08,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:08,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019286381] [2025-03-17 19:52:08,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:08,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:08,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:08,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:08,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:08,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:08,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:08,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:08,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:08,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:08,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:08,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1565, now seen corresponding path program 1 times [2025-03-17 19:52:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:08,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480050309] [2025-03-17 19:52:08,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:08,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:52:08,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:52:08,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:08,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:08,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:08,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:52:08,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:52:08,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:08,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:08,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:08,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash 57222388, now seen corresponding path program 1 times [2025-03-17 19:52:08,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:08,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007603612] [2025-03-17 19:52:08,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:08,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:08,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:08,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:08,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:08,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:08,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007603612] [2025-03-17 19:52:08,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007603612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:08,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:52:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499586789] [2025-03-17 19:52:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:08,929 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:08,929 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:08,929 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:08,929 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:08,929 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:08,929 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:08,929 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:08,929 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:08,929 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration1_Loop [2025-03-17 19:52:08,930 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:08,930 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:08,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:08,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:08,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:08,977 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:08,978 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:08,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:08,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:08,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:08,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:52:08,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:08,982 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:09,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:52:09,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:09,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:09,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:09,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:52:09,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:09,012 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:09,090 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:09,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-17 19:52:09,095 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:09,095 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:09,095 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:09,095 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:09,095 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:09,095 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:09,095 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:09,095 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:09,095 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration1_Loop [2025-03-17 19:52:09,095 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:09,095 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:09,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,145 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:09,148 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:09,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:09,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:09,154 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:09,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:52:09,156 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-03-17 19:52:09,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:09,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:09,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:09,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:09,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:09,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:09,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:09,176 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:09,183 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-17 19:52:09,186 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-17 19:52:09,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:09,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:09,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:09,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:52:09,193 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:09,193 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:09,195 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:09,195 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-03-17 19:52:09,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 19:52:09,204 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:09,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:09,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:09,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:09,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:09,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:09,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:09,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:09,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:52:09,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:52:09,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:09,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:09,252 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:09,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:09,301 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-03-17 19:52:09,303 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-03-17 19:52:09,350 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 31 states and 44 transitions. Complement of second has 5 states. [2025-03-17 19:52:09,353 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-03-17 19:52:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-03-17 19:52:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-03-17 19:52:09,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-17 19:52:09,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:09,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-17 19:52:09,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:09,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 4 letters. [2025-03-17 19:52:09,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:09,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2025-03-17 19:52:09,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-17 19:52:09,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 33 transitions. [2025-03-17 19:52:09,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-03-17 19:52:09,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-17 19:52:09,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2025-03-17 19:52:09,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:09,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 33 transitions. [2025-03-17 19:52:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2025-03-17 19:52:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-17 19:52:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) 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-03-17 19:52:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2025-03-17 19:52:09,396 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-03-17 19:52:09,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:09,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:52:09,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:52:09,399 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-03-17 19:52:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:09,433 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2025-03-17 19:52:09,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2025-03-17 19:52:09,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-17 19:52:09,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 28 transitions. [2025-03-17 19:52:09,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-03-17 19:52:09,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-03-17 19:52:09,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2025-03-17 19:52:09,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:52:09,437 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2025-03-17 19:52:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2025-03-17 19:52:09,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-17 19:52:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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-03-17 19:52:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2025-03-17 19:52:09,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-03-17 19:52:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:52:09,441 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-03-17 19:52:09,441 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:52:09,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2025-03-17 19:52:09,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-17 19:52:09,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:09,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:09,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:52:09,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:09,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;" [2025-03-17 19:52:09,444 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;" >"#39#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-03-17 19:52:09,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:09,445 INFO L85 PathProgramCache]: Analyzing trace with hash 59544, now seen corresponding path program 2 times [2025-03-17 19:52:09,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:09,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097085919] [2025-03-17 19:52:09,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:09,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:09,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:09,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:09,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:09,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:09,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:09,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:09,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:09,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:09,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:09,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:09,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash 808122677, now seen corresponding path program 1 times [2025-03-17 19:52:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:09,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109431018] [2025-03-17 19:52:09,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:09,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:09,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:52:09,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:52:09,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:09,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:09,461 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:09,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:52:09,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:52:09,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:09,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:09,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:09,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash -704591234, now seen corresponding path program 1 times [2025-03-17 19:52:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:09,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768576108] [2025-03-17 19:52:09,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:09,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:09,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:52:09,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:09,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:09,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:09,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:09,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:52:09,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:09,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:09,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:09,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:09,583 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:09,583 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:09,583 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:09,583 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:09,583 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:09,583 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:09,583 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:09,583 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:09,583 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2025-03-17 19:52:09,583 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:09,584 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:09,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,632 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:09,632 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:09,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:09,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:09,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:09,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:52:09,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:09,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:09,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:09,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:09,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:09,658 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:09,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:52:09,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:09,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:09,684 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:09,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 19:52:09,688 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:09,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:09,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:09,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:09,688 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:09,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:09,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:09,688 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:09,688 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2025-03-17 19:52:09,688 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:09,688 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:09,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:09,728 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:09,728 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:09,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:09,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:09,730 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:09,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:52:09,733 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-03-17 19:52:09,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:09,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:09,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:09,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:09,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:09,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:09,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:09,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:09,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:09,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:09,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:09,753 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:09,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:52:09,756 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-03-17 19:52:09,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:09,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:09,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:09,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:09,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:09,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:09,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:09,768 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:09,770 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:09,771 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:09,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:09,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:09,778 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:09,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:52:09,781 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:09,781 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:09,781 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:09,781 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-03-17 19:52:09,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 19:52:09,788 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:09,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:09,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:52:09,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:52:09,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:09,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:09,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:09,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:09,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:52:09,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:52:09,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:09,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:09,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:09,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:09,904 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-03-17 19:52:09,904 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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-03-17 19:52:10,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-17 19:52:10,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:10,115 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 150 states and 239 transitions. Complement of second has 34 states. [2025-03-17 19:52:10,116 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-03-17 19:52:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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-03-17 19:52:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2025-03-17 19:52:10,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 3 letters. Loop has 9 letters. [2025-03-17 19:52:10,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:10,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 12 letters. Loop has 9 letters. [2025-03-17 19:52:10,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:10,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 3 letters. Loop has 18 letters. [2025-03-17 19:52:10,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:10,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 239 transitions. [2025-03-17 19:52:10,127 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-17 19:52:10,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 239 transitions. [2025-03-17 19:52:10,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2025-03-17 19:52:10,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-03-17 19:52:10,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 239 transitions. [2025-03-17 19:52:10,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:10,131 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 239 transitions. [2025-03-17 19:52:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 239 transitions. [2025-03-17 19:52:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 125. [2025-03-17 19:52:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 80 states have internal predecessors, (114), 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-03-17 19:52:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 190 transitions. [2025-03-17 19:52:10,144 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 190 transitions. [2025-03-17 19:52:10,144 INFO L432 stractBuchiCegarLoop]: Abstraction has 125 states and 190 transitions. [2025-03-17 19:52:10,144 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:52:10,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 190 transitions. [2025-03-17 19:52:10,145 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-03-17 19:52:10,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:10,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:10,147 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:52:10,148 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:10,148 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-03-17 19:52:10,148 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;" >"#39#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-03-17 19:52:10,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1845883, now seen corresponding path program 1 times [2025-03-17 19:52:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:10,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224004214] [2025-03-17 19:52:10,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:10,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:10,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:10,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:10,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:10,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:10,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:10,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:10,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:10,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:10,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:10,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:10,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1314015820, now seen corresponding path program 1 times [2025-03-17 19:52:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457874821] [2025-03-17 19:52:10,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:10,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:10,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:10,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:10,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:10,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:10,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457874821] [2025-03-17 19:52:10,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457874821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:10,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:10,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:52:10,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274408592] [2025-03-17 19:52:10,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:10,295 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:10,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:52:10,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:52:10,296 INFO L87 Difference]: Start difference. First operand 125 states and 190 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-03-17 19:52:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:10,483 INFO L93 Difference]: Finished difference Result 228 states and 435 transitions. [2025-03-17 19:52:10,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 228 states and 435 transitions. [2025-03-17 19:52:10,491 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2025-03-17 19:52:10,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 228 states to 225 states and 432 transitions. [2025-03-17 19:52:10,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2025-03-17 19:52:10,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-03-17 19:52:10,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 432 transitions. [2025-03-17 19:52:10,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:10,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 225 states and 432 transitions. [2025-03-17 19:52:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 432 transitions. [2025-03-17 19:52:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 166. [2025-03-17 19:52:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 109 states have (on average 1.2660550458715596) internal successors, (138), 101 states have internal predecessors, (138), 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-03-17 19:52:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 279 transitions. [2025-03-17 19:52:10,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 166 states and 279 transitions. [2025-03-17 19:52:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:52:10,522 INFO L432 stractBuchiCegarLoop]: Abstraction has 166 states and 279 transitions. [2025-03-17 19:52:10,522 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:52:10,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 279 transitions. [2025-03-17 19:52:10,524 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2025-03-17 19:52:10,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:10,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:10,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:52:10,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:10,525 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-03-17 19:52:10,525 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;" >"#39#return;" "main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2025-03-17 19:52:10,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1845883, now seen corresponding path program 2 times [2025-03-17 19:52:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379747083] [2025-03-17 19:52:10,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:10,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:10,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:10,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:10,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:10,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:10,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:10,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:10,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:10,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:10,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:10,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash -812039576, now seen corresponding path program 1 times [2025-03-17 19:52:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280848904] [2025-03-17 19:52:10,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:10,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:52:10,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:52:10,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:10,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:10,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:10,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:52:10,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:52:10,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:10,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:10,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:10,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:10,538 INFO L85 PathProgramCache]: Analyzing trace with hash -695708958, now seen corresponding path program 1 times [2025-03-17 19:52:10,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:10,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735011162] [2025-03-17 19:52:10,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:10,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:10,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:52:10,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:52:10,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:10,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:10,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:10,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735011162] [2025-03-17 19:52:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735011162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:10,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:52:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287252063] [2025-03-17 19:52:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:10,642 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:10,642 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:10,643 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:10,643 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:10,643 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:10,643 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:10,643 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:10,643 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:10,643 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration4_Loop [2025-03-17 19:52:10,643 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:10,643 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:10,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:10,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:10,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:10,676 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:10,676 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:10,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:10,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:10,679 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:10,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:52:10,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:10,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:10,700 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:10,700 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-03-17 19:52:10,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:10,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:10,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:10,709 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:10,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:52:10,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:10,712 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:10,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-17 19:52:10,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:10,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:10,731 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:10,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:52:10,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:10,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:10,756 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:10,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:10,760 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:10,760 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:10,760 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:10,760 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:10,760 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:10,760 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:10,760 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:10,760 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:10,760 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration4_Loop [2025-03-17 19:52:10,760 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:10,760 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:10,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:10,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:10,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:10,787 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:10,787 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:10,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:10,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:10,809 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:10,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 19:52:10,812 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-03-17 19:52:10,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:10,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:10,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:10,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:10,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:10,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:10,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:10,825 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:10,827 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:10,827 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:10,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:10,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:10,829 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:10,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:52:10,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:10,832 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:10,832 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:10,832 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-03-17 19:52:10,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:10,838 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:10,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:10,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:52:10,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:52:10,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:10,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:10,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:52:10,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:10,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:52:10,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:52:10,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:10,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:10,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:10,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:10,919 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-03-17 19:52:10,920 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 166 states and 279 transitions. cyclomatic complexity: 118 Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-03-17 19:52:11,068 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 166 states and 279 transitions. cyclomatic complexity: 118. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 957 states and 1805 transitions. Complement of second has 39 states. [2025-03-17 19:52:11,069 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-03-17 19:52:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-03-17 19:52:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2025-03-17 19:52:11,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 8 letters. [2025-03-17 19:52:11,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:11,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 12 letters. Loop has 8 letters. [2025-03-17 19:52:11,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:11,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 16 letters. [2025-03-17 19:52:11,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:11,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 957 states and 1805 transitions. [2025-03-17 19:52:11,081 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 47 [2025-03-17 19:52:11,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 957 states to 837 states and 1551 transitions. [2025-03-17 19:52:11,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2025-03-17 19:52:11,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2025-03-17 19:52:11,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 837 states and 1551 transitions. [2025-03-17 19:52:11,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:11,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 837 states and 1551 transitions. [2025-03-17 19:52:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states and 1551 transitions. [2025-03-17 19:52:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 674. [2025-03-17 19:52:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 432 states have (on average 1.2685185185185186) internal successors, (548), 405 states have internal predecessors, (548), 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-03-17 19:52:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1131 transitions. [2025-03-17 19:52:11,163 INFO L240 hiAutomatonCegarLoop]: Abstraction has 674 states and 1131 transitions. [2025-03-17 19:52:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:11,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:52:11,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:52:11,163 INFO L87 Difference]: Start difference. First operand 674 states and 1131 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-03-17 19:52:11,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 19:52:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:11,218 INFO L93 Difference]: Finished difference Result 735 states and 1283 transitions. [2025-03-17 19:52:11,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 735 states and 1283 transitions. [2025-03-17 19:52:11,225 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 44 [2025-03-17 19:52:11,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 735 states to 310 states and 533 transitions. [2025-03-17 19:52:11,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2025-03-17 19:52:11,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2025-03-17 19:52:11,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 310 states and 533 transitions. [2025-03-17 19:52:11,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:11,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 310 states and 533 transitions. [2025-03-17 19:52:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states and 533 transitions. [2025-03-17 19:52:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 254. [2025-03-17 19:52:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 162 states have (on average 1.2777777777777777) internal successors, (207), 158 states have internal predecessors, (207), 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-03-17 19:52:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 404 transitions. [2025-03-17 19:52:11,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 254 states and 404 transitions. [2025-03-17 19:52:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:52:11,245 INFO L432 stractBuchiCegarLoop]: Abstraction has 254 states and 404 transitions. [2025-03-17 19:52:11,246 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:52:11,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 404 transitions. [2025-03-17 19:52:11,247 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 44 [2025-03-17 19:52:11,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:11,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:11,248 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:11,248 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:11,248 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;" >"#39#return;" [2025-03-17 19:52:11,248 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;" >"#39#return;" [2025-03-17 19:52:11,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash -867771329, now seen corresponding path program 1 times [2025-03-17 19:52:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:11,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834443455] [2025-03-17 19:52:11,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:11,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:11,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:11,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:11,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:11,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:11,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:11,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:11,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:11,258 INFO L85 PathProgramCache]: Analyzing trace with hash -686253325, now seen corresponding path program 1 times [2025-03-17 19:52:11,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:11,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974565954] [2025-03-17 19:52:11,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:11,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:11,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:52:11,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:52:11,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:11,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:52:11,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:52:11,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:11,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2066423029, now seen corresponding path program 1 times [2025-03-17 19:52:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908002132] [2025-03-17 19:52:11,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:11,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:52:11,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:52:11,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:11,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 19:52:11,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 19:52:11,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:11,323 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:11,324 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:11,324 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:11,324 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:11,324 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:11,324 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,324 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:11,324 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:11,324 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2025-03-17 19:52:11,324 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:11,324 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:11,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,344 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:11,344 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:11,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,345 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:52:11,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:11,347 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:11,357 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:11,357 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-03-17 19:52:11,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 19:52:11,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,364 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 19:52:11,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:11,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:11,383 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:11,383 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-03-17 19:52:11,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 19:52:11,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,391 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:52:11,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:11,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:11,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:11,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,414 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 19:52:11,418 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:11,418 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:11,509 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:11,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-17 19:52:11,514 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:11,514 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:11,514 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:11,514 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:11,514 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:11,514 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,514 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:11,514 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:11,514 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2025-03-17 19:52:11,514 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:11,514 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:11,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,542 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:11,542 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:11,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,544 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 19:52:11,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:52:11,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:11,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:11,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:11,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:11,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:11,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:11,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:11,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:11,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:52:11,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,567 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 19:52:11,570 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-03-17 19:52:11,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:11,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:11,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:11,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:11,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:11,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:11,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:11,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:11,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:11,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,590 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 19:52:11,592 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-03-17 19:52:11,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:11,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:11,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:11,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:11,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:11,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:11,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:11,605 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:11,608 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 19:52:11,608 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:11,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,609 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:52:11,611 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:11,611 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:11,611 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:11,611 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-03-17 19:52:11,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 19:52:11,617 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:11,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:11,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:11,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:11,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:11,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:52:11,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:11,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:52:11,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:52:11,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:11,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:11,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:11,739 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-03-17 19:52:11,739 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 254 states and 404 transitions. cyclomatic complexity: 158 Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-03-17 19:52:11,809 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 254 states and 404 transitions. cyclomatic complexity: 158. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 386 states and 596 transitions. Complement of second has 13 states. [2025-03-17 19:52:11,809 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-03-17 19:52:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-03-17 19:52:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2025-03-17 19:52:11,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 10 letters. Loop has 7 letters. [2025-03-17 19:52:11,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:11,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 17 letters. Loop has 7 letters. [2025-03-17 19:52:11,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:11,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 10 letters. Loop has 14 letters. [2025-03-17 19:52:11,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:11,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 596 transitions. [2025-03-17 19:52:11,815 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2025-03-17 19:52:11,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 314 states and 489 transitions. [2025-03-17 19:52:11,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 200 [2025-03-17 19:52:11,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2025-03-17 19:52:11,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 489 transitions. [2025-03-17 19:52:11,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:11,819 INFO L218 hiAutomatonCegarLoop]: Abstraction has 314 states and 489 transitions. [2025-03-17 19:52:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 489 transitions. [2025-03-17 19:52:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2025-03-17 19:52:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 199 states have (on average 1.2663316582914572) internal successors, (252), 194 states have internal predecessors, (252), 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-03-17 19:52:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 488 transitions. [2025-03-17 19:52:11,829 INFO L240 hiAutomatonCegarLoop]: Abstraction has 313 states and 488 transitions. [2025-03-17 19:52:11,829 INFO L432 stractBuchiCegarLoop]: Abstraction has 313 states and 488 transitions. [2025-03-17 19:52:11,829 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:52:11,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 488 transitions. [2025-03-17 19:52:11,831 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2025-03-17 19:52:11,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:11,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:11,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:11,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:52:11,831 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-03-17 19:52:11,832 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-03-17 19:52:11,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1130813356, now seen corresponding path program 1 times [2025-03-17 19:52:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:11,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23592812] [2025-03-17 19:52:11,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:11,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:52:11,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:52:11,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:11,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23592812] [2025-03-17 19:52:11,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23592812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:11,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:11,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:52:11,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306745372] [2025-03-17 19:52:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:11,872 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:11,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash 39094690, now seen corresponding path program 1 times [2025-03-17 19:52:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971458931] [2025-03-17 19:52:11,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:11,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:11,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:11,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:11,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:11,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:11,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:11,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:11,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:11,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:11,917 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:11,917 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:11,917 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:11,917 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:11,917 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:11,917 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,917 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:11,917 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:11,917 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2025-03-17 19:52:11,917 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:11,917 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:11,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:11,967 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:11,967 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:11,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,970 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:52:11,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:11,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:11,983 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:11,983 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:11,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:11,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:11,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:11,990 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:11,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 19:52:11,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:11,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:12,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:12,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,020 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:12,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 19:52:12,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:12,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:12,170 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:12,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 19:52:12,177 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:12,177 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:12,177 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:12,177 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:12,177 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:12,177 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,177 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:12,177 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:12,177 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2025-03-17 19:52:12,177 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:12,177 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:12,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:12,213 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:12,213 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:12,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,215 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:12,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 19:52:12,217 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-03-17 19:52:12,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:12,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:12,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:12,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:12,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:12,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:12,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:12,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:12,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 19:52:12,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,235 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:12,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 19:52:12,237 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-03-17 19:52:12,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:12,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:12,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:12,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:12,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:12,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:12,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:12,252 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:12,254 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:12,255 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:12,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:12,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,256 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:12,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 19:52:12,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:12,259 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:12,259 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:12,259 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-03-17 19:52:12,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 19:52:12,266 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:12,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:12,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:52:12,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:52:12,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:12,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:12,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:12,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:12,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:12,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:12,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:12,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:12,347 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-03-17 19:52:12,347 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 313 states and 488 transitions. cyclomatic complexity: 184 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-03-17 19:52:12,434 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 313 states and 488 transitions. cyclomatic complexity: 184. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 1006 states and 2043 transitions. Complement of second has 45 states. [2025-03-17 19:52:12,435 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-03-17 19:52:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-03-17 19:52:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2025-03-17 19:52:12,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 11 letters. Loop has 5 letters. [2025-03-17 19:52:12,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:12,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 16 letters. Loop has 5 letters. [2025-03-17 19:52:12,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:12,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 11 letters. Loop has 10 letters. [2025-03-17 19:52:12,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:12,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1006 states and 2043 transitions. [2025-03-17 19:52:12,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 19:52:12,467 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 165 [2025-03-17 19:52:12,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-17 19:52:12,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1006 states to 911 states and 1869 transitions. [2025-03-17 19:52:12,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 492 [2025-03-17 19:52:12,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 500 [2025-03-17 19:52:12,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 911 states and 1869 transitions. [2025-03-17 19:52:12,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:12,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 911 states and 1869 transitions. [2025-03-17 19:52:12,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states and 1869 transitions. [2025-03-17 19:52:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 809. [2025-03-17 19:52:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 493 states have (on average 1.3225152129817443) internal successors, (652), 538 states have internal predecessors, (652), 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-03-17 19:52:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1540 transitions. [2025-03-17 19:52:12,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 809 states and 1540 transitions. [2025-03-17 19:52:12,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:12,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:52:12,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:52:12,510 INFO L87 Difference]: Start difference. First operand 809 states and 1540 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-03-17 19:52:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:12,537 INFO L93 Difference]: Finished difference Result 715 states and 1338 transitions. [2025-03-17 19:52:12,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 715 states and 1338 transitions. [2025-03-17 19:52:12,544 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 104 [2025-03-17 19:52:12,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 715 states to 714 states and 1337 transitions. [2025-03-17 19:52:12,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2025-03-17 19:52:12,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2025-03-17 19:52:12,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 714 states and 1337 transitions. [2025-03-17 19:52:12,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:12,554 INFO L218 hiAutomatonCegarLoop]: Abstraction has 714 states and 1337 transitions. [2025-03-17 19:52:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states and 1337 transitions. [2025-03-17 19:52:12,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 706. [2025-03-17 19:52:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 439 states have (on average 1.3006833712984054) internal successors, (571), 479 states have internal predecessors, (571), 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-03-17 19:52:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1329 transitions. [2025-03-17 19:52:12,582 INFO L240 hiAutomatonCegarLoop]: Abstraction has 706 states and 1329 transitions. [2025-03-17 19:52:12,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:52:12,583 INFO L432 stractBuchiCegarLoop]: Abstraction has 706 states and 1329 transitions. [2025-03-17 19:52:12,583 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:52:12,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 706 states and 1329 transitions. [2025-03-17 19:52:12,587 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 102 [2025-03-17 19:52:12,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:12,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:12,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:12,588 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-03-17 19:52:12,588 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;" >"#39#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-03-17 19:52:12,588 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:12,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash -367491755, now seen corresponding path program 2 times [2025-03-17 19:52:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:12,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361498667] [2025-03-17 19:52:12,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:12,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:52:12,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:52:12,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:12,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:12,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361498667] [2025-03-17 19:52:12,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361498667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704523528] [2025-03-17 19:52:12,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:12,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:12,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,635 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:12,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-17 19:52:12,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:52:12,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:52:12,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:12,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:12,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:12,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:12,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:12,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704523528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:12,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:12,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 19:52:12,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463001584] [2025-03-17 19:52:12,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:12,732 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:12,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1713945860, now seen corresponding path program 1 times [2025-03-17 19:52:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:12,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856886792] [2025-03-17 19:52:12,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:12,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:52:12,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:52:12,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:52:12,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:12,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856886792] [2025-03-17 19:52:12,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856886792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:12,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309792557] [2025-03-17 19:52:12,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:12,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:12,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:12,861 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:12,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-17 19:52:12,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 19:52:12,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:52:12,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:12,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:12,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:52:12,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:52:12,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:52:13,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309792557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:13,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:13,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-17 19:52:13,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993995064] [2025-03-17 19:52:13,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:13,081 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:13,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:13,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 19:52:13,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:52:13,082 INFO L87 Difference]: Start difference. First operand 706 states and 1329 transitions. cyclomatic complexity: 643 Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-03-17 19:52:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:13,116 INFO L93 Difference]: Finished difference Result 754 states and 1412 transitions. [2025-03-17 19:52:13,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1412 transitions. [2025-03-17 19:52:13,122 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 112 [2025-03-17 19:52:13,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 751 states and 1408 transitions. [2025-03-17 19:52:13,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 387 [2025-03-17 19:52:13,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2025-03-17 19:52:13,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 751 states and 1408 transitions. [2025-03-17 19:52:13,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:13,153 INFO L218 hiAutomatonCegarLoop]: Abstraction has 751 states and 1408 transitions. [2025-03-17 19:52:13,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states and 1408 transitions. [2025-03-17 19:52:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 705. [2025-03-17 19:52:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 438 states have (on average 1.2990867579908676) internal successors, (569), 479 states have internal predecessors, (569), 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-03-17 19:52:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1327 transitions. [2025-03-17 19:52:13,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 705 states and 1327 transitions. [2025-03-17 19:52:13,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:52:13,177 INFO L432 stractBuchiCegarLoop]: Abstraction has 705 states and 1327 transitions. [2025-03-17 19:52:13,177 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:52:13,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 705 states and 1327 transitions. [2025-03-17 19:52:13,181 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 102 [2025-03-17 19:52:13,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:13,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:13,182 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 19:52:13,182 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-03-17 19:52:13,182 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;" >"#39#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;" >"#39#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-03-17 19:52:13,182 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:13,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1042219231, now seen corresponding path program 3 times [2025-03-17 19:52:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:13,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206943803] [2025-03-17 19:52:13,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:13,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-03-17 19:52:13,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:52:13,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:52:13,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:13,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:13,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:52:13,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:52:13,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:13,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:13,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:13,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1713945860, now seen corresponding path program 2 times [2025-03-17 19:52:13,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:13,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695857799] [2025-03-17 19:52:13,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:13,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:13,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 19:52:13,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:52:13,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:13,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:52:13,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:13,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695857799] [2025-03-17 19:52:13,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695857799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:13,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268467459] [2025-03-17 19:52:13,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:13,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:13,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:13,300 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:13,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-17 19:52:13,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 19:52:13,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 19:52:13,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:13,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:13,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:52:13,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:52:13,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 19:52:13,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268467459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:13,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:13,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-17 19:52:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667784474] [2025-03-17 19:52:13,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:13,539 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:13,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:52:13,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:52:13,539 INFO L87 Difference]: Start difference. First operand 705 states and 1327 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-03-17 19:52:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:13,798 INFO L93 Difference]: Finished difference Result 1106 states and 2857 transitions. [2025-03-17 19:52:13,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1106 states and 2857 transitions. [2025-03-17 19:52:13,812 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 181 [2025-03-17 19:52:13,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1106 states to 1089 states and 2808 transitions. [2025-03-17 19:52:13,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 601 [2025-03-17 19:52:13,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 601 [2025-03-17 19:52:13,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1089 states and 2808 transitions. [2025-03-17 19:52:13,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:13,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1089 states and 2808 transitions. [2025-03-17 19:52:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states and 2808 transitions. [2025-03-17 19:52:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 748. [2025-03-17 19:52:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 460 states have (on average 1.2826086956521738) internal successors, (590), 521 states have internal predecessors, (590), 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-03-17 19:52:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1564 transitions. [2025-03-17 19:52:13,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 748 states and 1564 transitions. [2025-03-17 19:52:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 19:52:13,906 INFO L432 stractBuchiCegarLoop]: Abstraction has 748 states and 1564 transitions. [2025-03-17 19:52:13,906 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:52:13,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 748 states and 1564 transitions. [2025-03-17 19:52:13,910 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 109 [2025-03-17 19:52:13,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:13,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:13,911 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 19:52:13,911 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-03-17 19:52:13,911 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;" >"#39#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;" >"#39#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-03-17 19:52:13,912 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:13,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1042219231, now seen corresponding path program 4 times [2025-03-17 19:52:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:13,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823813653] [2025-03-17 19:52:13,913 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:13,916 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-17 19:52:13,920 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:52:13,920 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:13,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:13,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:13,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:52:13,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:52:13,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:13,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:13,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:13,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:13,929 INFO L85 PathProgramCache]: Analyzing trace with hash -313807540, now seen corresponding path program 3 times [2025-03-17 19:52:13,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:13,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417280160] [2025-03-17 19:52:13,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:13,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-17 19:52:13,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 52 statements. [2025-03-17 19:52:13,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:52:13,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 19:52:14,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:14,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417280160] [2025-03-17 19:52:14,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417280160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:14,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445874237] [2025-03-17 19:52:14,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:14,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:14,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:14,039 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:14,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-17 19:52:14,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-17 19:52:14,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 52 statements. [2025-03-17 19:52:14,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:52:14,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:14,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:52:14,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-17 19:52:14,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 19:52:14,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445874237] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:14,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:14,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2025-03-17 19:52:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165361635] [2025-03-17 19:52:14,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:14,429 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:14,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:14,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 19:52:14,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-17 19:52:14,430 INFO L87 Difference]: Start difference. First operand 748 states and 1564 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-03-17 19:52:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:14,867 INFO L93 Difference]: Finished difference Result 1354 states and 2922 transitions. [2025-03-17 19:52:14,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1354 states and 2922 transitions. [2025-03-17 19:52:14,879 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 160 [2025-03-17 19:52:14,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1354 states to 1278 states and 2784 transitions. [2025-03-17 19:52:14,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2025-03-17 19:52:14,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2025-03-17 19:52:14,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1278 states and 2784 transitions. [2025-03-17 19:52:14,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:14,896 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1278 states and 2784 transitions. [2025-03-17 19:52:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states and 2784 transitions. [2025-03-17 19:52:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 995. [2025-03-17 19:52:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 629 states have (on average 1.2098569157392687) internal successors, (761), 692 states have internal predecessors, (761), 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-03-17 19:52:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2111 transitions. [2025-03-17 19:52:14,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 995 states and 2111 transitions. [2025-03-17 19:52:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 19:52:14,933 INFO L432 stractBuchiCegarLoop]: Abstraction has 995 states and 2111 transitions. [2025-03-17 19:52:14,933 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 19:52:14,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 995 states and 2111 transitions. [2025-03-17 19:52:14,938 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 110 [2025-03-17 19:52:14,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:14,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:14,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:14,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:52:14,939 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;" >"#39#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-03-17 19:52:14,939 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-03-17 19:52:14,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash 725155208, now seen corresponding path program 1 times [2025-03-17 19:52:14,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:14,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690523235] [2025-03-17 19:52:14,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:14,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:14,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:52:14,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:52:14,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:14,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:52:14,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:14,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690523235] [2025-03-17 19:52:14,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690523235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:14,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:14,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:52:14,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264591668] [2025-03-17 19:52:14,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:14,967 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:14,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash 39094725, now seen corresponding path program 1 times [2025-03-17 19:52:14,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:14,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525074135] [2025-03-17 19:52:14,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:14,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:14,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:14,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:14,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:14,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:14,969 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:14,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:14,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:14,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:14,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:14,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:15,017 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:15,018 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:15,018 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:15,018 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:15,018 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:15,018 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,018 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:15,018 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:15,018 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration10_Loop [2025-03-17 19:52:15,018 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:15,018 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:15,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,063 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:15,063 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:15,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,065 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 19:52:15,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:15,068 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:15,080 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:15,080 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-03-17 19:52:15,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:15,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,088 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 19:52:15,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:15,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:15,101 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:15,102 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-03-17 19:52:15,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:15,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,111 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 19:52:15,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:15,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:15,124 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:15,124 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:15,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:15,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,133 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-17 19:52:15,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:15,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:15,146 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:15,147 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:15,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:15,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,155 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-17 19:52:15,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:15,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:15,168 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:15,169 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-03-17 19:52:15,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-17 19:52:15,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,180 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-17 19:52:15,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:15,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:15,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:15,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,202 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-17 19:52:15,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:15,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:15,246 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:15,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:15,251 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:15,251 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:15,251 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:15,251 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:15,251 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:15,251 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,251 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:15,251 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:15,251 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration10_Loop [2025-03-17 19:52:15,251 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:15,251 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:15,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,290 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:15,291 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:15,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,293 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-17 19:52:15,295 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-03-17 19:52:15,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:15,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:15,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:15,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:15,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:15,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:15,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:15,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:15,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:15,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,317 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-17 19:52:15,320 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-03-17 19:52:15,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:15,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:15,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:15,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:15,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:15,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:15,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:15,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:15,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:15,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,338 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-17 19:52:15,340 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-03-17 19:52:15,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:15,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:15,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:15,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:15,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:15,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:15,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:15,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:15,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-17 19:52:15,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,359 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 19:52:15,361 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-03-17 19:52:15,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:15,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:15,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:15,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:15,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:15,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:15,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:15,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:15,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-17 19:52:15,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,379 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 19:52:15,381 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-03-17 19:52:15,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:15,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:15,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:15,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:15,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:15,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:15,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:15,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:15,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-17 19:52:15,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,401 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-17 19:52:15,402 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-03-17 19:52:15,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:15,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:15,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:15,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:15,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:15,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:15,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:15,415 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:15,416 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 19:52:15,416 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:15,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,418 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:15,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-17 19:52:15,421 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:15,421 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:15,421 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:15,421 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2025-03-17 19:52:15,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-17 19:52:15,463 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:15,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:15,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:52:15,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:52:15,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:15,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:15,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:52:15,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:15,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:15,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:15,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:15,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:15,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:15,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:15,619 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-03-17 19:52:15,619 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 995 states and 2111 transitions. cyclomatic complexity: 1136 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-03-17 19:52:15,730 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 995 states and 2111 transitions. cyclomatic complexity: 1136. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 1888 states and 3789 transitions. Complement of second has 34 states. [2025-03-17 19:52:15,731 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-03-17 19:52:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-03-17 19:52:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2025-03-17 19:52:15,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 23 letters. Loop has 5 letters. [2025-03-17 19:52:15,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:15,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 28 letters. Loop has 5 letters. [2025-03-17 19:52:15,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:15,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 23 letters. Loop has 10 letters. [2025-03-17 19:52:15,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:15,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1888 states and 3789 transitions. [2025-03-17 19:52:15,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-17 19:52:15,747 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 122 [2025-03-17 19:52:15,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1888 states to 1646 states and 3416 transitions. [2025-03-17 19:52:15,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 717 [2025-03-17 19:52:15,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 743 [2025-03-17 19:52:15,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1646 states and 3416 transitions. [2025-03-17 19:52:15,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:15,767 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1646 states and 3416 transitions. [2025-03-17 19:52:15,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states and 3416 transitions. [2025-03-17 19:52:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1562. [2025-03-17 19:52:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1024 states have (on average 1.2451171875) internal successors, (1275), 1175 states have internal predecessors, (1275), 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-03-17 19:52:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 3198 transitions. [2025-03-17 19:52:15,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1562 states and 3198 transitions. [2025-03-17 19:52:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:15,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:52:15,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:52:15,806 INFO L87 Difference]: Start difference. First operand 1562 states and 3198 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-03-17 19:52:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:15,833 INFO L93 Difference]: Finished difference Result 1286 states and 2711 transitions. [2025-03-17 19:52:15,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1286 states and 2711 transitions. [2025-03-17 19:52:15,842 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 78 [2025-03-17 19:52:15,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1286 states to 1270 states and 2694 transitions. [2025-03-17 19:52:15,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 517 [2025-03-17 19:52:15,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 517 [2025-03-17 19:52:15,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1270 states and 2694 transitions. [2025-03-17 19:52:15,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:15,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1270 states and 2694 transitions. [2025-03-17 19:52:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states and 2694 transitions. [2025-03-17 19:52:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1270. [2025-03-17 19:52:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 831 states have (on average 1.2527075812274369) internal successors, (1041), 956 states have internal predecessors, (1041), 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-03-17 19:52:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2694 transitions. [2025-03-17 19:52:15,883 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1270 states and 2694 transitions. [2025-03-17 19:52:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:52:15,883 INFO L432 stractBuchiCegarLoop]: Abstraction has 1270 states and 2694 transitions. [2025-03-17 19:52:15,883 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 19:52:15,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1270 states and 2694 transitions. [2025-03-17 19:52:15,889 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 78 [2025-03-17 19:52:15,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:15,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:15,890 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2025-03-17 19:52:15,890 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:15,890 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;" >"#39#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;" >"#39#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;" >"#39#return;" [2025-03-17 19:52:15,890 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;" >"#39#return;" [2025-03-17 19:52:15,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:15,890 INFO L85 PathProgramCache]: Analyzing trace with hash 541087651, now seen corresponding path program 5 times [2025-03-17 19:52:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:15,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550428717] [2025-03-17 19:52:15,891 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:15,893 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-03-17 19:52:15,896 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:52:15,896 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 19:52:15,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:52:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550428717] [2025-03-17 19:52:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550428717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:15,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:52:15,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:52:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012722769] [2025-03-17 19:52:15,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:15,931 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:15,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash -686253325, now seen corresponding path program 2 times [2025-03-17 19:52:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994716388] [2025-03-17 19:52:15,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:15,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:52:15,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:52:15,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:15,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:15,934 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:15,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:52:15,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:52:15,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:15,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:15,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:15,975 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:15,975 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:15,975 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:15,975 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:15,975 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:15,976 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,976 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:15,976 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:15,976 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2025-03-17 19:52:15,976 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:15,976 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:15,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:15,996 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:15,996 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:15,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:15,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:15,999 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:16,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-17 19:52:16,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:16,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:16,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-03-17 19:52:16,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:16,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:16,019 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:16,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-17 19:52:16,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:16,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:16,108 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:16,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:16,112 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:16,112 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:16,113 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:16,113 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:16,113 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:16,113 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:16,113 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:16,113 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:16,113 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2025-03-17 19:52:16,113 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:16,113 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:16,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:16,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:16,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:16,137 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:16,137 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:16,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:16,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:16,142 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:16,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-17 19:52:16,143 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-03-17 19:52:16,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:16,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:16,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:16,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:16,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:16,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:16,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:16,156 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:16,159 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 19:52:16,159 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:16,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:16,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:16,161 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:16,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-17 19:52:16,171 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:16,171 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:16,171 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:16,172 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-03-17 19:52:16,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:16,178 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:16,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:16,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:52:16,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:52:16,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:16,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:16,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:16,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:16,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:52:16,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:52:16,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:16,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:16,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:16,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:16,311 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-03-17 19:52:16,312 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1270 states and 2694 transitions. cyclomatic complexity: 1453 Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-17 19:52:16,356 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1270 states and 2694 transitions. cyclomatic complexity: 1453. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 1283 states and 2708 transitions. Complement of second has 10 states. [2025-03-17 19:52:16,357 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-03-17 19:52:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-17 19:52:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-03-17 19:52:16,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 26 letters. Loop has 7 letters. [2025-03-17 19:52:16,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:16,359 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:16,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:16,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:52:16,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:52:16,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:16,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:16,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:16,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:16,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:52:16,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:52:16,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:16,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:16,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:16,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:16,490 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-03-17 19:52:16,490 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1270 states and 2694 transitions. cyclomatic complexity: 1453 Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-17 19:52:16,531 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1270 states and 2694 transitions. cyclomatic complexity: 1453. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 1281 states and 2705 transitions. Complement of second has 10 states. [2025-03-17 19:52:16,532 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-03-17 19:52:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-17 19:52:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2025-03-17 19:52:16,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 26 letters. Loop has 7 letters. [2025-03-17 19:52:16,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:16,532 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:16,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:16,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:52:16,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:52:16,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:16,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:16,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:16,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:16,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:52:16,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:52:16,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:16,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:16,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:16,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:16,669 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-03-17 19:52:16,670 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1270 states and 2694 transitions. cyclomatic complexity: 1453 Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-17 19:52:16,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1270 states and 2694 transitions. cyclomatic complexity: 1453. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 2444 states and 5284 transitions. Complement of second has 11 states. [2025-03-17 19:52:16,746 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-03-17 19:52:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-17 19:52:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2025-03-17 19:52:16,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 26 letters. Loop has 7 letters. [2025-03-17 19:52:16,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:16,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 33 letters. Loop has 7 letters. [2025-03-17 19:52:16,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:16,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 26 letters. Loop has 14 letters. [2025-03-17 19:52:16,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:16,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2444 states and 5284 transitions. [2025-03-17 19:52:16,768 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 57 [2025-03-17 19:52:16,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2444 states to 1999 states and 4029 transitions. [2025-03-17 19:52:16,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2025-03-17 19:52:16,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 382 [2025-03-17 19:52:16,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1999 states and 4029 transitions. [2025-03-17 19:52:16,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:16,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1999 states and 4029 transitions. [2025-03-17 19:52:16,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-17 19:52:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states and 4029 transitions. [2025-03-17 19:52:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1923. [2025-03-17 19:52:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1278 states have (on average 1.2370892018779343) internal successors, (1581), 1451 states have internal predecessors, (1581), 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-03-17 19:52:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 3878 transitions. [2025-03-17 19:52:16,874 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1923 states and 3878 transitions. [2025-03-17 19:52:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:16,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:52:16,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:52:16,875 INFO L87 Difference]: Start difference. First operand 1923 states and 3878 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-17 19:52:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:16,944 INFO L93 Difference]: Finished difference Result 1126 states and 2231 transitions. [2025-03-17 19:52:16,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1126 states and 2231 transitions. [2025-03-17 19:52:16,952 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-03-17 19:52:16,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1126 states to 619 states and 1243 transitions. [2025-03-17 19:52:16,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 236 [2025-03-17 19:52:16,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2025-03-17 19:52:16,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 619 states and 1243 transitions. [2025-03-17 19:52:16,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:16,960 INFO L218 hiAutomatonCegarLoop]: Abstraction has 619 states and 1243 transitions. [2025-03-17 19:52:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states and 1243 transitions. [2025-03-17 19:52:16,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 573. [2025-03-17 19:52:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 382 states have (on average 1.2172774869109948) internal successors, (465), 424 states have internal predecessors, (465), 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-03-17 19:52:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1149 transitions. [2025-03-17 19:52:16,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 573 states and 1149 transitions. [2025-03-17 19:52:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:52:16,977 INFO L432 stractBuchiCegarLoop]: Abstraction has 573 states and 1149 transitions. [2025-03-17 19:52:16,977 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 19:52:16,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 1149 transitions. [2025-03-17 19:52:16,979 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 55 [2025-03-17 19:52:16,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:16,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:16,980 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] [2025-03-17 19:52:16,980 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:16,980 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-03-17 19:52:16,980 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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-03-17 19:52:16,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:16,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1051672680, now seen corresponding path program 1 times [2025-03-17 19:52:16,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:16,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149723349] [2025-03-17 19:52:16,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:16,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 19:52:16,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 19:52:16,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:16,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:16,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:16,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 19:52:16,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 19:52:16,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:16,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:16,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:16,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1792998799, now seen corresponding path program 1 times [2025-03-17 19:52:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:17,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124057230] [2025-03-17 19:52:17,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:17,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:17,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:17,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:17,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:17,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:17,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:17,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:17,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:17,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:17,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:17,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:17,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1870801206, now seen corresponding path program 2 times [2025-03-17 19:52:17,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:17,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425354304] [2025-03-17 19:52:17,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:17,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:17,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-17 19:52:17,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:52:17,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:17,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 19:52:17,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:17,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425354304] [2025-03-17 19:52:17,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425354304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:17,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932994198] [2025-03-17 19:52:17,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:17,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:17,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,077 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-03-17 19:52:17,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-17 19:52:17,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:52:17,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:17,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:17,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:52:17,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 19:52:17,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 19:52:17,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932994198] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:17,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:17,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-03-17 19:52:17,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152202478] [2025-03-17 19:52:17,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:17,257 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:17,257 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:17,257 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:17,257 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:17,257 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:17,257 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,257 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:17,257 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:17,258 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2025-03-17 19:52:17,258 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:17,258 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:17,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,300 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:17,300 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:17,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,303 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-17 19:52:17,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:17,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:17,316 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:17,316 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-03-17 19:52:17,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-17 19:52:17,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,324 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-17 19:52:17,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:17,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:17,338 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:17,338 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:17,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:17,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,346 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-17 19:52:17,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:17,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:17,360 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:17,360 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:17,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:17,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,369 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-17 19:52:17,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:17,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:17,383 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:17,383 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-03-17 19:52:17,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:17,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,391 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-17 19:52:17,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:17,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:17,404 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:17,404 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-03-17 19:52:17,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-17 19:52:17,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,412 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-17 19:52:17,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:17,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:17,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-17 19:52:17,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,435 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-17 19:52:17,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:17,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:17,531 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:17,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-17 19:52:17,536 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:17,537 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:17,537 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:17,537 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:17,537 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:17,537 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,537 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:17,537 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:17,537 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2025-03-17 19:52:17,537 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:17,537 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:17,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:17,600 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:17,600 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:17,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,602 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-17 19:52:17,604 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-03-17 19:52:17,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:17,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:17,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:17,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:17,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:17,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:17,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:17,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:17,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:17,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,623 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-17 19:52:17,624 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-03-17 19:52:17,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:17,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:17,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:17,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:17,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:17,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:17,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:17,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:17,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-17 19:52:17,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,643 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-17 19:52:17,644 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-03-17 19:52:17,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:17,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:17,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:17,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:17,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:17,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:17,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:17,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:17,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-17 19:52:17,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,663 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-17 19:52:17,665 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-03-17 19:52:17,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:17,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:17,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:17,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:17,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:17,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:17,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:17,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:17,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:17,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,685 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-17 19:52:17,688 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-03-17 19:52:17,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:17,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:17,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:17,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:17,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:17,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:17,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:17,701 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:17,703 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:17,703 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:17,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:17,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:17,705 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:17,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-17 19:52:17,707 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:17,707 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:17,707 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:17,707 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-03-17 19:52:17,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:17,713 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:17,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:17,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 19:52:17,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-17 19:52:17,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 19:52:17,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:17,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:17,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:52:17,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:17,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:17,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:17,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:17,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:17,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:52:17,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:17,936 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-03-17 19:52:17,937 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 573 states and 1149 transitions. cyclomatic complexity: 595 Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-03-17 19:52:18,110 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 573 states and 1149 transitions. cyclomatic complexity: 595. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 2134 states and 4398 transitions. Complement of second has 41 states. [2025-03-17 19:52:18,110 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-03-17 19:52:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-03-17 19:52:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2025-03-17 19:52:18,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 67 transitions. Stem has 40 letters. Loop has 10 letters. [2025-03-17 19:52:18,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:18,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 67 transitions. Stem has 50 letters. Loop has 10 letters. [2025-03-17 19:52:18,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:18,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 67 transitions. Stem has 40 letters. Loop has 20 letters. [2025-03-17 19:52:18,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:18,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2134 states and 4398 transitions. [2025-03-17 19:52:18,126 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 100 [2025-03-17 19:52:18,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2134 states to 1598 states and 3529 transitions. [2025-03-17 19:52:18,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 440 [2025-03-17 19:52:18,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 487 [2025-03-17 19:52:18,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1598 states and 3529 transitions. [2025-03-17 19:52:18,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:18,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1598 states and 3529 transitions. [2025-03-17 19:52:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states and 3529 transitions. [2025-03-17 19:52:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1385. [2025-03-17 19:52:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 908 states have (on average 1.2533039647577093) internal successors, (1138), 1033 states have internal predecessors, (1138), 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-03-17 19:52:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2736 transitions. [2025-03-17 19:52:18,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1385 states and 2736 transitions. [2025-03-17 19:52:18,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:18,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:52:18,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:52:18,193 INFO L87 Difference]: Start difference. First operand 1385 states and 2736 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 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-03-17 19:52:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:18,269 INFO L93 Difference]: Finished difference Result 1693 states and 3158 transitions. [2025-03-17 19:52:18,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1693 states and 3158 transitions. [2025-03-17 19:52:18,278 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 109 [2025-03-17 19:52:18,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1693 states to 1593 states and 3024 transitions. [2025-03-17 19:52:18,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 459 [2025-03-17 19:52:18,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 459 [2025-03-17 19:52:18,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1593 states and 3024 transitions. [2025-03-17 19:52:18,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:18,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1593 states and 3024 transitions. [2025-03-17 19:52:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states and 3024 transitions. [2025-03-17 19:52:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1543. [2025-03-17 19:52:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1005 states have (on average 1.2497512437810945) internal successors, (1256), 1144 states have internal predecessors, (1256), 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-03-17 19:52:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2958 transitions. [2025-03-17 19:52:18,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1543 states and 2958 transitions. [2025-03-17 19:52:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:52:18,354 INFO L432 stractBuchiCegarLoop]: Abstraction has 1543 states and 2958 transitions. [2025-03-17 19:52:18,354 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 19:52:18,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1543 states and 2958 transitions. [2025-03-17 19:52:18,358 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 107 [2025-03-17 19:52:18,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:18,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:18,359 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] [2025-03-17 19:52:18,359 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:52:18,359 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" [2025-03-17 19:52:18,359 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-03-17 19:52:18,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash 765676659, now seen corresponding path program 1 times [2025-03-17 19:52:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:18,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425153619] [2025-03-17 19:52:18,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:18,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:18,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:52:18,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:52:18,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:18,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 19:52:18,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:18,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425153619] [2025-03-17 19:52:18,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425153619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:18,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603614788] [2025-03-17 19:52:18,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:18,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:18,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,405 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:18,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-03-17 19:52:18,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:52:18,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:52:18,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:18,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:18,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:52:18,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 19:52:18,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 19:52:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603614788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:18,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:18,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-03-17 19:52:18,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925030255] [2025-03-17 19:52:18,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:18,493 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:18,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash 37100685, now seen corresponding path program 2 times [2025-03-17 19:52:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:18,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965304431] [2025-03-17 19:52:18,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:18,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:18,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:18,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:52:18,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:18,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:18,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:18,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:18,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:18,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:18,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:18,565 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:18,565 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:18,565 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:18,565 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:18,566 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:18,566 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,566 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:18,566 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:18,566 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2025-03-17 19:52:18,566 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:18,566 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:18,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,614 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:18,614 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:18,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,616 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:18,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-17 19:52:18,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:18,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:18,632 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:18,632 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-03-17 19:52:18,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:18,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,641 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:18,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-17 19:52:18,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:18,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:18,654 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:18,654 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-03-17 19:52:18,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:18,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,662 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:18,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-17 19:52:18,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:18,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:18,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:18,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:18,693 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:18,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-17 19:52:18,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:18,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:18,971 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:18,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:18,980 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:18,980 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:18,980 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:18,980 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:18,980 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:18,980 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:18,980 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:18,980 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:18,980 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2025-03-17 19:52:18,980 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:18,980 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:18,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:18,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:19,029 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:19,029 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:19,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:19,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:19,032 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:19,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-17 19:52:19,034 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-03-17 19:52:19,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:19,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:19,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:19,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:19,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:19,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:19,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:19,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:19,050 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:19,051 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:19,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:19,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:19,052 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:19,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-17 19:52:19,055 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:19,055 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:19,055 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:19,055 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-03-17 19:52:19,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:19,061 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:19,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:19,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:52:19,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:52:19,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:19,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:19,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:52:19,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:19,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:19,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:19,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:19,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:19,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:52:19,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:19,255 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-03-17 19:52:19,255 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1543 states and 2958 transitions. cyclomatic complexity: 1460 Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-17 19:52:19,331 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1543 states and 2958 transitions. cyclomatic complexity: 1460. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 1634 states and 3064 transitions. Complement of second has 15 states. [2025-03-17 19:52:19,331 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-03-17 19:52:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-17 19:52:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2025-03-17 19:52:19,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 48 letters. Loop has 5 letters. [2025-03-17 19:52:19,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:19,332 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:19,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:19,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:52:19,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:52:19,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:19,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:19,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:52:19,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:19,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:19,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:19,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:19,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:19,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:52:19,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:19,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:19,545 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-03-17 19:52:19,545 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1543 states and 2958 transitions. cyclomatic complexity: 1460 Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-17 19:52:19,616 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1543 states and 2958 transitions. cyclomatic complexity: 1460. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 1634 states and 3064 transitions. Complement of second has 15 states. [2025-03-17 19:52:19,618 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-03-17 19:52:19,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-17 19:52:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2025-03-17 19:52:19,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 48 letters. Loop has 5 letters. [2025-03-17 19:52:19,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:19,619 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:19,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:19,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:52:19,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:52:19,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:19,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:19,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:52:19,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:19,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:19,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:19,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:19,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:19,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:52:19,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:19,809 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-03-17 19:52:19,809 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1543 states and 2958 transitions. cyclomatic complexity: 1460 Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-17 19:52:19,882 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1543 states and 2958 transitions. cyclomatic complexity: 1460. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 2294 states and 4135 transitions. Complement of second has 20 states. [2025-03-17 19:52:19,883 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-03-17 19:52:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03-17 19:52:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2025-03-17 19:52:19,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 48 letters. Loop has 5 letters. [2025-03-17 19:52:19,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:19,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 53 letters. Loop has 5 letters. [2025-03-17 19:52:19,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:19,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 48 letters. Loop has 10 letters. [2025-03-17 19:52:19,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:19,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2294 states and 4135 transitions. [2025-03-17 19:52:19,895 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 107 [2025-03-17 19:52:19,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2294 states to 1865 states and 3618 transitions. [2025-03-17 19:52:19,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 419 [2025-03-17 19:52:19,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 471 [2025-03-17 19:52:19,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1865 states and 3618 transitions. [2025-03-17 19:52:19,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:19,915 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1865 states and 3618 transitions. [2025-03-17 19:52:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states and 3618 transitions. [2025-03-17 19:52:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1730. [2025-03-17 19:52:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1109 states have (on average 1.272317403065825) internal successors, (1411), 1291 states have internal predecessors, (1411), 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-03-17 19:52:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 3159 transitions. [2025-03-17 19:52:19,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1730 states and 3159 transitions. [2025-03-17 19:52:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:19,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:52:19,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:52:19,959 INFO L87 Difference]: Start difference. First operand 1730 states and 3159 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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-03-17 19:52:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:20,031 INFO L93 Difference]: Finished difference Result 1729 states and 3131 transitions. [2025-03-17 19:52:20,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1729 states and 3131 transitions. [2025-03-17 19:52:20,040 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 101 [2025-03-17 19:52:20,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1729 states to 1705 states and 3105 transitions. [2025-03-17 19:52:20,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 440 [2025-03-17 19:52:20,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 440 [2025-03-17 19:52:20,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1705 states and 3105 transitions. [2025-03-17 19:52:20,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:20,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1705 states and 3105 transitions. [2025-03-17 19:52:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states and 3105 transitions. [2025-03-17 19:52:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1672. [2025-03-17 19:52:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1071 states have (on average 1.2717086834733893) internal successors, (1362), 1249 states have internal predecessors, (1362), 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-03-17 19:52:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 3063 transitions. [2025-03-17 19:52:20,118 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1672 states and 3063 transitions. [2025-03-17 19:52:20,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:52:20,119 INFO L432 stractBuchiCegarLoop]: Abstraction has 1672 states and 3063 transitions. [2025-03-17 19:52:20,119 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 19:52:20,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1672 states and 3063 transitions. [2025-03-17 19:52:20,123 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 99 [2025-03-17 19:52:20,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:20,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:20,124 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] [2025-03-17 19:52:20,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:52:20,124 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:20,124 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume !(~q <= 0);" "assume !(~q > ~p);" [2025-03-17 19:52:20,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1339865906, now seen corresponding path program 1 times [2025-03-17 19:52:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:20,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028604164] [2025-03-17 19:52:20,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:20,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:20,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 19:52:20,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 19:52:20,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:20,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-17 19:52:20,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:20,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028604164] [2025-03-17 19:52:20,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028604164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:20,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696304354] [2025-03-17 19:52:20,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:20,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:20,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:20,189 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:20,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-03-17 19:52:20,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 19:52:20,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 19:52:20,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:20,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:20,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:20,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-17 19:52:20,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-17 19:52:20,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696304354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:20,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:20,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-17 19:52:20,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400829970] [2025-03-17 19:52:20,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:20,317 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:20,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:20,317 INFO L85 PathProgramCache]: Analyzing trace with hash 62213505, now seen corresponding path program 3 times [2025-03-17 19:52:20,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:20,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439814200] [2025-03-17 19:52:20,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:20,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:20,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:20,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:20,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:52:20,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:20,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:20,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:20,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:20,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:20,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:20,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:20,378 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:20,378 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:20,378 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:20,378 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:20,378 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:20,378 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:20,378 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:20,378 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:20,378 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2025-03-17 19:52:20,378 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:20,378 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:20,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:20,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:20,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:20,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:20,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:20,428 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:20,428 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:20,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:20,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:20,463 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:20,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-17 19:52:20,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:20,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:20,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-17 19:52:20,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:20,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:20,518 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:20,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-17 19:52:20,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:20,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:20,839 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:20,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-17 19:52:20,849 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:20,849 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:20,849 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:20,849 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:20,849 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:20,849 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:20,849 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:20,849 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:20,849 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2025-03-17 19:52:20,849 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:20,849 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:20,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:20,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:20,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:20,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:20,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:20,891 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:20,891 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:20,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:20,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:20,893 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:20,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-17 19:52:20,894 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-03-17 19:52:20,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:20,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:20,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:20,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:20,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:20,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:20,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:20,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:20,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-17 19:52:20,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:20,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:20,914 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:20,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-17 19:52:20,915 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-03-17 19:52:20,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:20,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:20,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:20,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:20,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:20,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:20,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:20,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:20,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-17 19:52:20,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:20,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:20,933 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:20,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-17 19:52:20,935 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-03-17 19:52:20,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:20,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:20,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:20,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:20,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:20,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:20,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:20,949 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:20,951 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:20,952 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:20,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:20,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:20,954 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:20,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-17 19:52:20,955 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:20,955 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:20,955 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:20,955 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-03-17 19:52:20,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-17 19:52:20,962 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:20,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:20,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 19:52:21,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 19:52:21,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:21,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:21,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:52:21,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:21,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-17 19:52:21,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:21,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:21,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:21,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:21,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:52:21,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:21,253 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-03-17 19:52:21,253 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1672 states and 3063 transitions. cyclomatic complexity: 1432 Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:52:21,339 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1672 states and 3063 transitions. cyclomatic complexity: 1432. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1922 states and 3485 transitions. Complement of second has 28 states. [2025-03-17 19:52:21,340 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-03-17 19:52:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:52:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2025-03-17 19:52:21,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 60 letters. Loop has 5 letters. [2025-03-17 19:52:21,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:21,341 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:21,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:21,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 19:52:21,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 19:52:21,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:21,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:21,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:52:21,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:21,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:21,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:21,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:21,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:21,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:52:21,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:21,633 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-17 19:52:21,634 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1672 states and 3063 transitions. cyclomatic complexity: 1432 Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:52:21,734 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1672 states and 3063 transitions. cyclomatic complexity: 1432. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1845 states and 3313 transitions. Complement of second has 23 states. [2025-03-17 19:52:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:52:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2025-03-17 19:52:21,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 28 transitions. Stem has 60 letters. Loop has 5 letters. [2025-03-17 19:52:21,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:21,736 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:21,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:21,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 19:52:21,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 19:52:21,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:21,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:21,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:52:21,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:21,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:52:21,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:52:21,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:21,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:21,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:52:21,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:22,036 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-17 19:52:22,037 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1672 states and 3063 transitions. cyclomatic complexity: 1432 Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:52:22,120 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1672 states and 3063 transitions. cyclomatic complexity: 1432. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 3548 states and 6049 transitions. Complement of second has 40 states. [2025-03-17 19:52:22,121 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-03-17 19:52:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:52:22,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2025-03-17 19:52:22,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 60 letters. Loop has 5 letters. [2025-03-17 19:52:22,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:22,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 65 letters. Loop has 5 letters. [2025-03-17 19:52:22,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:22,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 60 letters. Loop has 10 letters. [2025-03-17 19:52:22,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:22,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3548 states and 6049 transitions. [2025-03-17 19:52:22,165 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 144 [2025-03-17 19:52:22,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3548 states to 2145 states and 4433 transitions. [2025-03-17 19:52:22,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 507 [2025-03-17 19:52:22,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 524 [2025-03-17 19:52:22,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2145 states and 4433 transitions. [2025-03-17 19:52:22,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:22,189 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2145 states and 4433 transitions. [2025-03-17 19:52:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states and 4433 transitions. [2025-03-17 19:52:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 1792. [2025-03-17 19:52:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1154 states have (on average 1.2634315424610052) internal successors, (1458), 1350 states have internal predecessors, (1458), 366 states have call successors, (372), 219 states have call predecessors, (372), 272 states have return successors, (1339), 222 states have call predecessors, (1339), 352 states have call successors, (1339) [2025-03-17 19:52:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 3169 transitions. [2025-03-17 19:52:22,243 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1792 states and 3169 transitions. [2025-03-17 19:52:22,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:22,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:52:22,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:52:22,248 INFO L87 Difference]: Start difference. First operand 1792 states and 3169 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-03-17 19:52:22,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:22,310 INFO L93 Difference]: Finished difference Result 1835 states and 3247 transitions. [2025-03-17 19:52:22,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1835 states and 3247 transitions. [2025-03-17 19:52:22,320 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 108 [2025-03-17 19:52:22,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1835 states to 1821 states and 3230 transitions. [2025-03-17 19:52:22,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 471 [2025-03-17 19:52:22,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 471 [2025-03-17 19:52:22,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1821 states and 3230 transitions. [2025-03-17 19:52:22,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:22,338 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1821 states and 3230 transitions. [2025-03-17 19:52:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states and 3230 transitions. [2025-03-17 19:52:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1795. [2025-03-17 19:52:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1156 states have (on average 1.2629757785467128) internal successors, (1460), 1352 states have internal predecessors, (1460), 367 states have call successors, (373), 219 states have call predecessors, (373), 272 states have return successors, (1340), 223 states have call predecessors, (1340), 353 states have call successors, (1340) [2025-03-17 19:52:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3173 transitions. [2025-03-17 19:52:22,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1795 states and 3173 transitions. [2025-03-17 19:52:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:52:22,381 INFO L432 stractBuchiCegarLoop]: Abstraction has 1795 states and 3173 transitions. [2025-03-17 19:52:22,381 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 19:52:22,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1795 states and 3173 transitions. [2025-03-17 19:52:22,386 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 99 [2025-03-17 19:52:22,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:22,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:22,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 7, 6, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:22,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 19:52:22,387 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:22,387 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;" >"#37#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-03-17 19:52:22,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash 710847492, now seen corresponding path program 2 times [2025-03-17 19:52:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:22,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928368468] [2025-03-17 19:52:22,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:22,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:22,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-17 19:52:22,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 19:52:22,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:22,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-17 19:52:22,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:22,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928368468] [2025-03-17 19:52:22,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928368468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:22,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986368476] [2025-03-17 19:52:22,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:22,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:22,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:22,482 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:22,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-03-17 19:52:22,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-17 19:52:22,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 19:52:22,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:22,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:22,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:52:22,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-17 19:52:22,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-17 19:52:22,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986368476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:22,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:22,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-17 19:52:22,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941956983] [2025-03-17 19:52:22,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:22,698 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:22,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash -443356621, now seen corresponding path program 2 times [2025-03-17 19:52:22,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:22,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130812775] [2025-03-17 19:52:22,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:22,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 19:52:22,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:52:22,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:22,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:22,705 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:22,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:52:22,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:52:22,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:22,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:22,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:22,880 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:22,880 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:22,880 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:22,880 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:22,880 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:22,880 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:22,880 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:22,880 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:22,881 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2025-03-17 19:52:22,881 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:22,881 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:22,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:22,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:22,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:22,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:22,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:22,929 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:22,929 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:22,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:22,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:22,931 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:22,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-17 19:52:22,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:22,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:22,943 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:22,943 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:22,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-17 19:52:22,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:22,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:22,950 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:22,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-17 19:52:22,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:22,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:22,962 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:22,962 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-03-17 19:52:22,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-17 19:52:22,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:22,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:22,969 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:22,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-17 19:52:22,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:22,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:22,982 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:22,982 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-03-17 19:52:22,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:22,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:22,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:22,989 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:22,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-17 19:52:22,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:22,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:23,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-17 19:52:23,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:23,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:23,016 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:23,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-17 19:52:23,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:23,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:23,257 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:23,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-17 19:52:23,266 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:23,266 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:23,266 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:23,266 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:23,266 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:23,266 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:23,266 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:23,266 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:23,266 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2025-03-17 19:52:23,266 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:23,266 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:23,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:23,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:23,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:23,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:23,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:23,330 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:23,330 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:23,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:23,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:23,334 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:23,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-17 19:52:23,336 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-03-17 19:52:23,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:23,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:23,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:23,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:23,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:23,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:23,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:23,349 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:23,352 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:23,352 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:23,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:23,354 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:23,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-17 19:52:23,355 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:23,355 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:23,355 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:23,355 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2025-03-17 19:52:23,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-17 19:52:23,361 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:23,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:23,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 19:52:23,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 19:52:23,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:23,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:23,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:52:23,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:23,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:52:23,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:52:23,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:23,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:23,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:52:23,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:23,696 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-03-17 19:52:23,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1795 states and 3173 transitions. cyclomatic complexity: 1419 Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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-03-17 19:52:23,949 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1795 states and 3173 transitions. cyclomatic complexity: 1419. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 8542 states and 15708 transitions. Complement of second has 50 states. [2025-03-17 19:52:23,949 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-03-17 19:52:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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-03-17 19:52:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2025-03-17 19:52:23,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 78 transitions. Stem has 67 letters. Loop has 15 letters. [2025-03-17 19:52:23,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:23,950 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:23,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:23,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 19:52:24,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 19:52:24,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:24,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:24,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:52:24,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:24,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-17 19:52:24,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:52:24,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:52:24,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:24,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:24,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:52:24,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:24,237 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-03-17 19:52:24,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1795 states and 3173 transitions. cyclomatic complexity: 1419 Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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-03-17 19:52:24,462 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1795 states and 3173 transitions. cyclomatic complexity: 1419. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 9039 states and 17004 transitions. Complement of second has 48 states. [2025-03-17 19:52:24,463 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-03-17 19:52:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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-03-17 19:52:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2025-03-17 19:52:24,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 67 letters. Loop has 15 letters. [2025-03-17 19:52:24,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:24,464 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:24,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:24,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 19:52:24,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 19:52:24,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:24,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:24,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 19:52:24,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:24,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 19:52:24,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 19:52:24,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:24,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:24,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:52:24,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:24,742 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-03-17 19:52:24,742 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1795 states and 3173 transitions. cyclomatic complexity: 1419 Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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-03-17 19:52:25,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1795 states and 3173 transitions. cyclomatic complexity: 1419. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 20463 states and 40600 transitions. Complement of second has 334 states. [2025-03-17 19:52:25,168 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-03-17 19:52:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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-03-17 19:52:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2025-03-17 19:52:25,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 86 transitions. Stem has 67 letters. Loop has 15 letters. [2025-03-17 19:52:25,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:25,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 86 transitions. Stem has 82 letters. Loop has 15 letters. [2025-03-17 19:52:25,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:25,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 86 transitions. Stem has 67 letters. Loop has 30 letters. [2025-03-17 19:52:25,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:25,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20463 states and 40600 transitions. [2025-03-17 19:52:25,401 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 104 [2025-03-17 19:52:25,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20463 states to 11065 states and 25063 transitions. [2025-03-17 19:52:25,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1090 [2025-03-17 19:52:25,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1265 [2025-03-17 19:52:25,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11065 states and 25063 transitions. [2025-03-17 19:52:25,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:25,584 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11065 states and 25063 transitions. [2025-03-17 19:52:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11065 states and 25063 transitions. [2025-03-17 19:52:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11065 to 8097. [2025-03-17 19:52:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8097 states, 5098 states have (on average 1.263828952530404) internal successors, (6443), 5923 states have internal predecessors, (6443), 1946 states have call successors, (1998), 1007 states have call predecessors, (1998), 1053 states have return successors, (4996), 1166 states have call predecessors, (4996), 1921 states have call successors, (4996) [2025-03-17 19:52:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8097 states to 8097 states and 13437 transitions. [2025-03-17 19:52:25,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8097 states and 13437 transitions. [2025-03-17 19:52:25,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:25,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:52:25,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-17 19:52:25,911 INFO L87 Difference]: Start difference. First operand 8097 states and 13437 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 19:52:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:26,173 INFO L93 Difference]: Finished difference Result 1951 states and 2766 transitions. [2025-03-17 19:52:26,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1951 states and 2766 transitions. [2025-03-17 19:52:26,180 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 50 [2025-03-17 19:52:26,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1951 states to 1700 states and 2505 transitions. [2025-03-17 19:52:26,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2025-03-17 19:52:26,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2025-03-17 19:52:26,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1700 states and 2505 transitions. [2025-03-17 19:52:26,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:26,189 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1700 states and 2505 transitions. [2025-03-17 19:52:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states and 2505 transitions. [2025-03-17 19:52:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1508. [2025-03-17 19:52:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 953 states have (on average 1.2088142707240295) internal successors, (1152), 1062 states have internal predecessors, (1152), 333 states have call successors, (351), 170 states have call predecessors, (351), 222 states have return successors, (652), 275 states have call predecessors, (652), 331 states have call successors, (652) [2025-03-17 19:52:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2155 transitions. [2025-03-17 19:52:26,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1508 states and 2155 transitions. [2025-03-17 19:52:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:52:26,209 INFO L432 stractBuchiCegarLoop]: Abstraction has 1508 states and 2155 transitions. [2025-03-17 19:52:26,209 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-17 19:52:26,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2155 transitions. [2025-03-17 19:52:26,212 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 50 [2025-03-17 19:52:26,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:26,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:26,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 9, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:26,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:26,213 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-03-17 19:52:26,213 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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< [2025-03-17 19:52:26,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash -715090753, now seen corresponding path program 1 times [2025-03-17 19:52:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:26,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784178384] [2025-03-17 19:52:26,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:26,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 19:52:26,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 19:52:26,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:26,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 67 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-17 19:52:26,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784178384] [2025-03-17 19:52:26,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784178384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635840314] [2025-03-17 19:52:26,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:26,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:26,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,324 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-03-17 19:52:26,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 19:52:26,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 19:52:26,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:26,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:26,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:52:26,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 105 proven. 39 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-17 19:52:26,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 67 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-17 19:52:26,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635840314] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:26,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:26,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2025-03-17 19:52:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343896590] [2025-03-17 19:52:26,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:26,486 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:26,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1792998799, now seen corresponding path program 3 times [2025-03-17 19:52:26,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:26,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304505976] [2025-03-17 19:52:26,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:26,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:26,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 2 equivalence classes. [2025-03-17 19:52:26,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:26,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:52:26,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:26,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:26,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:26,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:26,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:26,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:26,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:26,582 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:26,582 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:26,583 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:26,583 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:26,583 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:26,583 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,583 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:26,583 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:26,583 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2025-03-17 19:52:26,583 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:26,583 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:26,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,622 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:26,622 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:26,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,624 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-17 19:52:26,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:26,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:26,638 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:26,639 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:26,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:26,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,647 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-17 19:52:26,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:26,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:26,661 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:26,661 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-03-17 19:52:26,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:26,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,670 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-17 19:52:26,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:26,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:26,684 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:26,684 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:26,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,692 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-17 19:52:26,695 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:26,695 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:26,706 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:26,706 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:26,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:26,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,714 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-17 19:52:26,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:26,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:26,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:26,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,736 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-17 19:52:26,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:26,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:26,838 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:26,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:26,844 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:26,844 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:26,844 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:26,844 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:26,844 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:26,844 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,845 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:26,845 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:26,845 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2025-03-17 19:52:26,845 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:26,845 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:26,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:26,885 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:26,886 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:26,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,888 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-17 19:52:26,890 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-03-17 19:52:26,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:26,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:26,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:26,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:26,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:26,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:26,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:26,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:26,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:26,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,910 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-17 19:52:26,913 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-03-17 19:52:26,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:26,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:26,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:26,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:26,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:26,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:26,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:26,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:26,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-17 19:52:26,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,934 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-03-17 19:52:26,937 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-03-17 19:52:26,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:26,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:26,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:26,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:26,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:26,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:26,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:26,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:26,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:26,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,957 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-03-17 19:52:26,959 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-03-17 19:52:26,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:26,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:26,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:26,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:26,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:26,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:26,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:26,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:26,974 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 19:52:26,974 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:26,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:26,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:26,977 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:26,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-03-17 19:52:26,978 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:26,978 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:26,979 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:26,979 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2025-03-17 19:52:26,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-03-17 19:52:26,986 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:26,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 19:52:27,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 19:52:27,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:27,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:52:27,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:27,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:27,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:27,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:27,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:52:27,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:27,323 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-03-17 19:52:27,323 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1508 states and 2155 transitions. cyclomatic complexity: 675 Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 19:52:27,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1508 states and 2155 transitions. cyclomatic complexity: 675. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 1534 states and 2182 transitions. Complement of second has 22 states. [2025-03-17 19:52:27,416 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-03-17 19:52:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 19:52:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2025-03-17 19:52:27,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 83 letters. Loop has 10 letters. [2025-03-17 19:52:27,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:27,416 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:27,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 19:52:27,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:27,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 19:52:27,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:27,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:52:27,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:27,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:27,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:27,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:27,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:52:27,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:27,748 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-03-17 19:52:27,748 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1508 states and 2155 transitions. cyclomatic complexity: 675 Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 19:52:27,833 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1508 states and 2155 transitions. cyclomatic complexity: 675. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 1534 states and 2182 transitions. Complement of second has 22 states. [2025-03-17 19:52:27,834 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-03-17 19:52:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 19:52:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2025-03-17 19:52:27,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 83 letters. Loop has 10 letters. [2025-03-17 19:52:27,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:27,835 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:27,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:27,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 19:52:27,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 19:52:27,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:27,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:27,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:52:27,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:28,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:52:28,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:52:28,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:28,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:52:28,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:52:28,181 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-03-17 19:52:28,182 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1508 states and 2155 transitions. cyclomatic complexity: 675 Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 19:52:28,374 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1508 states and 2155 transitions. cyclomatic complexity: 675. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 9025 states and 13662 transitions. Complement of second has 147 states. [2025-03-17 19:52:28,375 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-03-17 19:52:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 19:52:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2025-03-17 19:52:28,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 70 transitions. Stem has 83 letters. Loop has 10 letters. [2025-03-17 19:52:28,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:28,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 70 transitions. Stem has 93 letters. Loop has 10 letters. [2025-03-17 19:52:28,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:28,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 70 transitions. Stem has 83 letters. Loop has 20 letters. [2025-03-17 19:52:28,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:28,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9025 states and 13662 transitions. [2025-03-17 19:52:28,414 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 [2025-03-17 19:52:28,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9025 states to 4170 states and 6756 transitions. [2025-03-17 19:52:28,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2025-03-17 19:52:28,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2025-03-17 19:52:28,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4170 states and 6756 transitions. [2025-03-17 19:52:28,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:28,444 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4170 states and 6756 transitions. [2025-03-17 19:52:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states and 6756 transitions. [2025-03-17 19:52:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 3427. [2025-03-17 19:52:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3427 states, 2195 states have (on average 1.237357630979499) internal successors, (2716), 2459 states have internal predecessors, (2716), 729 states have call successors, (744), 394 states have call predecessors, (744), 503 states have return successors, (1485), 573 states have call predecessors, (1485), 727 states have call successors, (1485) [2025-03-17 19:52:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 4945 transitions. [2025-03-17 19:52:28,492 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3427 states and 4945 transitions. [2025-03-17 19:52:28,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:28,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:52:28,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:52:28,493 INFO L87 Difference]: Start difference. First operand 3427 states and 4945 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 6 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-17 19:52:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:28,637 INFO L93 Difference]: Finished difference Result 3391 states and 4901 transitions. [2025-03-17 19:52:28,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3391 states and 4901 transitions. [2025-03-17 19:52:28,648 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2025-03-17 19:52:28,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3391 states to 3387 states and 4897 transitions. [2025-03-17 19:52:28,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2025-03-17 19:52:28,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2025-03-17 19:52:28,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3387 states and 4897 transitions. [2025-03-17 19:52:28,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:28,668 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3387 states and 4897 transitions. [2025-03-17 19:52:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states and 4897 transitions. [2025-03-17 19:52:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3385. [2025-03-17 19:52:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 2165 states have (on average 1.2387990762124712) internal successors, (2682), 2429 states have internal predecessors, (2682), 721 states have call successors, (736), 390 states have call predecessors, (736), 499 states have return successors, (1477), 565 states have call predecessors, (1477), 719 states have call successors, (1477) [2025-03-17 19:52:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4895 transitions. [2025-03-17 19:52:28,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3385 states and 4895 transitions. [2025-03-17 19:52:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:52:28,745 INFO L432 stractBuchiCegarLoop]: Abstraction has 3385 states and 4895 transitions. [2025-03-17 19:52:28,745 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-17 19:52:28,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3385 states and 4895 transitions. [2025-03-17 19:52:28,754 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2025-03-17 19:52:28,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:28,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:28,755 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] [2025-03-17 19:52:28,755 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-03-17 19:52:28,756 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:28,756 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:28,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:28,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1813170452, now seen corresponding path program 1 times [2025-03-17 19:52:28,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:28,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033272578] [2025-03-17 19:52:28,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:28,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:28,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:28,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:28,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:28,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:28,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:28,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:28,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash 28439662, now seen corresponding path program 1 times [2025-03-17 19:52:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:28,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459259405] [2025-03-17 19:52:28,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:28,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 19:52:28,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 19:52:28,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:28,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 19:52:28,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 19:52:28,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:28,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:28,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:28,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1510702887, now seen corresponding path program 2 times [2025-03-17 19:52:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:28,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783750146] [2025-03-17 19:52:28,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:28,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-17 19:52:28,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 19:52:28,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:28,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 116 proven. 122 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2025-03-17 19:52:29,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:29,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783750146] [2025-03-17 19:52:29,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783750146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:29,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639057192] [2025-03-17 19:52:29,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:29,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:29,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:29,084 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:29,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2025-03-17 19:52:29,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-17 19:52:29,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 19:52:29,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:29,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:29,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:52:29,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 472 proven. 10 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-03-17 19:52:29,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 152 proven. 76 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2025-03-17 19:52:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639057192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:29,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 25 [2025-03-17 19:52:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770023925] [2025-03-17 19:52:29,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:30,002 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:30,002 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:30,002 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:30,002 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:30,002 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:30,002 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:30,002 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:30,002 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:30,002 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2025-03-17 19:52:30,002 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:30,002 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:30,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:30,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:30,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:30,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:30,033 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:30,033 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:30,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:30,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,035 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-03-17 19:52:30,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:30,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:30,055 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:30,055 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-03-17 19:52:30,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-17 19:52:30,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:30,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,062 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-17 19:52:30,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:30,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:30,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-03-17 19:52:30,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,082 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-03-17 19:52:30,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:30,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:30,095 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:30,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-17 19:52:30,101 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:30,102 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:30,102 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:30,102 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:30,102 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:30,102 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:30,102 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:30,102 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:30,102 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2025-03-17 19:52:30,102 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:30,102 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:30,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:30,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:30,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:30,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:30,136 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:30,136 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:30,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:30,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,138 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-03-17 19:52:30,139 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-03-17 19:52:30,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:30,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:30,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:30,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:30,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:30,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:30,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:30,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:30,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-03-17 19:52:30,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:30,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,159 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-03-17 19:52:30,161 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-03-17 19:52:30,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:30,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:30,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:30,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:30,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:30,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:30,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:30,172 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:30,173 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:30,174 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:30,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:30,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:30,176 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:30,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-03-17 19:52:30,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:30,177 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:30,177 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:30,177 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-03-17 19:52:30,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-17 19:52:30,183 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:30,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:30,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:30,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:30,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:30,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:52:30,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:30,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 19:52:30,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 19:52:30,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:30,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:30,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:52:30,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 14 proven. 47 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 19:52:30,787 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-03-17 19:52:30,787 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3385 states and 4895 transitions. cyclomatic complexity: 1557 Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 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-03-17 19:52:31,130 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3385 states and 4895 transitions. cyclomatic complexity: 1557. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 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 9655 states and 15188 transitions. Complement of second has 91 states. [2025-03-17 19:52:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 2 stem states 15 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 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-03-17 19:52:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2025-03-17 19:52:31,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 99 transitions. Stem has 84 letters. Loop has 60 letters. [2025-03-17 19:52:31,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:31,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 99 transitions. Stem has 144 letters. Loop has 60 letters. [2025-03-17 19:52:31,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:31,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 99 transitions. Stem has 84 letters. Loop has 120 letters. [2025-03-17 19:52:31,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:31,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9655 states and 15188 transitions. [2025-03-17 19:52:31,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:31,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2025-03-17 19:52:31,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9655 states to 9340 states and 14650 transitions. [2025-03-17 19:52:31,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2025-03-17 19:52:31,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2025-03-17 19:52:31,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9340 states and 14650 transitions. [2025-03-17 19:52:31,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:31,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9340 states and 14650 transitions. [2025-03-17 19:52:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states and 14650 transitions. [2025-03-17 19:52:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 8401. [2025-03-17 19:52:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8401 states, 5307 states have (on average 1.2027510834746562) internal successors, (6383), 5916 states have internal predecessors, (6383), 1690 states have call successors, (1720), 840 states have call predecessors, (1720), 1404 states have return successors, (4408), 1644 states have call predecessors, (4408), 1686 states have call successors, (4408) [2025-03-17 19:52:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8401 states to 8401 states and 12511 transitions. [2025-03-17 19:52:31,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8401 states and 12511 transitions. [2025-03-17 19:52:31,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:31,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 19:52:31,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:52:31,440 INFO L87 Difference]: Start difference. First operand 8401 states and 12511 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 18 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 14 states have call predecessors, (25), 18 states have call successors, (25) [2025-03-17 19:52:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:32,153 INFO L93 Difference]: Finished difference Result 9316 states and 14473 transitions. [2025-03-17 19:52:32,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9316 states and 14473 transitions. [2025-03-17 19:52:32,197 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 102 [2025-03-17 19:52:32,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9316 states to 4817 states and 7572 transitions. [2025-03-17 19:52:32,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 396 [2025-03-17 19:52:32,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 396 [2025-03-17 19:52:32,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4817 states and 7572 transitions. [2025-03-17 19:52:32,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:32,230 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4817 states and 7572 transitions. [2025-03-17 19:52:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4817 states and 7572 transitions. [2025-03-17 19:52:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4817 to 4434. [2025-03-17 19:52:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4434 states, 2810 states have (on average 1.201067615658363) internal successors, (3375), 3126 states have internal predecessors, (3375), 905 states have call successors, (937), 440 states have call predecessors, (937), 719 states have return successors, (2385), 867 states have call predecessors, (2385), 901 states have call successors, (2385) [2025-03-17 19:52:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4434 states to 4434 states and 6697 transitions. [2025-03-17 19:52:32,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4434 states and 6697 transitions. [2025-03-17 19:52:32,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 19:52:32,313 INFO L432 stractBuchiCegarLoop]: Abstraction has 4434 states and 6697 transitions. [2025-03-17 19:52:32,314 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-17 19:52:32,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4434 states and 6697 transitions. [2025-03-17 19:52:32,322 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2025-03-17 19:52:32,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:32,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:32,323 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] [2025-03-17 19:52:32,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 13, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1] [2025-03-17 19:52:32,323 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:32,323 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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:32,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:32,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1813170452, now seen corresponding path program 3 times [2025-03-17 19:52:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:32,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566499456] [2025-03-17 19:52:32,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:32,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:32,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 84 statements into 5 equivalence classes. [2025-03-17 19:52:32,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:32,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 19:52:32,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:32,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:32,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:32,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:32,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:32,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:32,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:32,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:32,342 INFO L85 PathProgramCache]: Analyzing trace with hash -808277255, now seen corresponding path program 2 times [2025-03-17 19:52:32,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:32,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297159790] [2025-03-17 19:52:32,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:32,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:32,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-17 19:52:32,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 19:52:32,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:32,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 23 proven. 50 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2025-03-17 19:52:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297159790] [2025-03-17 19:52:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297159790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528650970] [2025-03-17 19:52:32,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:32,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:32,394 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:32,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2025-03-17 19:52:32,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-17 19:52:32,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 19:52:32,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:32,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:32,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:52:32,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-17 19:52:32,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:52:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528650970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:32,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:52:32,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-03-17 19:52:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599765248] [2025-03-17 19:52:32,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:32,499 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:32,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:52:32,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:52:32,500 INFO L87 Difference]: Start difference. First operand 4434 states and 6697 transitions. cyclomatic complexity: 2318 Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 19:52:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:32,575 INFO L93 Difference]: Finished difference Result 4497 states and 6808 transitions. [2025-03-17 19:52:32,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4497 states and 6808 transitions. [2025-03-17 19:52:32,594 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2025-03-17 19:52:32,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4497 states to 4416 states and 6710 transitions. [2025-03-17 19:52:32,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 325 [2025-03-17 19:52:32,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 325 [2025-03-17 19:52:32,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4416 states and 6710 transitions. [2025-03-17 19:52:32,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:32,624 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4416 states and 6710 transitions. [2025-03-17 19:52:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4416 states and 6710 transitions. [2025-03-17 19:52:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4416 to 4343. [2025-03-17 19:52:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4343 states, 2744 states have (on average 1.2033527696793003) internal successors, (3302), 3055 states have internal predecessors, (3302), 891 states have call successors, (918), 432 states have call predecessors, (918), 708 states have return successors, (2359), 855 states have call predecessors, (2359), 887 states have call successors, (2359) [2025-03-17 19:52:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6579 transitions. [2025-03-17 19:52:32,697 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4343 states and 6579 transitions. [2025-03-17 19:52:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:52:32,698 INFO L432 stractBuchiCegarLoop]: Abstraction has 4343 states and 6579 transitions. [2025-03-17 19:52:32,698 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-17 19:52:32,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4343 states and 6579 transitions. [2025-03-17 19:52:32,706 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2025-03-17 19:52:32,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:32,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:32,709 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] [2025-03-17 19:52:32,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 17, 11, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-03-17 19:52:32,709 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:32,709 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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);" "assume !(~q <= 0);" "assume ~q > ~p;" "call #t~ret0 := parts(~p, ~p);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:32,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:32,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1813170452, now seen corresponding path program 4 times [2025-03-17 19:52:32,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:32,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042519426] [2025-03-17 19:52:32,710 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:32,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:32,713 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 84 statements into 2 equivalence classes. [2025-03-17 19:52:32,717 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:32,717 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:32,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:32,717 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:32,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:32,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:32,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:32,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:32,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:32,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash -198061296, now seen corresponding path program 3 times [2025-03-17 19:52:32,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:32,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626549088] [2025-03-17 19:52:32,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:32,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:32,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 9 equivalence classes. [2025-03-17 19:52:32,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 84 of 159 statements. [2025-03-17 19:52:32,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:52:32,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1212 backedges. 252 proven. 4 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2025-03-17 19:52:32,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:32,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626549088] [2025-03-17 19:52:32,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626549088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:32,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779953996] [2025-03-17 19:52:32,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:32,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:32,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:32,802 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:32,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2025-03-17 19:52:32,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 9 equivalence classes. [2025-03-17 19:52:32,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 84 of 159 statements. [2025-03-17 19:52:32,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 19:52:32,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:32,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:52:32,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1212 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2025-03-17 19:52:32,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:52:32,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779953996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:52:32,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:52:32,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-17 19:52:32,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495891105] [2025-03-17 19:52:32,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:52:32,878 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:32,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:32,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:52:32,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 19:52:32,878 INFO L87 Difference]: Start difference. First operand 4343 states and 6579 transitions. cyclomatic complexity: 2288 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 19:52:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:32,917 INFO L93 Difference]: Finished difference Result 3800 states and 5387 transitions. [2025-03-17 19:52:32,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3800 states and 5387 transitions. [2025-03-17 19:52:32,929 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2025-03-17 19:52:32,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3800 states to 3607 states and 5194 transitions. [2025-03-17 19:52:32,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2025-03-17 19:52:32,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2025-03-17 19:52:32,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3607 states and 5194 transitions. [2025-03-17 19:52:32,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:32,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3607 states and 5194 transitions. [2025-03-17 19:52:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states and 5194 transitions. [2025-03-17 19:52:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3546. [2025-03-17 19:52:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3546 states, 2257 states have (on average 1.1949490474080637) internal successors, (2697), 2497 states have internal predecessors, (2697), 825 states have call successors, (852), 408 states have call predecessors, (852), 464 states have return successors, (1562), 640 states have call predecessors, (1562), 821 states have call successors, (1562) [2025-03-17 19:52:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 5111 transitions. [2025-03-17 19:52:32,999 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3546 states and 5111 transitions. [2025-03-17 19:52:32,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:52:33,000 INFO L432 stractBuchiCegarLoop]: Abstraction has 3546 states and 5111 transitions. [2025-03-17 19:52:33,000 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-17 19:52:33,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3546 states and 5111 transitions. [2025-03-17 19:52:33,006 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2025-03-17 19:52:33,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:33,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:33,009 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] [2025-03-17 19:52:33,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 19, 10, 9, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1] [2025-03-17 19:52:33,009 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:33,009 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:33,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:33,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1813170452, now seen corresponding path program 5 times [2025-03-17 19:52:33,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:33,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115831710] [2025-03-17 19:52:33,010 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:33,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:33,013 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 84 statements into 5 equivalence classes. [2025-03-17 19:52:33,021 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:33,021 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-17 19:52:33,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:33,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:33,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:33,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:33,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:33,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:33,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:33,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:33,030 INFO L85 PathProgramCache]: Analyzing trace with hash 904592200, now seen corresponding path program 4 times [2025-03-17 19:52:33,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:33,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940330934] [2025-03-17 19:52:33,030 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:33,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:33,034 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-17 19:52:33,042 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 19:52:33,043 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:33,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 161 proven. 41 refuted. 0 times theorem prover too weak. 1046 trivial. 0 not checked. [2025-03-17 19:52:33,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:33,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940330934] [2025-03-17 19:52:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940330934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:33,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435187017] [2025-03-17 19:52:33,085 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:33,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:33,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:33,088 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:33,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2025-03-17 19:52:33,120 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-17 19:52:33,148 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 19:52:33,148 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:33,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:33,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:52:33,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 525 proven. 277 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2025-03-17 19:52:33,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 150 proven. 414 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 19:52:34,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435187017] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:34,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:34,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15, 21] total 29 [2025-03-17 19:52:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959131744] [2025-03-17 19:52:34,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:34,041 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:34,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 19:52:34,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-03-17 19:52:34,041 INFO L87 Difference]: Start difference. First operand 3546 states and 5111 transitions. cyclomatic complexity: 1617 Second operand has 29 states, 29 states have (on average 2.9655172413793105) internal successors, (86), 27 states have internal predecessors, (86), 19 states have call successors, (28), 2 states have call predecessors, (28), 9 states have return successors, (33), 11 states have call predecessors, (33), 19 states have call successors, (33) [2025-03-17 19:52:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:34,854 INFO L93 Difference]: Finished difference Result 4941 states and 7472 transitions. [2025-03-17 19:52:34,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4941 states and 7472 transitions. [2025-03-17 19:52:34,874 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 146 [2025-03-17 19:52:34,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4941 states to 3376 states and 5267 transitions. [2025-03-17 19:52:34,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 470 [2025-03-17 19:52:34,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 478 [2025-03-17 19:52:34,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3376 states and 5267 transitions. [2025-03-17 19:52:34,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:34,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3376 states and 5267 transitions. [2025-03-17 19:52:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states and 5267 transitions. [2025-03-17 19:52:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 2316. [2025-03-17 19:52:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 1466 states have (on average 1.1296043656207366) internal successors, (1656), 1572 states have internal predecessors, (1656), 551 states have call successors, (584), 254 states have call predecessors, (584), 299 states have return successors, (948), 489 states have call predecessors, (948), 543 states have call successors, (948) [2025-03-17 19:52:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3188 transitions. [2025-03-17 19:52:34,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2316 states and 3188 transitions. [2025-03-17 19:52:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 19:52:34,933 INFO L432 stractBuchiCegarLoop]: Abstraction has 2316 states and 3188 transitions. [2025-03-17 19:52:34,933 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-17 19:52:34,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2316 states and 3188 transitions. [2025-03-17 19:52:34,937 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 124 [2025-03-17 19:52:34,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:34,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:34,938 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] [2025-03-17 19:52:34,938 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [40, 40, 32, 20, 16, 16, 16, 16, 16, 16, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-03-17 19:52:34,938 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:34,939 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#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);" "assume !(~q > ~p);" "call #t~ret1 := parts(~p - ~q, ~q);"< "~p := #in~p;~q := #in~q;" "assume ~p <= 0;#res := 1;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:34,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1813170452, now seen corresponding path program 6 times [2025-03-17 19:52:34,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:34,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739813738] [2025-03-17 19:52:34,939 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:34,942 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 84 statements into 5 equivalence classes. [2025-03-17 19:52:34,949 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:34,949 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-17 19:52:34,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:34,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:34,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:34,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:34,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:34,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:34,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:34,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2034075667, now seen corresponding path program 5 times [2025-03-17 19:52:34,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:34,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247660453] [2025-03-17 19:52:34,956 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:34,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:34,962 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 282 statements into 20 equivalence classes. [2025-03-17 19:52:34,973 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 123 of 282 statements. [2025-03-17 19:52:34,973 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-17 19:52:34,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 648 proven. 804 refuted. 0 times theorem prover too weak. 2748 trivial. 0 not checked. [2025-03-17 19:52:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247660453] [2025-03-17 19:52:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247660453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62153030] [2025-03-17 19:52:35,445 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:35,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:35,447 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:35,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2025-03-17 19:52:35,493 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 282 statements into 20 equivalence classes. [2025-03-17 19:52:35,518 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 123 of 282 statements. [2025-03-17 19:52:35,518 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-17 19:52:35,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:35,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:52:35,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 1276 proven. 388 refuted. 0 times theorem prover too weak. 2536 trivial. 0 not checked. [2025-03-17 19:52:35,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4200 backedges. 544 proven. 502 refuted. 0 times theorem prover too weak. 3154 trivial. 0 not checked. [2025-03-17 19:52:36,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62153030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:36,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:36,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 13] total 30 [2025-03-17 19:52:36,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520301937] [2025-03-17 19:52:36,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:36,519 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:36,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:36,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 19:52:36,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2025-03-17 19:52:36,519 INFO L87 Difference]: Start difference. First operand 2316 states and 3188 transitions. cyclomatic complexity: 923 Second operand has 30 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 17 states have call successors, (27), 2 states have call predecessors, (27), 11 states have return successors, (33), 14 states have call predecessors, (33), 17 states have call successors, (33) [2025-03-17 19:52:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:37,401 INFO L93 Difference]: Finished difference Result 2485 states and 3118 transitions. [2025-03-17 19:52:37,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2485 states and 3118 transitions. [2025-03-17 19:52:37,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2025-03-17 19:52:37,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2485 states to 1165 states and 1516 transitions. [2025-03-17 19:52:37,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2025-03-17 19:52:37,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 244 [2025-03-17 19:52:37,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1165 states and 1516 transitions. [2025-03-17 19:52:37,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:37,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1165 states and 1516 transitions. [2025-03-17 19:52:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states and 1516 transitions. [2025-03-17 19:52:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 913. [2025-03-17 19:52:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 614 states have (on average 1.0553745928338762) internal successors, (648), 635 states have internal predecessors, (648), 178 states have call successors, (197), 106 states have call predecessors, (197), 121 states have return successors, (261), 171 states have call predecessors, (261), 178 states have call successors, (261) [2025-03-17 19:52:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1106 transitions. [2025-03-17 19:52:37,434 INFO L240 hiAutomatonCegarLoop]: Abstraction has 913 states and 1106 transitions. [2025-03-17 19:52:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 19:52:37,435 INFO L432 stractBuchiCegarLoop]: Abstraction has 913 states and 1106 transitions. [2025-03-17 19:52:37,435 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-17 19:52:37,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 913 states and 1106 transitions. [2025-03-17 19:52:37,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2025-03-17 19:52:37,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:37,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:37,438 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] [2025-03-17 19:52:37,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 18, 10, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1] [2025-03-17 19:52:37,439 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:37,439 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:37,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:37,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1813170452, now seen corresponding path program 7 times [2025-03-17 19:52:37,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:37,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480752303] [2025-03-17 19:52:37,439 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:37,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:37,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:37,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:37,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:37,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:37,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:37,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:37,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:37,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:37,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:37,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:37,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:37,458 INFO L85 PathProgramCache]: Analyzing trace with hash -447132871, now seen corresponding path program 6 times [2025-03-17 19:52:37,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:37,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106360373] [2025-03-17 19:52:37,458 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:37,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:37,464 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 158 statements into 11 equivalence classes. [2025-03-17 19:52:37,483 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 138 of 158 statements. [2025-03-17 19:52:37,483 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-17 19:52:37,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 377 proven. 203 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2025-03-17 19:52:37,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:37,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106360373] [2025-03-17 19:52:37,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106360373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417362632] [2025-03-17 19:52:37,708 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:37,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:37,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:37,711 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:37,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2025-03-17 19:52:37,756 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 158 statements into 11 equivalence classes. [2025-03-17 19:52:37,790 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 138 of 158 statements. [2025-03-17 19:52:37,790 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-17 19:52:37,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:37,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 19:52:37,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 333 proven. 195 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2025-03-17 19:52:37,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 337 proven. 193 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2025-03-17 19:52:38,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417362632] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:38,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:38,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 28 [2025-03-17 19:52:38,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799489823] [2025-03-17 19:52:38,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:38,421 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:38,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:38,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 19:52:38,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-03-17 19:52:38,422 INFO L87 Difference]: Start difference. First operand 913 states and 1106 transitions. cyclomatic complexity: 214 Second operand has 29 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 27 states have internal predecessors, (95), 22 states have call successors, (30), 1 states have call predecessors, (30), 9 states have return successors, (33), 18 states have call predecessors, (33), 22 states have call successors, (33) [2025-03-17 19:52:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:39,308 INFO L93 Difference]: Finished difference Result 1375 states and 1775 transitions. [2025-03-17 19:52:39,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1375 states and 1775 transitions. [2025-03-17 19:52:39,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2025-03-17 19:52:39,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1375 states to 1248 states and 1603 transitions. [2025-03-17 19:52:39,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2025-03-17 19:52:39,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 299 [2025-03-17 19:52:39,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1248 states and 1603 transitions. [2025-03-17 19:52:39,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:39,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1248 states and 1603 transitions. [2025-03-17 19:52:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states and 1603 transitions. [2025-03-17 19:52:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1053. [2025-03-17 19:52:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 709 states have (on average 1.0479548660084625) internal successors, (743), 732 states have internal predecessors, (743), 208 states have call successors, (230), 116 states have call predecessors, (230), 136 states have return successors, (344), 204 states have call predecessors, (344), 208 states have call successors, (344) [2025-03-17 19:52:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1317 transitions. [2025-03-17 19:52:39,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1053 states and 1317 transitions. [2025-03-17 19:52:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 19:52:39,328 INFO L432 stractBuchiCegarLoop]: Abstraction has 1053 states and 1317 transitions. [2025-03-17 19:52:39,328 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-17 19:52:39,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1053 states and 1317 transitions. [2025-03-17 19:52:39,330 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2025-03-17 19:52:39,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:39,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:39,331 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [33, 33, 23, 13, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 19:52:39,331 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 12, 8, 7, 7, 7, 7, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:39,331 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:39,332 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);" "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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:39,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash 571694730, now seen corresponding path program 8 times [2025-03-17 19:52:39,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:39,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578433661] [2025-03-17 19:52:39,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:39,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 241 statements into 2 equivalence classes. [2025-03-17 19:52:39,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 241 of 241 statements. [2025-03-17 19:52:39,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:39,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2751 backedges. 14 proven. 114 refuted. 0 times theorem prover too weak. 2623 trivial. 0 not checked. [2025-03-17 19:52:39,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578433661] [2025-03-17 19:52:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578433661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989182168] [2025-03-17 19:52:39,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:39,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:39,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:39,479 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:39,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2025-03-17 19:52:39,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 241 statements into 2 equivalence classes. [2025-03-17 19:52:39,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 241 of 241 statements. [2025-03-17 19:52:39,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:39,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:39,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:52:39,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2751 backedges. 215 proven. 189 refuted. 0 times theorem prover too weak. 2347 trivial. 0 not checked. [2025-03-17 19:52:39,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2751 backedges. 215 proven. 189 refuted. 0 times theorem prover too weak. 2347 trivial. 0 not checked. [2025-03-17 19:52:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989182168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:40,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:40,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 26 [2025-03-17 19:52:40,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115591859] [2025-03-17 19:52:40,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:40,072 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:40,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2008205802, now seen corresponding path program 1 times [2025-03-17 19:52:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:40,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298287567] [2025-03-17 19:52:40,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:40,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:40,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 19:52:40,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 19:52:40,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:40,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 164 proven. 48 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-03-17 19:52:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:40,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298287567] [2025-03-17 19:52:40,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298287567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:40,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333012347] [2025-03-17 19:52:40,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:52:40,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:40,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:40,138 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:40,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2025-03-17 19:52:40,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 19:52:40,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 19:52:40,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:40,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:40,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:52:40,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 225 proven. 39 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-17 19:52:40,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 164 proven. 48 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-03-17 19:52:40,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333012347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:40,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:40,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-17 19:52:40,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609785635] [2025-03-17 19:52:40,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:40,549 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:40,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:40,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:52:40,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:52:40,550 INFO L87 Difference]: Start difference. First operand 1053 states and 1317 transitions. cyclomatic complexity: 290 Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (14), 4 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-17 19:52:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:40,637 INFO L93 Difference]: Finished difference Result 1074 states and 1282 transitions. [2025-03-17 19:52:40,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1074 states and 1282 transitions. [2025-03-17 19:52:40,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2025-03-17 19:52:40,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1074 states to 795 states and 960 transitions. [2025-03-17 19:52:40,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2025-03-17 19:52:40,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2025-03-17 19:52:40,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 795 states and 960 transitions. [2025-03-17 19:52:40,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:40,643 INFO L218 hiAutomatonCegarLoop]: Abstraction has 795 states and 960 transitions. [2025-03-17 19:52:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states and 960 transitions. [2025-03-17 19:52:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 774. [2025-03-17 19:52:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 531 states have (on average 1.0263653483992468) internal successors, (545), 542 states have internal predecessors, (545), 145 states have call successors, (160), 86 states have call predecessors, (160), 98 states have return successors, (215), 145 states have call predecessors, (215), 145 states have call successors, (215) [2025-03-17 19:52:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 920 transitions. [2025-03-17 19:52:40,650 INFO L240 hiAutomatonCegarLoop]: Abstraction has 774 states and 920 transitions. [2025-03-17 19:52:40,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:52:40,650 INFO L432 stractBuchiCegarLoop]: Abstraction has 774 states and 920 transitions. [2025-03-17 19:52:40,650 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-17 19:52:40,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 774 states and 920 transitions. [2025-03-17 19:52:40,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2025-03-17 19:52:40,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:40,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:40,653 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [31, 31, 22, 12, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 19:52:40,653 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 7, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:40,653 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:40,653 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);" "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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:40,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash 762754909, now seen corresponding path program 9 times [2025-03-17 19:52:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448818005] [2025-03-17 19:52:40,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:40,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 228 statements into 14 equivalence classes. [2025-03-17 19:52:40,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 170 of 228 statements. [2025-03-17 19:52:40,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 19:52:40,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 123 proven. 242 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2025-03-17 19:52:40,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:40,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448818005] [2025-03-17 19:52:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448818005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:40,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283745607] [2025-03-17 19:52:40,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:40,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:40,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:40,799 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:40,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2025-03-17 19:52:40,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 228 statements into 14 equivalence classes. [2025-03-17 19:52:40,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 170 of 228 statements. [2025-03-17 19:52:40,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 19:52:40,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:40,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:52:40,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 121 proven. 242 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2025-03-17 19:52:40,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 121 proven. 244 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2025-03-17 19:52:41,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283745607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:41,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:41,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 19 [2025-03-17 19:52:41,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687409686] [2025-03-17 19:52:41,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:41,219 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:41,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:41,220 INFO L85 PathProgramCache]: Analyzing trace with hash -925266863, now seen corresponding path program 2 times [2025-03-17 19:52:41,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:41,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197274012] [2025-03-17 19:52:41,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:41,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:41,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-03-17 19:52:41,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 19:52:41,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:41,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 148 proven. 115 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-17 19:52:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:41,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197274012] [2025-03-17 19:52:41,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197274012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:41,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077836063] [2025-03-17 19:52:41,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:41,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:41,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:41,352 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:41,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2025-03-17 19:52:41,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-03-17 19:52:41,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 19:52:41,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:41,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:41,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 19:52:41,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 147 proven. 112 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-17 19:52:41,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 147 proven. 116 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-17 19:52:42,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077836063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:42,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:42,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2025-03-17 19:52:42,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856284552] [2025-03-17 19:52:42,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:42,023 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:42,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:42,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 19:52:42,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-03-17 19:52:42,024 INFO L87 Difference]: Start difference. First operand 774 states and 920 transitions. cyclomatic complexity: 157 Second operand has 26 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 14 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (20), 12 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-17 19:52:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:42,572 INFO L93 Difference]: Finished difference Result 827 states and 1001 transitions. [2025-03-17 19:52:42,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 827 states and 1001 transitions. [2025-03-17 19:52:42,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2025-03-17 19:52:42,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 827 states to 809 states and 977 transitions. [2025-03-17 19:52:42,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229 [2025-03-17 19:52:42,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 229 [2025-03-17 19:52:42,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 809 states and 977 transitions. [2025-03-17 19:52:42,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:42,577 INFO L218 hiAutomatonCegarLoop]: Abstraction has 809 states and 977 transitions. [2025-03-17 19:52:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states and 977 transitions. [2025-03-17 19:52:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 774. [2025-03-17 19:52:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 533 states have (on average 1.022514071294559) internal successors, (545), 542 states have internal predecessors, (545), 142 states have call successors, (157), 86 states have call predecessors, (157), 99 states have return successors, (215), 145 states have call predecessors, (215), 142 states have call successors, (215) [2025-03-17 19:52:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 917 transitions. [2025-03-17 19:52:42,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 774 states and 917 transitions. [2025-03-17 19:52:42,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 19:52:42,585 INFO L432 stractBuchiCegarLoop]: Abstraction has 774 states and 917 transitions. [2025-03-17 19:52:42,585 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-17 19:52:42,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 774 states and 917 transitions. [2025-03-17 19:52:42,586 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2025-03-17 19:52:42,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:42,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:42,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [29, 29, 21, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 19:52:42,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 10, 6, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:52:42,589 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:42,589 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);" "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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:42,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:42,590 INFO L85 PathProgramCache]: Analyzing trace with hash -218756850, now seen corresponding path program 10 times [2025-03-17 19:52:42,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:42,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122385339] [2025-03-17 19:52:42,591 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:42,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:42,596 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 215 statements into 2 equivalence classes. [2025-03-17 19:52:42,604 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 19:52:42,604 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:42,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2140 backedges. 205 proven. 161 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2025-03-17 19:52:42,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:42,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122385339] [2025-03-17 19:52:42,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122385339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:42,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604967244] [2025-03-17 19:52:42,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:42,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:42,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:42,758 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:42,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2025-03-17 19:52:42,814 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 215 statements into 2 equivalence classes. [2025-03-17 19:52:42,851 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 19:52:42,852 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:52:42,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:42,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:52:42,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2140 backedges. 205 proven. 161 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2025-03-17 19:52:42,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2140 backedges. 205 proven. 161 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2025-03-17 19:52:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604967244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:43,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:43,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2025-03-17 19:52:43,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181996824] [2025-03-17 19:52:43,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:43,218 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:43,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:43,218 INFO L85 PathProgramCache]: Analyzing trace with hash -967297126, now seen corresponding path program 3 times [2025-03-17 19:52:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:43,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456901812] [2025-03-17 19:52:43,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:43,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:43,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 84 statements into 10 equivalence classes. [2025-03-17 19:52:43,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:43,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-17 19:52:43,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:43,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:43,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:43,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:43,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:43,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:43,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:44,028 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:44,028 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:44,028 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:44,028 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:44,028 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:44,028 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:44,028 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:44,028 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:44,028 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration25_Loop [2025-03-17 19:52:44,028 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:44,029 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:44,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:44,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:44,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:44,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:44,058 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:44,059 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:44,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:44,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:44,061 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:44,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-03-17 19:52:44,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:44,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:44,083 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:44,083 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=3} Honda state: {ULTIMATE.start_main_~x~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:44,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-03-17 19:52:44,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:44,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:44,093 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:44,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-03-17 19:52:44,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:44,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:44,106 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:44,106 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=3} Honda state: {ULTIMATE.start_main_~p~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:44,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-03-17 19:52:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:44,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:44,115 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:44,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-03-17 19:52:44,118 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:44,118 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:44,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:44,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:44,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:44,144 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:44,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-03-17 19:52:44,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:44,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:44,158 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:44,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-03-17 19:52:44,165 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:44,165 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:44,165 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:44,165 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:44,166 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:44,166 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:44,166 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:44,166 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:44,166 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration25_Loop [2025-03-17 19:52:44,166 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:44,166 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:44,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:44,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:44,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:44,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:44,195 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:44,195 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:44,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:44,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:44,197 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:44,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-03-17 19:52:44,200 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-03-17 19:52:44,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:44,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:44,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:44,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:44,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:44,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:44,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:44,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:44,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:44,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:44,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:44,220 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:44,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-03-17 19:52:44,223 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-03-17 19:52:44,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:44,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:44,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:44,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:44,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:44,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:44,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:44,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:44,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:44,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:44,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:44,243 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:44,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-03-17 19:52:44,247 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-03-17 19:52:44,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:44,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:44,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:44,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:44,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:44,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:44,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:44,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:44,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-03-17 19:52:44,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:44,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:44,268 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:44,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-03-17 19:52:44,269 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-03-17 19:52:44,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:44,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:44,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:44,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:44,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:44,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:44,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:44,281 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:44,283 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:44,283 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:52:44,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:44,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:44,285 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:44,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-03-17 19:52:44,286 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:44,286 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:44,286 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:44,287 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1) = -2*ULTIMATE.start_main_~q~0#1 + 5 Supporting invariants [] [2025-03-17 19:52:44,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2025-03-17 19:52:44,292 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:44,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:44,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 19:52:44,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 19:52:44,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:44,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:44,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-17 19:52:44,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:44,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2025-03-17 19:52:45,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:45,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:45,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:45,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:45,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 19:52:45,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 65 proven. 178 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-17 19:52:45,526 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 16 loop predicates [2025-03-17 19:52:45,526 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 774 states and 917 transitions. cyclomatic complexity: 154 Second operand has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 9 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-17 19:52:45,589 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 774 states and 917 transitions. cyclomatic complexity: 154. Second operand has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 9 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) Result 803 states and 949 transitions. Complement of second has 17 states. [2025-03-17 19:52:45,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 9 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-17 19:52:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-03-17 19:52:45,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 215 letters. Loop has 84 letters. [2025-03-17 19:52:45,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:45,590 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:45,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:45,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 19:52:45,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 19:52:45,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:45,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:45,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-17 19:52:45,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:46,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:46,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:46,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:46,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:46,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 19:52:46,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 65 proven. 178 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-17 19:52:46,957 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 16 loop predicates [2025-03-17 19:52:46,957 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 774 states and 917 transitions. cyclomatic complexity: 154 Second operand has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 9 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-17 19:52:47,017 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 774 states and 917 transitions. cyclomatic complexity: 154. Second operand has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 9 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) Result 803 states and 949 transitions. Complement of second has 17 states. [2025-03-17 19:52:47,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 9 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-17 19:52:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-03-17 19:52:47,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 215 letters. Loop has 84 letters. [2025-03-17 19:52:47,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:47,018 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:47,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:47,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 19:52:47,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 19:52:47,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:47,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:47,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-17 19:52:47,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:47,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 19:52:48,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 19:52:48,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:48,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:48,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 19:52:48,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 65 proven. 178 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-17 19:52:48,345 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 16 loop predicates [2025-03-17 19:52:48,345 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 774 states and 917 transitions. cyclomatic complexity: 154 Second operand has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 9 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-17 19:52:48,957 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 774 states and 917 transitions. cyclomatic complexity: 154. Second operand has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 9 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) Result 1699 states and 2140 transitions. Complement of second has 121 states. [2025-03-17 19:52:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 2 stem states 18 non-accepting loop states 1 accepting loop states [2025-03-17 19:52:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 9 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-17 19:52:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 101 transitions. [2025-03-17 19:52:48,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 101 transitions. Stem has 215 letters. Loop has 84 letters. [2025-03-17 19:52:48,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:48,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 101 transitions. Stem has 299 letters. Loop has 84 letters. [2025-03-17 19:52:48,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:48,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 101 transitions. Stem has 215 letters. Loop has 168 letters. [2025-03-17 19:52:48,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:48,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1699 states and 2140 transitions. [2025-03-17 19:52:48,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2025-03-17 19:52:48,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1699 states to 1094 states and 1363 transitions. [2025-03-17 19:52:48,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2025-03-17 19:52:48,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2025-03-17 19:52:48,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1094 states and 1363 transitions. [2025-03-17 19:52:48,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:48,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1094 states and 1363 transitions. [2025-03-17 19:52:48,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states and 1363 transitions. [2025-03-17 19:52:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1001. [2025-03-17 19:52:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 690 states have (on average 1.0434782608695652) internal successors, (720), 698 states have internal predecessors, (720), 184 states have call successors, (198), 112 states have call predecessors, (198), 127 states have return successors, (262), 190 states have call predecessors, (262), 184 states have call successors, (262) [2025-03-17 19:52:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1180 transitions. [2025-03-17 19:52:48,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1001 states and 1180 transitions. [2025-03-17 19:52:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:48,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:52:48,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:52:48,983 INFO L87 Difference]: Start difference. First operand 1001 states and 1180 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 14 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 10 states have call predecessors, (16), 14 states have call successors, (16) [2025-03-17 19:52:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:49,247 INFO L93 Difference]: Finished difference Result 1066 states and 1301 transitions. [2025-03-17 19:52:49,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1066 states and 1301 transitions. [2025-03-17 19:52:49,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2025-03-17 19:52:49,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1066 states to 1040 states and 1263 transitions. [2025-03-17 19:52:49,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2025-03-17 19:52:49,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207 [2025-03-17 19:52:49,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1040 states and 1263 transitions. [2025-03-17 19:52:49,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:49,253 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1040 states and 1263 transitions. [2025-03-17 19:52:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states and 1263 transitions. [2025-03-17 19:52:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1007. [2025-03-17 19:52:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 696 states have (on average 1.0517241379310345) internal successors, (732), 699 states have internal predecessors, (732), 184 states have call successors, (195), 112 states have call predecessors, (195), 127 states have return successors, (258), 195 states have call predecessors, (258), 184 states have call successors, (258) [2025-03-17 19:52:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1185 transitions. [2025-03-17 19:52:49,262 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1007 states and 1185 transitions. [2025-03-17 19:52:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 19:52:49,263 INFO L432 stractBuchiCegarLoop]: Abstraction has 1007 states and 1185 transitions. [2025-03-17 19:52:49,263 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-03-17 19:52:49,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1007 states and 1185 transitions. [2025-03-17 19:52:49,264 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2025-03-17 19:52:49,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:49,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:49,266 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] [2025-03-17 19:52:49,266 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [35, 35, 29, 17, 14, 14, 14, 14, 14, 14, 12, 6, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1] [2025-03-17 19:52:49,267 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:49,267 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:49,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1642468815, now seen corresponding path program 11 times [2025-03-17 19:52:49,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:49,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820140923] [2025-03-17 19:52:49,267 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:52:49,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:49,273 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 269 statements into 12 equivalence classes. [2025-03-17 19:52:49,310 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 19:52:49,310 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-17 19:52:49,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:49,311 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:49,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 19:52:49,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 19:52:49,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:49,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:49,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:49,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1734600363, now seen corresponding path program 7 times [2025-03-17 19:52:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:49,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133672237] [2025-03-17 19:52:49,362 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:49,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 19:52:49,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 19:52:49,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:49,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 151 proven. 531 refuted. 0 times theorem prover too weak. 2541 trivial. 0 not checked. [2025-03-17 19:52:49,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:49,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133672237] [2025-03-17 19:52:49,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133672237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:49,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295791605] [2025-03-17 19:52:49,628 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:49,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:49,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:49,631 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:49,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2025-03-17 19:52:49,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 19:52:49,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 19:52:49,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:49,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:49,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 19:52:49,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 151 proven. 531 refuted. 0 times theorem prover too weak. 2541 trivial. 0 not checked. [2025-03-17 19:52:49,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 151 proven. 537 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2025-03-17 19:52:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295791605] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:50,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:50,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 24 [2025-03-17 19:52:50,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92640229] [2025-03-17 19:52:50,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:50,304 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:50,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 19:52:50,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2025-03-17 19:52:50,305 INFO L87 Difference]: Start difference. First operand 1007 states and 1185 transitions. cyclomatic complexity: 194 Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 22 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (21), 11 states have call predecessors, (21), 15 states have call successors, (21) [2025-03-17 19:52:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:50,721 INFO L93 Difference]: Finished difference Result 1130 states and 1375 transitions. [2025-03-17 19:52:50,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1130 states and 1375 transitions. [2025-03-17 19:52:50,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2025-03-17 19:52:50,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1130 states to 1122 states and 1359 transitions. [2025-03-17 19:52:50,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2025-03-17 19:52:50,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 204 [2025-03-17 19:52:50,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1122 states and 1359 transitions. [2025-03-17 19:52:50,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:50,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1122 states and 1359 transitions. [2025-03-17 19:52:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states and 1359 transitions. [2025-03-17 19:52:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1075. [2025-03-17 19:52:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 740 states have (on average 1.0567567567567568) internal successors, (782), 748 states have internal predecessors, (782), 203 states have call successors, (214), 116 states have call predecessors, (214), 132 states have return successors, (307), 210 states have call predecessors, (307), 203 states have call successors, (307) [2025-03-17 19:52:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1303 transitions. [2025-03-17 19:52:50,738 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1075 states and 1303 transitions. [2025-03-17 19:52:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 19:52:50,739 INFO L432 stractBuchiCegarLoop]: Abstraction has 1075 states and 1303 transitions. [2025-03-17 19:52:50,739 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-03-17 19:52:50,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1075 states and 1303 transitions. [2025-03-17 19:52:50,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 68 [2025-03-17 19:52:50,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:50,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:50,742 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] [2025-03-17 19:52:50,742 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [33, 33, 27, 16, 13, 13, 13, 13, 13, 13, 11, 6, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1] [2025-03-17 19:52:50,742 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:50,742 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:50,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1642468815, now seen corresponding path program 12 times [2025-03-17 19:52:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:50,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874321464] [2025-03-17 19:52:50,743 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:52:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:50,748 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 269 statements into 12 equivalence classes. [2025-03-17 19:52:50,770 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 19:52:50,770 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-17 19:52:50,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:50,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:50,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 19:52:50,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 19:52:50,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:50,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:50,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:50,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:50,817 INFO L85 PathProgramCache]: Analyzing trace with hash -549361959, now seen corresponding path program 8 times [2025-03-17 19:52:50,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:50,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096918305] [2025-03-17 19:52:50,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:50,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 234 statements into 2 equivalence classes. [2025-03-17 19:52:50,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 234 of 234 statements. [2025-03-17 19:52:50,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:50,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2845 backedges. 88 proven. 639 refuted. 0 times theorem prover too weak. 2118 trivial. 0 not checked. [2025-03-17 19:52:51,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:51,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096918305] [2025-03-17 19:52:51,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096918305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:51,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977291762] [2025-03-17 19:52:51,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:51,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:51,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:51,179 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:51,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2025-03-17 19:52:51,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 234 statements into 2 equivalence classes. [2025-03-17 19:52:51,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 234 of 234 statements. [2025-03-17 19:52:51,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:51,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:51,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 19:52:51,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2845 backedges. 1541 proven. 273 refuted. 0 times theorem prover too weak. 1031 trivial. 0 not checked. [2025-03-17 19:52:51,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2845 backedges. 87 proven. 640 refuted. 0 times theorem prover too weak. 2118 trivial. 0 not checked. [2025-03-17 19:52:51,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977291762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:51,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:51,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 28 [2025-03-17 19:52:51,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330714986] [2025-03-17 19:52:51,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:51,896 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:51,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:52:51,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2025-03-17 19:52:51,897 INFO L87 Difference]: Start difference. First operand 1075 states and 1303 transitions. cyclomatic complexity: 244 Second operand has 28 states, 26 states have (on average 3.269230769230769) internal successors, (85), 24 states have internal predecessors, (85), 21 states have call successors, (27), 2 states have call predecessors, (27), 8 states have return successors, (30), 12 states have call predecessors, (30), 21 states have call successors, (30) [2025-03-17 19:52:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:52,451 INFO L93 Difference]: Finished difference Result 1210 states and 1511 transitions. [2025-03-17 19:52:52,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1210 states and 1511 transitions. [2025-03-17 19:52:52,455 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 92 [2025-03-17 19:52:52,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1210 states to 1204 states and 1502 transitions. [2025-03-17 19:52:52,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2025-03-17 19:52:52,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2025-03-17 19:52:52,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1204 states and 1502 transitions. [2025-03-17 19:52:52,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:52,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1204 states and 1502 transitions. [2025-03-17 19:52:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states and 1502 transitions. [2025-03-17 19:52:52,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1088. [2025-03-17 19:52:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 746 states have (on average 1.0576407506702412) internal successors, (789), 763 states have internal predecessors, (789), 208 states have call successors, (222), 122 states have call predecessors, (222), 134 states have return successors, (312), 202 states have call predecessors, (312), 208 states have call successors, (312) [2025-03-17 19:52:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1323 transitions. [2025-03-17 19:52:52,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1088 states and 1323 transitions. [2025-03-17 19:52:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 19:52:52,468 INFO L432 stractBuchiCegarLoop]: Abstraction has 1088 states and 1323 transitions. [2025-03-17 19:52:52,468 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-03-17 19:52:52,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1088 states and 1323 transitions. [2025-03-17 19:52:52,470 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2025-03-17 19:52:52,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:52,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:52,471 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] [2025-03-17 19:52:52,471 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [47, 47, 39, 23, 19, 19, 19, 19, 19, 19, 16, 8, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1] [2025-03-17 19:52:52,472 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:52,472 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:52:52,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1642468815, now seen corresponding path program 13 times [2025-03-17 19:52:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280703153] [2025-03-17 19:52:52,472 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 19:52:52,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:52,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 19:52:52,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 19:52:52,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:52,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-17 19:52:52,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-17 19:52:52,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:52,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:52,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:52,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:52,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1723210340, now seen corresponding path program 9 times [2025-03-17 19:52:52,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:52,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600215952] [2025-03-17 19:52:52,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:52,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:52,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 332 statements into 12 equivalence classes. [2025-03-17 19:52:52,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 273 of 332 statements. [2025-03-17 19:52:52,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-17 19:52:52,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5878 backedges. 402 proven. 254 refuted. 0 times theorem prover too weak. 5222 trivial. 0 not checked. [2025-03-17 19:52:52,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:52,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600215952] [2025-03-17 19:52:52,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600215952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:52,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048773920] [2025-03-17 19:52:52,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:52:52,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:52,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:52,776 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:52,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2025-03-17 19:52:52,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 332 statements into 12 equivalence classes. [2025-03-17 19:52:52,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 273 of 332 statements. [2025-03-17 19:52:52,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-17 19:52:52,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:52,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:52:52,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5878 backedges. 401 proven. 255 refuted. 0 times theorem prover too weak. 5222 trivial. 0 not checked. [2025-03-17 19:52:52,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5878 backedges. 401 proven. 255 refuted. 0 times theorem prover too weak. 5222 trivial. 0 not checked. [2025-03-17 19:52:53,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048773920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:53,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:53,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2025-03-17 19:52:53,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761824166] [2025-03-17 19:52:53,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:53,318 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:52:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:52:53,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 19:52:53,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-17 19:52:53,319 INFO L87 Difference]: Start difference. First operand 1088 states and 1323 transitions. cyclomatic complexity: 250 Second operand has 17 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 10 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-17 19:52:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:52:53,459 INFO L93 Difference]: Finished difference Result 1106 states and 1335 transitions. [2025-03-17 19:52:53,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1106 states and 1335 transitions. [2025-03-17 19:52:53,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2025-03-17 19:52:53,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1106 states to 1018 states and 1168 transitions. [2025-03-17 19:52:53,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 185 [2025-03-17 19:52:53,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2025-03-17 19:52:53,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1018 states and 1168 transitions. [2025-03-17 19:52:53,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:52:53,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1018 states and 1168 transitions. [2025-03-17 19:52:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states and 1168 transitions. [2025-03-17 19:52:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1001. [2025-03-17 19:52:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 688 states have (on average 1.0465116279069768) internal successors, (720), 702 states have internal predecessors, (720), 179 states have call successors, (183), 122 states have call predecessors, (183), 134 states have return successors, (243), 176 states have call predecessors, (243), 179 states have call successors, (243) [2025-03-17 19:52:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1146 transitions. [2025-03-17 19:52:53,471 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1001 states and 1146 transitions. [2025-03-17 19:52:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:52:53,471 INFO L432 stractBuchiCegarLoop]: Abstraction has 1001 states and 1146 transitions. [2025-03-17 19:52:53,471 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-03-17 19:52:53,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1001 states and 1146 transitions. [2025-03-17 19:52:53,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2025-03-17 19:52:53,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:52:53,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:52:53,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [61, 61, 44, 26, 21, 21, 21, 21, 21, 21, 18, 17, 15, 14, 14, 14, 5, 5, 5, 5, 3, 2, 1, 1, 1] [2025-03-17 19:52:53,474 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 8, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 19:52:53,474 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:52:53,474 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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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-03-17 19:52:53,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1517178944, now seen corresponding path program 14 times [2025-03-17 19:52:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:53,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878270748] [2025-03-17 19:52:53,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:53,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 438 statements into 2 equivalence classes. [2025-03-17 19:52:53,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 438 of 438 statements. [2025-03-17 19:52:53,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:53,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9562 backedges. 191 proven. 79 refuted. 0 times theorem prover too weak. 9292 trivial. 0 not checked. [2025-03-17 19:52:53,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:52:53,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878270748] [2025-03-17 19:52:53,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878270748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:52:53,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216964946] [2025-03-17 19:52:53,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:52:53,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:52:53,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:53,812 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:52:53,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2025-03-17 19:52:53,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 438 statements into 2 equivalence classes. [2025-03-17 19:52:53,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 438 of 438 statements. [2025-03-17 19:52:53,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:52:53,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:53,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:52:53,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9562 backedges. 3665 proven. 79 refuted. 0 times theorem prover too weak. 5818 trivial. 0 not checked. [2025-03-17 19:52:54,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:52:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9562 backedges. 191 proven. 79 refuted. 0 times theorem prover too weak. 9292 trivial. 0 not checked. [2025-03-17 19:52:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216964946] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:52:54,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:52:54,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-17 19:52:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226643916] [2025-03-17 19:52:54,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:52:54,455 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:52:54,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash -122052749, now seen corresponding path program 4 times [2025-03-17 19:52:54,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:52:54,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256008260] [2025-03-17 19:52:54,456 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:52:54,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:52:54,459 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 105 statements into 2 equivalence classes. [2025-03-17 19:52:54,462 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:52:54,463 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:52:54,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:52:54,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:52:54,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:52:54,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:54,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:52:54,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:52:55,306 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:55,306 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:55,306 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:55,307 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:55,307 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:52:55,307 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,307 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:55,307 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:55,307 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration29_Loop [2025-03-17 19:52:55,307 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:55,307 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:55,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,329 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:55,329 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:52:55,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,331 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-03-17 19:52:55,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:55,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,344 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:52:55,344 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=3} Honda state: {ULTIMATE.start_main_~p~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:52:55,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-03-17 19:52:55,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,351 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-03-17 19:52:55,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:52:55,353 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-03-17 19:52:55,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,371 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-03-17 19:52:55,374 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:52:55,374 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:52:55,405 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:52:55,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2025-03-17 19:52:55,409 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:52:55,409 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:52:55,409 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:52:55,409 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:52:55,409 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:52:55,409 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,409 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:52:55,409 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:52:55,409 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration29_Loop [2025-03-17 19:52:55,409 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:52:55,409 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:52:55,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:52:55,430 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:52:55,430 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:52:55,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,432 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-03-17 19:52:55,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-03-17 19:52:55,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2025-03-17 19:52:55,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,452 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-03-17 19:52:55,454 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-03-17 19:52:55,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:52:55,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-03-17 19:52:55,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,472 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-03-17 19:52:55,473 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-03-17 19:52:55,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:52:55,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:52:55,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:52:55,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:52:55,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:52:55,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:52:55,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:52:55,485 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:52:55,486 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:52:55,486 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:52:55,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:52:55,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:52:55,488 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:52:55,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-03-17 19:52:55,490 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:52:55,490 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:52:55,490 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:52:55,490 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-03-17 19:52:55,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-03-17 19:52:55,495 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:52:55,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:55,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-17 19:52:55,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-17 19:52:55,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:55,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:55,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-03-17 19:52:55,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:55,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-03-17 19:52:57,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:52:57,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:52:57,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:57,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:57,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:52:57,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 19:52:57,695 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-03-17 19:52:57,695 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1001 states and 1146 transitions. cyclomatic complexity: 154 Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-03-17 19:52:57,712 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1001 states and 1146 transitions. cyclomatic complexity: 154. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 1025 states and 1172 transitions. Complement of second has 9 states. [2025-03-17 19:52:57,713 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-03-17 19:52:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-03-17 19:52:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-17 19:52:57,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 438 letters. Loop has 105 letters. [2025-03-17 19:52:57,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:57,713 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:57,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:57,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-17 19:52:57,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-17 19:52:57,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:57,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:57,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-03-17 19:52:57,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:59,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:52:59,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:52:59,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:52:59,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:52:59,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:52:59,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:52:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 19:52:59,877 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-03-17 19:52:59,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1001 states and 1146 transitions. cyclomatic complexity: 154 Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-03-17 19:52:59,891 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1001 states and 1146 transitions. cyclomatic complexity: 154. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 1025 states and 1172 transitions. Complement of second has 9 states. [2025-03-17 19:52:59,891 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-03-17 19:52:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-03-17 19:52:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-17 19:52:59,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 438 letters. Loop has 105 letters. [2025-03-17 19:52:59,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:52:59,892 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:52:59,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:52:59,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-17 19:53:00,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-17 19:53:00,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:00,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:00,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-03-17 19:53:00,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:01,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:53:01,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:53:01,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:01,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:01,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:53:01,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 19:53:01,996 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-03-17 19:53:01,996 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1001 states and 1146 transitions. cyclomatic complexity: 154 Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-03-17 19:53:02,046 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1001 states and 1146 transitions. cyclomatic complexity: 154. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 1954 states and 2232 transitions. Complement of second has 10 states. [2025-03-17 19:53:02,046 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-03-17 19:53:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-03-17 19:53:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2025-03-17 19:53:02,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 438 letters. Loop has 105 letters. [2025-03-17 19:53:02,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:02,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 543 letters. Loop has 105 letters. [2025-03-17 19:53:02,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:02,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 438 letters. Loop has 210 letters. [2025-03-17 19:53:02,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:02,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1954 states and 2232 transitions. [2025-03-17 19:53:02,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2025-03-17 19:53:02,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1954 states to 1001 states and 1146 transitions. [2025-03-17 19:53:02,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2025-03-17 19:53:02,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2025-03-17 19:53:02,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1001 states and 1146 transitions. [2025-03-17 19:53:02,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:02,056 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1001 states and 1146 transitions. [2025-03-17 19:53:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states and 1146 transitions. [2025-03-17 19:53:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2025-03-17 19:53:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 688 states have (on average 1.0465116279069768) internal successors, (720), 702 states have internal predecessors, (720), 179 states have call successors, (183), 122 states have call predecessors, (183), 134 states have return successors, (243), 176 states have call predecessors, (243), 179 states have call successors, (243) [2025-03-17 19:53:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1146 transitions. [2025-03-17 19:53:02,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1001 states and 1146 transitions. [2025-03-17 19:53:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:02,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:53:02,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:53:02,063 INFO L87 Difference]: Start difference. First operand 1001 states and 1146 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 14 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-17 19:53:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:02,128 INFO L93 Difference]: Finished difference Result 1047 states and 1216 transitions. [2025-03-17 19:53:02,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1047 states and 1216 transitions. [2025-03-17 19:53:02,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2025-03-17 19:53:02,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1047 states to 1031 states and 1195 transitions. [2025-03-17 19:53:02,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2025-03-17 19:53:02,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2025-03-17 19:53:02,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1031 states and 1195 transitions. [2025-03-17 19:53:02,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:02,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1031 states and 1195 transitions. [2025-03-17 19:53:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states and 1195 transitions. [2025-03-17 19:53:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1004. [2025-03-17 19:53:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 690 states have (on average 1.046376811594203) internal successors, (722), 704 states have internal predecessors, (722), 180 states have call successors, (184), 122 states have call predecessors, (184), 134 states have return successors, (244), 177 states have call predecessors, (244), 180 states have call successors, (244) [2025-03-17 19:53:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1150 transitions. [2025-03-17 19:53:02,140 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1004 states and 1150 transitions. [2025-03-17 19:53:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 19:53:02,140 INFO L432 stractBuchiCegarLoop]: Abstraction has 1004 states and 1150 transitions. [2025-03-17 19:53:02,140 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-03-17 19:53:02,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1004 states and 1150 transitions. [2025-03-17 19:53:02,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2025-03-17 19:53:02,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:02,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:02,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [58, 58, 40, 24, 18, 18, 18, 18, 18, 18, 18, 16, 16, 16, 16, 15, 6, 6, 6, 6, 3, 2, 1, 1, 1] [2025-03-17 19:53:02,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [53, 53, 42, 25, 22, 22, 22, 22, 22, 22, 17, 11, 6, 6, 6, 6, 3, 3, 3, 3, 1, 1] [2025-03-17 19:53:02,143 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:53:02,144 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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#return;" [2025-03-17 19:53:02,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash 752354027, now seen corresponding path program 15 times [2025-03-17 19:53:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:02,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048293877] [2025-03-17 19:53:02,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:02,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:02,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 417 statements into 14 equivalence classes. [2025-03-17 19:53:02,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 339 of 417 statements. [2025-03-17 19:53:02,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-17 19:53:02,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8538 backedges. 287 proven. 519 refuted. 0 times theorem prover too weak. 7732 trivial. 0 not checked. [2025-03-17 19:53:02,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048293877] [2025-03-17 19:53:02,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048293877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960121123] [2025-03-17 19:53:02,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:02,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:02,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:02,477 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:02,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2025-03-17 19:53:02,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 417 statements into 14 equivalence classes. [2025-03-17 19:53:02,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 339 of 417 statements. [2025-03-17 19:53:02,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-17 19:53:02,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:02,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:53:02,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8538 backedges. 2277 proven. 266 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-17 19:53:02,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8538 backedges. 248 proven. 296 refuted. 0 times theorem prover too weak. 7994 trivial. 0 not checked. [2025-03-17 19:53:03,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960121123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:03,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:03,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 26 [2025-03-17 19:53:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724449096] [2025-03-17 19:53:03,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:03,135 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:03,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash 555382070, now seen corresponding path program 10 times [2025-03-17 19:53:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:03,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653540387] [2025-03-17 19:53:03,136 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:03,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:03,142 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 371 statements into 2 equivalence classes. [2025-03-17 19:53:03,158 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-17 19:53:03,159 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:53:03,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7423 backedges. 159 proven. 1109 refuted. 0 times theorem prover too weak. 6155 trivial. 0 not checked. [2025-03-17 19:53:03,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653540387] [2025-03-17 19:53:03,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653540387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463575257] [2025-03-17 19:53:03,503 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:03,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:03,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:03,505 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:03,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2025-03-17 19:53:03,577 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 371 statements into 2 equivalence classes. [2025-03-17 19:53:03,640 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-17 19:53:03,640 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:53:03,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:03,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 19:53:03,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7423 backedges. 3437 proven. 249 refuted. 0 times theorem prover too weak. 3737 trivial. 0 not checked. [2025-03-17 19:53:03,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7423 backedges. 156 proven. 1367 refuted. 0 times theorem prover too weak. 5900 trivial. 0 not checked. [2025-03-17 19:53:04,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463575257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:04,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:04,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 21] total 30 [2025-03-17 19:53:04,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156641466] [2025-03-17 19:53:04,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:04,576 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:04,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 19:53:04,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2025-03-17 19:53:04,577 INFO L87 Difference]: Start difference. First operand 1004 states and 1150 transitions. cyclomatic complexity: 155 Second operand has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 28 states have internal predecessors, (85), 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-03-17 19:53:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:05,246 INFO L93 Difference]: Finished difference Result 1133 states and 1318 transitions. [2025-03-17 19:53:05,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1133 states and 1318 transitions. [2025-03-17 19:53:05,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2025-03-17 19:53:05,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1133 states to 1060 states and 1226 transitions. [2025-03-17 19:53:05,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2025-03-17 19:53:05,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2025-03-17 19:53:05,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1060 states and 1226 transitions. [2025-03-17 19:53:05,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:05,251 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1060 states and 1226 transitions. [2025-03-17 19:53:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states and 1226 transitions. [2025-03-17 19:53:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 945. [2025-03-17 19:53:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 650 states have (on average 1.04) internal successors, (676), 664 states have internal predecessors, (676), 165 states have call successors, (169), 116 states have call predecessors, (169), 130 states have return successors, (222), 164 states have call predecessors, (222), 165 states have call successors, (222) [2025-03-17 19:53:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1067 transitions. [2025-03-17 19:53:05,259 INFO L240 hiAutomatonCegarLoop]: Abstraction has 945 states and 1067 transitions. [2025-03-17 19:53:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-17 19:53:05,259 INFO L432 stractBuchiCegarLoop]: Abstraction has 945 states and 1067 transitions. [2025-03-17 19:53:05,260 INFO L338 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-03-17 19:53:05,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 945 states and 1067 transitions. [2025-03-17 19:53:05,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2025-03-17 19:53:05,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:05,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:05,262 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [62, 62, 44, 26, 21, 21, 21, 21, 21, 21, 18, 18, 16, 15, 15, 15, 5, 5, 5, 5, 3, 2, 1, 1, 1] [2025-03-17 19:53:05,262 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 7, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:53:05,262 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:53:05,263 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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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-03-17 19:53:05,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash -215435274, now seen corresponding path program 16 times [2025-03-17 19:53:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:05,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381290460] [2025-03-17 19:53:05,263 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:05,270 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 445 statements into 2 equivalence classes. [2025-03-17 19:53:05,303 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-17 19:53:05,303 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:53:05,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9851 backedges. 281 proven. 324 refuted. 0 times theorem prover too weak. 9246 trivial. 0 not checked. [2025-03-17 19:53:05,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:05,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381290460] [2025-03-17 19:53:05,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381290460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:05,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887494396] [2025-03-17 19:53:05,537 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:05,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:05,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:05,541 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:05,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2025-03-17 19:53:05,622 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 445 statements into 2 equivalence classes. [2025-03-17 19:53:05,690 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-17 19:53:05,690 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:53:05,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:05,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:53:05,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9851 backedges. 3743 proven. 246 refuted. 0 times theorem prover too weak. 5862 trivial. 0 not checked. [2025-03-17 19:53:05,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9851 backedges. 281 proven. 324 refuted. 0 times theorem prover too weak. 9246 trivial. 0 not checked. [2025-03-17 19:53:06,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887494396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:06,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:06,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-17 19:53:06,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049197797] [2025-03-17 19:53:06,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:06,237 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:06,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2003840549, now seen corresponding path program 5 times [2025-03-17 19:53:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:06,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223661661] [2025-03-17 19:53:06,237 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:53:06,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:06,240 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 97 statements into 14 equivalence classes. [2025-03-17 19:53:06,244 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 19:53:06,245 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-17 19:53:06,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:06,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:06,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 19:53:06,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 19:53:06,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:06,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:06,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:06,957 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:06,957 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:06,957 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:06,957 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:06,957 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:06,957 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:06,957 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:06,957 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:06,957 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration31_Loop [2025-03-17 19:53:06,957 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:06,957 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:06,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:06,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:06,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:06,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:06,980 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:06,980 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:06,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:06,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:06,982 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:06,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-03-17 19:53:06,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:06,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:06,995 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:06,995 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-03-17 19:53:07,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-03-17 19:53:07,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:07,003 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:07,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-03-17 19:53:07,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:07,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:07,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-03-17 19:53:07,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:07,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:07,022 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:07,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-03-17 19:53:07,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:07,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:07,035 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:07,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:07,041 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:07,041 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:07,041 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:07,041 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:07,041 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:07,041 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:07,041 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:07,041 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:07,041 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration31_Loop [2025-03-17 19:53:07,041 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:07,041 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:07,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:07,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:07,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:07,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:07,064 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:07,065 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:07,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:07,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:07,067 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:07,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-03-17 19:53:07,068 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-03-17 19:53:07,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:07,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:07,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:07,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:07,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:07,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:07,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:07,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:07,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:07,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:07,086 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:07,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-03-17 19:53:07,087 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-03-17 19:53:07,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:07,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:07,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:07,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:07,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:07,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:07,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:07,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:07,100 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:07,100 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:07,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:07,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:07,103 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:07,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-03-17 19:53:07,104 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:07,104 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:07,104 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:07,104 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1) = -2*ULTIMATE.start_main_~q~0#1 + 7 Supporting invariants [] [2025-03-17 19:53:07,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-03-17 19:53:07,110 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:07,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:07,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-17 19:53:07,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-17 19:53:07,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:07,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-17 19:53:07,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 19:53:09,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 19:53:09,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 125 proven. 157 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-03-17 19:53:09,771 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 15 loop predicates [2025-03-17 19:53:09,771 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 945 states and 1067 transitions. cyclomatic complexity: 130 Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 19:53:09,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 945 states and 1067 transitions. cyclomatic complexity: 130. Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) Result 975 states and 1100 transitions. Complement of second has 17 states. [2025-03-17 19:53:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 19:53:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-03-17 19:53:09,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 445 letters. Loop has 97 letters. [2025-03-17 19:53:09,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,831 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:53:09,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-17 19:53:10,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-17 19:53:10,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:11,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 19:53:11,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 19:53:11,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:11,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 19:53:11,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 125 proven. 157 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-03-17 19:53:12,208 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 15 loop predicates [2025-03-17 19:53:12,209 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 945 states and 1067 transitions. cyclomatic complexity: 130 Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 19:53:12,267 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 945 states and 1067 transitions. cyclomatic complexity: 130. Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) Result 975 states and 1100 transitions. Complement of second has 17 states. [2025-03-17 19:53:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 19:53:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-03-17 19:53:12,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 445 letters. Loop has 97 letters. [2025-03-17 19:53:12,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:12,268 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:53:12,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:12,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-17 19:53:12,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-17 19:53:12,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:12,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:12,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-17 19:53:12,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:14,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 19:53:14,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 19:53:14,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:14,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:14,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 19:53:14,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 125 proven. 157 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-03-17 19:53:14,723 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 15 loop predicates [2025-03-17 19:53:14,723 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 945 states and 1067 transitions. cyclomatic complexity: 130 Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 19:53:15,252 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 945 states and 1067 transitions. cyclomatic complexity: 130. Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) Result 2064 states and 2375 transitions. Complement of second has 117 states. [2025-03-17 19:53:15,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 2 stem states 17 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 19:53:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 92 transitions. [2025-03-17 19:53:15,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 92 transitions. Stem has 445 letters. Loop has 97 letters. [2025-03-17 19:53:15,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:15,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 92 transitions. Stem has 542 letters. Loop has 97 letters. [2025-03-17 19:53:15,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:15,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 92 transitions. Stem has 445 letters. Loop has 194 letters. [2025-03-17 19:53:15,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:15,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2064 states and 2375 transitions. [2025-03-17 19:53:15,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2025-03-17 19:53:15,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2064 states to 1212 states and 1387 transitions. [2025-03-17 19:53:15,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2025-03-17 19:53:15,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2025-03-17 19:53:15,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1212 states and 1387 transitions. [2025-03-17 19:53:15,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:15,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1212 states and 1387 transitions. [2025-03-17 19:53:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states and 1387 transitions. [2025-03-17 19:53:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1136. [2025-03-17 19:53:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 780 states have (on average 1.0474358974358975) internal successors, (817), 797 states have internal predecessors, (817), 200 states have call successors, (204), 140 states have call predecessors, (204), 156 states have return successors, (262), 198 states have call predecessors, (262), 200 states have call successors, (262) [2025-03-17 19:53:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1283 transitions. [2025-03-17 19:53:15,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1136 states and 1283 transitions. [2025-03-17 19:53:15,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:15,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 19:53:15,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-17 19:53:15,273 INFO L87 Difference]: Start difference. First operand 1136 states and 1283 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 13 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 11 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-17 19:53:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:15,454 INFO L93 Difference]: Finished difference Result 1146 states and 1289 transitions. [2025-03-17 19:53:15,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1146 states and 1289 transitions. [2025-03-17 19:53:15,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2025-03-17 19:53:15,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1146 states to 1081 states and 1197 transitions. [2025-03-17 19:53:15,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2025-03-17 19:53:15,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2025-03-17 19:53:15,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1081 states and 1197 transitions. [2025-03-17 19:53:15,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:15,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1081 states and 1197 transitions. [2025-03-17 19:53:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states and 1197 transitions. [2025-03-17 19:53:15,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1064. [2025-03-17 19:53:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 733 states have (on average 1.0368349249658937) internal successors, (760), 747 states have internal predecessors, (760), 183 states have call successors, (187), 133 states have call predecessors, (187), 148 states have return successors, (228), 183 states have call predecessors, (228), 183 states have call successors, (228) [2025-03-17 19:53:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1175 transitions. [2025-03-17 19:53:15,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1064 states and 1175 transitions. [2025-03-17 19:53:15,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 19:53:15,466 INFO L432 stractBuchiCegarLoop]: Abstraction has 1064 states and 1175 transitions. [2025-03-17 19:53:15,466 INFO L338 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2025-03-17 19:53:15,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1064 states and 1175 transitions. [2025-03-17 19:53:15,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2025-03-17 19:53:15,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:15,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:15,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [57, 57, 40, 24, 18, 18, 18, 18, 18, 18, 17, 16, 16, 15, 15, 15, 6, 6, 6, 6, 3, 2, 1, 1, 1] [2025-03-17 19:53:15,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 8, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 19:53:15,469 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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#39#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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-03-17 19:53:15,469 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;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#37#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;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#37#return;" "call #t~ret2 := parts(~p, ~q - 1);"< "~p := #in~p;~q := #in~q;" "assume !(~p <= 0);" "assume ~q <= 0;#res := 0;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#35#return;" "#res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#33#return;" "#res := #t~ret0;havoc #t~ret0;" "assume true;" >"#39#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-03-17 19:53:15,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:15,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1837360129, now seen corresponding path program 17 times [2025-03-17 19:53:15,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:15,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041621142] [2025-03-17 19:53:15,470 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:53:15,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:15,476 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 412 statements into 14 equivalence classes. [2025-03-17 19:53:15,499 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 407 of 412 statements. [2025-03-17 19:53:15,500 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-17 19:53:15,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8295 backedges. 1409 proven. 616 refuted. 0 times theorem prover too weak. 6270 trivial. 0 not checked. [2025-03-17 19:53:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041621142] [2025-03-17 19:53:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041621142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808758358] [2025-03-17 19:53:15,917 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:53:15,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:15,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:15,919 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:15,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2025-03-17 19:53:15,998 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 412 statements into 14 equivalence classes. [2025-03-17 19:53:16,081 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 407 of 412 statements. [2025-03-17 19:53:16,081 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-17 19:53:16,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:16,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 19:53:16,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8295 backedges. 1322 proven. 680 refuted. 0 times theorem prover too weak. 6293 trivial. 0 not checked. [2025-03-17 19:53:16,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8295 backedges. 1318 proven. 694 refuted. 0 times theorem prover too weak. 6283 trivial. 0 not checked. [2025-03-17 19:53:17,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808758358] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:17,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:17,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 20] total 37 [2025-03-17 19:53:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230955011] [2025-03-17 19:53:17,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:17,146 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:17,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash -122052749, now seen corresponding path program 6 times [2025-03-17 19:53:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:17,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866282044] [2025-03-17 19:53:17,146 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:53:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:17,149 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 105 statements into 11 equivalence classes. [2025-03-17 19:53:17,155 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:53:17,156 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-17 19:53:17,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:17,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:17,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:53:17,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:53:17,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:17,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:17,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:17,997 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:17,997 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:17,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:17,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:17,997 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:17,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:17,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:17,997 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:17,997 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration32_Loop [2025-03-17 19:53:17,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:17,997 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:17,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:17,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:18,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:18,018 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:18,019 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:18,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:18,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:18,021 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:18,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-03-17 19:53:18,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:18,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:18,033 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:18,033 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=3} Honda state: {ULTIMATE.start_main_~p~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:18,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-03-17 19:53:18,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:18,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:18,041 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:18,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-03-17 19:53:18,042 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:18,042 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:18,052 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:18,052 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-03-17 19:53:18,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-03-17 19:53:18,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:18,060 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:18,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-03-17 19:53:18,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:18,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:18,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:18,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:18,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:18,079 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:18,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-03-17 19:53:18,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:18,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:18,113 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:18,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-03-17 19:53:18,117 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:18,117 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:18,117 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:18,117 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:18,117 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:18,117 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:18,117 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:18,117 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:18,117 INFO L132 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration32_Loop [2025-03-17 19:53:18,117 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:18,117 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:18,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:18,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:18,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:18,139 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:18,139 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:18,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:18,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:18,141 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:18,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-03-17 19:53:18,143 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-03-17 19:53:18,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:18,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:18,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:18,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:18,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:18,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:18,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:18,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:18,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-03-17 19:53:18,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:18,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:18,162 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:18,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-03-17 19:53:18,163 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-03-17 19:53:18,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:18,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:18,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:18,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:18,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:18,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:18,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:18,175 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:18,178 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 19:53:18,178 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:53:18,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:18,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:18,180 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:18,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-03-17 19:53:18,181 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:18,181 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:18,181 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:18,181 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-03-17 19:53:18,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:18,191 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:18,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:18,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-17 19:53:18,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-17 19:53:18,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:18,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:18,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 2625 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-03-17 19:53:18,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:18,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-03-17 19:53:20,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:53:20,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:53:20,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:20,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:20,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 19:53:20,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 19:53:20,236 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-03-17 19:53:20,236 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1064 states and 1175 transitions. cyclomatic complexity: 119 Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-03-17 19:53:20,253 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1064 states and 1175 transitions. cyclomatic complexity: 119. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 1090 states and 1204 transitions. Complement of second has 9 states. [2025-03-17 19:53:20,253 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-03-17 19:53:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-03-17 19:53:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-17 19:53:20,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 412 letters. Loop has 105 letters. [2025-03-17 19:53:20,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:20,254 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:53:20,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:20,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-17 19:53:20,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-17 19:53:20,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:20,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:20,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 2625 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-03-17 19:53:20,521 INFO L279 TraceCheckSpWp]: Computing forward predicates...