/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/m11.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:44,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:44,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:44,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:44,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:44,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:44,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:44,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:44,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:44,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:44,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:44,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:44,990 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:44,990 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:44,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:44,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:44,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:44,993 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:44,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:44,993 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:44,994 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:44,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:44,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:44,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:44,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:44,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:44,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:44,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:44,994 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:44,994 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:44,994 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:45,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:45,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:45,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:45,239 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:45,240 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:45,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/m11.c.bpl [2025-04-26 16:58:45,243 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/m11.c.bpl' [2025-04-26 16:58:45,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:45,264 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:45,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:45,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:45,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:45,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,303 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:45,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:45,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:45,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:45,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:45,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:45,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:45,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:45,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:45,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/1) ... [2025-04-26 16:58:45,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:45,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:45,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:58:45,387 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:45,388 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:45,388 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:45,388 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:45,388 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:45,388 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:58:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:58:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:58:45,388 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:58:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:58:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:58:45,389 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:58:45,427 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:45,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:45,516 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:45,517 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:45,527 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:45,527 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:45,529 INFO L201 PluginConnector]: Adding new model m11.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:45 BoogieIcfgContainer [2025-04-26 16:58:45,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:45,530 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:45,531 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:45,536 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:45,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:45,536 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m11.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:45" (1/2) ... [2025-04-26 16:58:45,538 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d5947ed and model type m11.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:45, skipping insertion in model container [2025-04-26 16:58:45,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:45,538 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m11.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:45" (2/2) ... [2025-04-26 16:58:45,539 INFO L376 chiAutomizerObserver]: Analyzing ICFG m11.c.bpl [2025-04-26 16:58:45,601 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:58:45,640 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:45,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:45,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:45,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:58:45,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 52 transitions, 146 flow [2025-04-26 16:58:45,740 INFO L116 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-04-26 16:58:45,744 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:58:45,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 40 events. 6/40 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-04-26 16:58:45,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 52 transitions, 146 flow [2025-04-26 16:58:45,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 40 transitions, 116 flow [2025-04-26 16:58:45,756 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 53 places, 40 transitions, 116 flow [2025-04-26 16:58:45,763 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:47,240 WARN L140 AmpleReduction]: Number of pruned transitions: 23308 [2025-04-26 16:58:47,241 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:58:47,241 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 4439 [2025-04-26 16:58:47,241 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:41 [2025-04-26 16:58:47,241 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:5281 [2025-04-26 16:58:47,241 WARN L145 AmpleReduction]: Times succ was already a loop node:12263 [2025-04-26 16:58:47,241 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1683 [2025-04-26 16:58:47,241 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:47,280 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 9762 states, 9761 states have (on average 3.5262780452822455) internal successors, (in total 34420), 9761 states have internal predecessors, (34420), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:47,286 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:47,287 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:47,287 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:47,287 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:47,287 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:47,287 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:47,287 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:47,287 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:47,318 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9762 states, 9761 states have (on average 3.5262780452822455) internal successors, (in total 34420), 9761 states have internal predecessors, (34420), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:47,524 INFO L131 ngComponentsAnalysis]: Automaton has 1738 accepting balls. 8898 [2025-04-26 16:58:47,525 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:47,525 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:47,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:47,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:47,529 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:47,553 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9762 states, 9761 states have (on average 3.5262780452822455) internal successors, (in total 34420), 9761 states have internal predecessors, (34420), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:47,693 INFO L131 ngComponentsAnalysis]: Automaton has 1738 accepting balls. 8898 [2025-04-26 16:58:47,693 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:47,693 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:47,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:47,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:47,698 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:58:47,699 INFO L754 eck$LassoCheckResult]: Loop: "[100] L32-->L34: Formula: (< v_x5_1 v_w_1) InVars {x5=v_x5_1, w=v_w_1} OutVars{x5=v_x5_1, w=v_w_1} AuxVars[] AssignedVars[]" "[102] L34-->L32: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-04-26 16:58:47,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:47,705 INFO L85 PathProgramCache]: Analyzing trace with hash 3878, now seen corresponding path program 1 times [2025-04-26 16:58:47,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:47,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358902482] [2025-04-26 16:58:47,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:47,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:47,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:47,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,765 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:47,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:47,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:47,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:47,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash 4163, now seen corresponding path program 1 times [2025-04-26 16:58:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:47,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870750711] [2025-04-26 16:58:47,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:47,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:47,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:47,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:47,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:47,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:47,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:47,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:47,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 3729960, now seen corresponding path program 1 times [2025-04-26 16:58:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:47,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002575453] [2025-04-26 16:58:47,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:47,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:47,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:47,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:47,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:47,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:47,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:47,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:47,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:47,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:47,953 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:47,954 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:47,954 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:47,954 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:47,954 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:47,954 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:47,955 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:47,955 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:47,955 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:47,955 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:47,955 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:47,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,005 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,005 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:48,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:58:48,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:48,012 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:58:48,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:48,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,106 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:48,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,111 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:48,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:48,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:48,111 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:48,112 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:48,112 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,112 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:48,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:48,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:48,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:48,112 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:48,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,131 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,134 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:48,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:58:48,141 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-04-26 16:58:48,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:48,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:48,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:48,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:48,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:48,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:48,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:48,161 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:48,166 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:48,167 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:48,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:48,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:58:48,174 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:48,176 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:48,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,178 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:48,178 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:48,179 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x5) = 1*w - 1*x5 Supporting invariants [] [2025-04-26 16:58:48,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:58:48,187 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:48,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:48,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:48,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:48,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:48,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:48,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:48,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,237 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:48,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:48,275 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-04-26 16:58:48,296 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9762 states, 9761 states have (on average 3.5262780452822455) internal successors, (in total 34420), 9761 states have internal predecessors, (34420), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:48,864 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9762 states, 9761 states have (on average 3.5262780452822455) internal successors, (in total 34420), 9761 states have internal predecessors, (34420), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 23777 states and 84350 transitions. Complement of second has 6 states. [2025-04-26 16:58:48,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 16:58:48,875 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:58:48,876 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,876 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:58:48,876 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,876 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:58:48,876 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23777 states and 84350 transitions. [2025-04-26 16:58:49,252 INFO L131 ngComponentsAnalysis]: Automaton has 1212 accepting balls. 5144 [2025-04-26 16:58:49,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23777 states to 13668 states and 48107 transitions. [2025-04-26 16:58:49,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5921 [2025-04-26 16:58:49,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8848 [2025-04-26 16:58:49,481 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13668 states and 48107 transitions. [2025-04-26 16:58:49,481 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:49,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13668 states and 48107 transitions. [2025-04-26 16:58:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13668 states and 48107 transitions. [2025-04-26 16:58:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13668 to 11609. [2025-04-26 16:58:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11609 states, 11609 states have (on average 3.56258075630976) internal successors, (in total 41358), 11608 states have internal predecessors, (41358), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11609 states to 11609 states and 41358 transitions. [2025-04-26 16:58:49,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11609 states and 41358 transitions. [2025-04-26 16:58:49,980 INFO L438 stractBuchiCegarLoop]: Abstraction has 11609 states and 41358 transitions. [2025-04-26 16:58:49,980 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:49,980 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11609 states and 41358 transitions. [2025-04-26 16:58:50,070 INFO L131 ngComponentsAnalysis]: Automaton has 1212 accepting balls. 5144 [2025-04-26 16:58:50,071 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:50,071 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:50,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:58:50,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:50,072 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:58:50,072 INFO L754 eck$LassoCheckResult]: Loop: "[104] L41-->L43: Formula: (< v_x4_1 v_w_3) InVars {x4=v_x4_1, w=v_w_3} OutVars{x4=v_x4_1, w=v_w_3} AuxVars[] AssignedVars[]" "[106] L43-->L41: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:58:50,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:50,073 INFO L85 PathProgramCache]: Analyzing trace with hash 115627898, now seen corresponding path program 1 times [2025-04-26 16:58:50,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:50,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896711074] [2025-04-26 16:58:50,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:50,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:50,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:50,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:50,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:50,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:50,083 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:50,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:50,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:50,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:50,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:50,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:50,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:50,092 INFO L85 PathProgramCache]: Analyzing trace with hash 4291, now seen corresponding path program 1 times [2025-04-26 16:58:50,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:50,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374995150] [2025-04-26 16:58:50,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:50,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:50,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:50,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:50,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:50,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:50,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:50,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:50,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:50,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:50,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:50,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:50,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash -550736388, now seen corresponding path program 1 times [2025-04-26 16:58:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:50,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663113015] [2025-04-26 16:58:50,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:50,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:50,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:50,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:50,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:50,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:50,102 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:50,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:50,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:50,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:50,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:50,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:50,126 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:50,126 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:50,126 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:50,126 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:50,126 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:50,126 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:50,126 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:50,127 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:50,127 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:50,127 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:50,127 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:50,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:50,159 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:50,159 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:50,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:50,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:50,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:50,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:58:50,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:50,170 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:50,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:50,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:50,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:50,198 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:50,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:58:50,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:50,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:50,298 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:50,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:58:50,308 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:50,308 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:50,308 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:50,308 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:50,308 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:50,308 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:50,308 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:50,308 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:50,308 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:50,308 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:50,308 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:50,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:50,336 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:50,336 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:50,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:50,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:50,339 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:50,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:58:50,352 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-04-26 16:58:50,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:50,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:50,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:50,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:50,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:50,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:50,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:50,376 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:50,379 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:50,379 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:50,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:50,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:50,386 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:50,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:58:50,392 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:50,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:58:50,396 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:50,396 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:50,396 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x4) = 1*w - 1*x4 Supporting invariants [] [2025-04-26 16:58:50,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:50,405 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:50,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:50,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:50,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:50,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:50,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:50,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:50,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:50,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:50,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:50,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:50,453 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:50,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:50,472 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-04-26 16:58:50,473 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11609 states and 41358 transitions. cyclomatic complexity: 31439 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:50,914 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11609 states and 41358 transitions. cyclomatic complexity: 31439. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 30696 states and 109668 transitions. Complement of second has 6 states. [2025-04-26 16:58:50,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-04-26 16:58:50,916 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:58:50,916 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:50,916 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:58:50,916 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:50,916 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:58:50,916 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:50,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30696 states and 109668 transitions. [2025-04-26 16:58:51,473 INFO L131 ngComponentsAnalysis]: Automaton has 736 accepting balls. 2532 [2025-04-26 16:58:51,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30696 states to 18983 states and 66463 transitions. [2025-04-26 16:58:51,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6536 [2025-04-26 16:58:51,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8898 [2025-04-26 16:58:51,835 INFO L74 IsDeterministic]: Start isDeterministic. Operand 18983 states and 66463 transitions. [2025-04-26 16:58:51,835 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:51,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18983 states and 66463 transitions. [2025-04-26 16:58:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18983 states and 66463 transitions. [2025-04-26 16:58:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18983 to 16658. [2025-04-26 16:58:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16658 states, 16658 states have (on average 3.555168687717613) internal successors, (in total 59222), 16657 states have internal predecessors, (59222), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16658 states to 16658 states and 59222 transitions. [2025-04-26 16:58:52,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16658 states and 59222 transitions. [2025-04-26 16:58:52,359 INFO L438 stractBuchiCegarLoop]: Abstraction has 16658 states and 59222 transitions. [2025-04-26 16:58:52,360 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:52,360 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16658 states and 59222 transitions. [2025-04-26 16:58:52,437 INFO L131 ngComponentsAnalysis]: Automaton has 736 accepting balls. 2532 [2025-04-26 16:58:52,438 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:52,438 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:52,439 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:52,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:52,439 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[105] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[133] L16-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:58:52,439 INFO L754 eck$LassoCheckResult]: Loop: "[108] L50-->L52: Formula: (< v_x2_1 v_w_5) InVars {x2=v_x2_1, w=v_w_5} OutVars{x2=v_x2_1, w=v_w_5} AuxVars[] AssignedVars[]" "[110] L52-->L50: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:58:52,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:52,440 INFO L85 PathProgramCache]: Analyzing trace with hash 107040297, now seen corresponding path program 1 times [2025-04-26 16:58:52,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:52,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567649725] [2025-04-26 16:58:52,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:52,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:52,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:52,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:52,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:52,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:52,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:52,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:52,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:52,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:52,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:52,458 INFO L85 PathProgramCache]: Analyzing trace with hash 4419, now seen corresponding path program 1 times [2025-04-26 16:58:52,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:52,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071264295] [2025-04-26 16:58:52,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:52,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:52,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:52,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:52,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:52,461 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:52,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:52,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:52,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:52,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:52,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash -213486229, now seen corresponding path program 1 times [2025-04-26 16:58:52,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:52,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392962599] [2025-04-26 16:58:52,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:52,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:52,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:52,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:52,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:52,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:52,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:52,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:52,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:52,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:52,504 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:52,504 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:52,504 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:52,504 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:52,504 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:52,504 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,504 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:52,504 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:52,504 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:52,504 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:52,504 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:52,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:52,525 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:52,525 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:52,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,528 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:52,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:58:52,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:52,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:52,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:58:52,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,549 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:52,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:58:52,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:52,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:52,618 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:52,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:58:52,622 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:52,622 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:52,622 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:52,623 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:52,623 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:52,623 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,623 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:52,623 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:52,623 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:52,623 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:52,623 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:52,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:52,643 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:52,643 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:52,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,645 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:52,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:58:52,747 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-04-26 16:58:52,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:52,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:52,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:52,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:52,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:52,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:52,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:52,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:52,764 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:52,765 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:52,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,767 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:52,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:58:52,769 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:52,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:58:52,773 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:52,773 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:52,773 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x2) = 1*w - 1*x2 Supporting invariants [] [2025-04-26 16:58:52,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:58:52,779 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:52,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:52,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:52,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:52,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:52,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:52,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:52,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:52,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:52,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:52,819 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:52,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:52,833 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-04-26 16:58:52,833 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16658 states and 59222 transitions. cyclomatic complexity: 44309 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:53,424 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16658 states and 59222 transitions. cyclomatic complexity: 44309. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 44802 states and 158530 transitions. Complement of second has 6 states. [2025-04-26 16:58:53,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-04-26 16:58:53,427 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:58:53,427 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:53,427 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:58:53,427 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:53,427 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 102 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:58:53,429 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:53,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44802 states and 158530 transitions. [2025-04-26 16:58:54,076 INFO L131 ngComponentsAnalysis]: Automaton has 378 accepting balls. 1044 [2025-04-26 16:58:54,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44802 states to 26589 states and 92284 transitions. [2025-04-26 16:58:54,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7512 [2025-04-26 16:58:54,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8871 [2025-04-26 16:58:54,316 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26589 states and 92284 transitions. [2025-04-26 16:58:54,317 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:54,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26589 states and 92284 transitions. [2025-04-26 16:58:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26589 states and 92284 transitions. [2025-04-26 16:58:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26589 to 24896. [2025-04-26 16:58:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24896 states, 24896 states have (on average 3.4373393316195373) internal successors, (in total 85576), 24895 states have internal predecessors, (85576), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24896 states to 24896 states and 85576 transitions. [2025-04-26 16:58:55,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24896 states and 85576 transitions. [2025-04-26 16:58:55,008 INFO L438 stractBuchiCegarLoop]: Abstraction has 24896 states and 85576 transitions. [2025-04-26 16:58:55,008 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:55,008 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24896 states and 85576 transitions. [2025-04-26 16:58:55,127 INFO L131 ngComponentsAnalysis]: Automaton has 378 accepting balls. 1044 [2025-04-26 16:58:55,128 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:55,128 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:55,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:55,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:55,129 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L32-->L34: Formula: (< v_x5_1 v_w_1) InVars {x5=v_x5_1, w=v_w_1} OutVars{x5=v_x5_1, w=v_w_1} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[102] L34-->L32: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" "[133] L16-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[136] L17-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[107] L50-->thread3FINAL: Formula: (<= v_w_6 v_x2_4) InVars {x2=v_x2_4, w=v_w_6} OutVars{x2=v_x2_4, w=v_w_6} AuxVars[] AssignedVars[]" [2025-04-26 16:58:55,129 INFO L754 eck$LassoCheckResult]: Loop: "[112] L59-->L61: Formula: (< v_x3_1 v_w_7) InVars {w=v_w_7, x3=v_x3_1} OutVars{w=v_w_7, x3=v_x3_1} AuxVars[] AssignedVars[]" "[114] L61-->L59: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:58:55,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,130 INFO L85 PathProgramCache]: Analyzing trace with hash 723040460, now seen corresponding path program 1 times [2025-04-26 16:58:55,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605800910] [2025-04-26 16:58:55,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:55,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:55,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:55,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:55,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,140 INFO L85 PathProgramCache]: Analyzing trace with hash 4547, now seen corresponding path program 1 times [2025-04-26 16:58:55,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212764502] [2025-04-26 16:58:55,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash -942816306, now seen corresponding path program 1 times [2025-04-26 16:58:55,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854594721] [2025-04-26 16:58:55,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:55,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:55,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:55,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:55,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,178 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,178 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,178 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,178 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,178 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:55,178 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,178 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,178 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,178 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:55,178 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,178 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,193 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,194 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:55,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,196 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:55,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:58:55,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:55,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:55,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,217 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:55,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:58:55,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:55,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,284 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:55,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:55,289 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,289 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,290 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,290 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,290 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:55,290 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,290 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,291 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,291 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:55,292 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,292 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,310 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,310 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:55,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,313 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:55,420 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-04-26 16:58:55,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:58:55,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:55,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:55,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:55,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:55,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:55,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:55,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:55,434 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:55,438 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:55,438 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:55,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,440 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:55,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:58:55,443 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:55,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:58:55,446 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:55,446 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:55,446 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x3) = 1*w - 1*x3 Supporting invariants [] [2025-04-26 16:58:55,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:55,453 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:55,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:55,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:55,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,494 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:55,511 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-04-26 16:58:55,511 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24896 states and 85576 transitions. cyclomatic complexity: 62685 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,934 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24896 states and 85576 transitions. cyclomatic complexity: 62685. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 45677 states and 153082 transitions. Complement of second has 6 states. [2025-04-26 16:58:55,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-04-26 16:58:55,936 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:58:55,936 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,936 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:58:55,936 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,936 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 118 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:58:55,936 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45677 states and 153082 transitions. [2025-04-26 16:58:56,327 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 258 [2025-04-26 16:58:56,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45677 states to 32669 states and 107967 transitions. [2025-04-26 16:58:56,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9225 [2025-04-26 16:58:56,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10280 [2025-04-26 16:58:56,876 INFO L74 IsDeterministic]: Start isDeterministic. Operand 32669 states and 107967 transitions. [2025-04-26 16:58:56,876 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:56,876 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32669 states and 107967 transitions. [2025-04-26 16:58:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32669 states and 107967 transitions. [2025-04-26 16:58:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32669 to 30592. [2025-04-26 16:58:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30592 states, 30592 states have (on average 3.366795240585774) internal successors, (in total 102997), 30591 states have internal predecessors, (102997), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30592 states to 30592 states and 102997 transitions. [2025-04-26 16:58:57,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30592 states and 102997 transitions. [2025-04-26 16:58:57,667 INFO L438 stractBuchiCegarLoop]: Abstraction has 30592 states and 102997 transitions. [2025-04-26 16:58:57,667 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:58:57,667 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30592 states and 102997 transitions. [2025-04-26 16:58:57,838 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 258 [2025-04-26 16:58:57,839 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:57,839 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:57,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:57,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:57,840 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[105] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[133] L16-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[107] L50-->thread3FINAL: Formula: (<= v_w_6 v_x2_4) InVars {x2=v_x2_4, w=v_w_6} OutVars{x2=v_x2_4, w=v_w_6} AuxVars[] AssignedVars[]" "[109] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[136] L17-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[111] L59-->thread4FINAL: Formula: (<= v_w_8 v_x3_4) InVars {w=v_w_8, x3=v_x3_4} OutVars{w=v_w_8, x3=v_x3_4} AuxVars[] AssignedVars[]" "[113] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[139] L18-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" [2025-04-26 16:58:57,840 INFO L754 eck$LassoCheckResult]: Loop: "[116] L68-->L70: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[118] L70-->L68: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:58:57,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1432639788, now seen corresponding path program 1 times [2025-04-26 16:58:57,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025616440] [2025-04-26 16:58:57,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:57,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:57,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:57,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:57,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash 4675, now seen corresponding path program 1 times [2025-04-26 16:58:57,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419242231] [2025-04-26 16:58:57,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:57,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:57,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:57,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:57,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1917662034, now seen corresponding path program 1 times [2025-04-26 16:58:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107650471] [2025-04-26 16:58:57,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:58:57,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:58:57,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:58:57,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:58:57,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,894 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:57,895 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:57,895 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:57,895 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:57,895 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:57,895 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,895 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:57,895 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:57,895 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:57,895 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:57,895 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:57,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:57,912 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:57,913 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:57,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,915 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:57,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:58:57,918 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:57,918 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:57,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:58:57,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,937 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:57,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:58:57,941 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:57,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:58,007 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:58,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:58,012 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:58,012 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:58,012 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:58,012 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:58,012 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:58,012 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,012 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:58,012 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:58,012 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:58,012 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:58,012 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:58,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:58,029 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:58,030 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:58,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,031 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:58,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:58:58,035 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-04-26 16:58:58,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:58,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:58,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:58,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:58,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:58,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:58,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:58,048 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:58,052 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:58,052 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:58,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,055 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:58,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:58:58,057 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:58,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:58,061 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:58,061 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:58,061 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:58:58,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:58:58,068 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:58,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:58,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:58,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:58,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:58,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:58,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:58,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:58,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:58,111 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:58,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:58,132 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-04-26 16:58:58,133 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30592 states and 102997 transitions. cyclomatic complexity: 74760 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:59,056 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30592 states and 102997 transitions. cyclomatic complexity: 74760. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 97137 states and 321849 transitions. Complement of second has 7 states. [2025-04-26 16:58:59,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-04-26 16:58:59,057 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:58:59,057 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:59,057 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 16:58:59,058 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:59,058 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:58:59,058 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:59,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97137 states and 321849 transitions. [2025-04-26 16:59:00,164 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 16:59:00,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97137 states to 62266 states and 207942 transitions. [2025-04-26 16:59:00,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16006 [2025-04-26 16:59:00,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16166 [2025-04-26 16:59:00,722 INFO L74 IsDeterministic]: Start isDeterministic. Operand 62266 states and 207942 transitions. [2025-04-26 16:59:00,722 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:00,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62266 states and 207942 transitions. [2025-04-26 16:59:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62266 states and 207942 transitions. [2025-04-26 16:59:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62266 to 52567. [2025-04-26 16:59:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52567 states, 52567 states have (on average 3.276561340765119) internal successors, (in total 172239), 52566 states have internal predecessors, (172239), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52567 states to 52567 states and 172239 transitions. [2025-04-26 16:59:01,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52567 states and 172239 transitions. [2025-04-26 16:59:01,991 INFO L438 stractBuchiCegarLoop]: Abstraction has 52567 states and 172239 transitions. [2025-04-26 16:59:01,991 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:59:01,991 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52567 states and 172239 transitions. [2025-04-26 16:59:02,482 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 16:59:02,482 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:02,482 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:02,483 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:02,483 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:59:02,483 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L32-->L34: Formula: (< v_x5_1 v_w_1) InVars {x5=v_x5_1, w=v_w_1} OutVars{x5=v_x5_1, w=v_w_1} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[102] L34-->L32: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" "[133] L16-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[136] L17-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[104] L41-->L43: Formula: (< v_x4_1 v_w_3) InVars {x4=v_x4_1, w=v_w_3} OutVars{x4=v_x4_1, w=v_w_3} AuxVars[] AssignedVars[]" "[139] L18-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[106] L43-->L41: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[115] L68-->L72: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[117] L72-->thread5FINAL: Formula: (= v_f_2 (+ v_f_3 1)) InVars {f=v_f_3} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[107] L50-->thread3FINAL: Formula: (<= v_w_6 v_x2_4) InVars {x2=v_x2_4, w=v_w_6} OutVars{x2=v_x2_4, w=v_w_6} AuxVars[] AssignedVars[]" "[142] L19-->$Ultimate##0: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" "[120] $Ultimate##0-->L79-1: Formula: (< 0 v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" "[111] L59-->thread4FINAL: Formula: (<= v_w_8 v_x3_4) InVars {w=v_w_8, x3=v_x3_4} OutVars{w=v_w_8, x3=v_x3_4} AuxVars[] AssignedVars[]" [2025-04-26 16:59:02,484 INFO L754 eck$LassoCheckResult]: Loop: "[122] L79-1-->L81: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[124] L81-->L79-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 16:59:02,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:02,484 INFO L85 PathProgramCache]: Analyzing trace with hash -481272260, now seen corresponding path program 1 times [2025-04-26 16:59:02,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:02,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939737814] [2025-04-26 16:59:02,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:02,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:02,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:59:02,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:59:02,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:02,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:02,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:02,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:59:02,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:59:02,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:02,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:02,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:02,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:02,506 INFO L85 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 1 times [2025-04-26 16:59:02,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:02,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244528006] [2025-04-26 16:59:02,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:02,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:02,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:02,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:02,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:02,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:02,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:02,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:02,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:02,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:02,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:02,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:02,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:02,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1353830014, now seen corresponding path program 1 times [2025-04-26 16:59:02,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:02,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160301494] [2025-04-26 16:59:02,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:02,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:02,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:59:02,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:59:02,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:02,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:02,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:02,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:59:02,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:59:02,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:02,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:02,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:02,545 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:02,545 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:02,545 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:02,545 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:02,545 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:02,545 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:02,545 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:02,545 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:02,545 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:59:02,545 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:02,545 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:02,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:02,559 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:02,559 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:02,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:02,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:02,561 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:02,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:59:02,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:02,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:02,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:02,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:02,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:02,584 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:02,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:59:02,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:02,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:02,656 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:02,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:59:02,660 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:02,660 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:02,660 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:02,660 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:02,660 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:02,660 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:02,660 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:02,661 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:02,661 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:59:02,661 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:02,661 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:02,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:02,677 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:02,677 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:02,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:02,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:02,679 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:02,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:59:02,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:59:02,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:02,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:02,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:02,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:02,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:02,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:02,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:02,694 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:02,696 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:59:02,696 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:59:02,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:02,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:02,698 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:02,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:59:02,700 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:02,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:59:02,703 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:02,703 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:02,703 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-04-26 16:59:02,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:59:02,712 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:02,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:02,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:59:02,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:59:02,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:02,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:02,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:02,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:02,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:02,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:02,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:02,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:02,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:02,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:59:02,816 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-04-26 16:59:02,816 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52567 states and 172239 transitions. cyclomatic complexity: 124147 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:03,791 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52567 states and 172239 transitions. cyclomatic complexity: 124147. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 111850 states and 347822 transitions. Complement of second has 7 states. [2025-04-26 16:59:03,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:59:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (in total 20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-04-26 16:59:03,792 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 112 transitions. Stem has 18 letters. Loop has 2 letters. [2025-04-26 16:59:03,792 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:03,793 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 112 transitions. Stem has 20 letters. Loop has 2 letters. [2025-04-26 16:59:03,793 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:03,793 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 112 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 16:59:03,793 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:03,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111850 states and 347822 transitions. [2025-04-26 16:59:05,139 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 16:59:05,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111850 states to 69978 states and 214825 transitions. [2025-04-26 16:59:05,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17271 [2025-04-26 16:59:05,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17543 [2025-04-26 16:59:05,815 INFO L74 IsDeterministic]: Start isDeterministic. Operand 69978 states and 214825 transitions. [2025-04-26 16:59:05,815 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:05,815 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69978 states and 214825 transitions. [2025-04-26 16:59:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69978 states and 214825 transitions. [2025-04-26 16:59:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69978 to 55072. [2025-04-26 16:59:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55072 states, 55072 states have (on average 3.1578115920976177) internal successors, (in total 173907), 55071 states have internal predecessors, (173907), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55072 states to 55072 states and 173907 transitions. [2025-04-26 16:59:07,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55072 states and 173907 transitions. [2025-04-26 16:59:07,304 INFO L438 stractBuchiCegarLoop]: Abstraction has 55072 states and 173907 transitions. [2025-04-26 16:59:07,304 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:59:07,304 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55072 states and 173907 transitions. [2025-04-26 16:59:07,571 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 16:59:07,571 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:07,571 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:07,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:07,572 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:59:07,573 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[101] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[105] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[133] L16-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[107] L50-->thread3FINAL: Formula: (<= v_w_6 v_x2_4) InVars {x2=v_x2_4, w=v_w_6} OutVars{x2=v_x2_4, w=v_w_6} AuxVars[] AssignedVars[]" "[109] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[136] L17-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[111] L59-->thread4FINAL: Formula: (<= v_w_8 v_x3_4) InVars {w=v_w_8, x3=v_x3_4} OutVars{w=v_w_8, x3=v_x3_4} AuxVars[] AssignedVars[]" "[113] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[139] L18-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[116] L68-->L70: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[118] L70-->L68: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[115] L68-->L72: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[117] L72-->thread5FINAL: Formula: (= v_f_2 (+ v_f_3 1)) InVars {f=v_f_3} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[119] thread5FINAL-->thread5EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[142] L19-->$Ultimate##0: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" "[120] $Ultimate##0-->L79-1: Formula: (< 0 v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 16:59:07,573 INFO L754 eck$LassoCheckResult]: Loop: "[122] L79-1-->L81: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[124] L81-->L79-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 16:59:07,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2107866833, now seen corresponding path program 1 times [2025-04-26 16:59:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:07,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093980530] [2025-04-26 16:59:07,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:07,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:07,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:59:07,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:59:07,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:07,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:07,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:07,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:59:07,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:59:07,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:07,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:07,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:07,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 2 times [2025-04-26 16:59:07,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:07,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797060737] [2025-04-26 16:59:07,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:59:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:07,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:07,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:07,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:59:07,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:07,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:07,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:07,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:07,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:07,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:07,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:07,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:07,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1564533293, now seen corresponding path program 1 times [2025-04-26 16:59:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:07,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117032073] [2025-04-26 16:59:07,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:07,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:59:07,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:59:07,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:07,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:07,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:07,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:59:07,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:59:07,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:07,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:07,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:07,630 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:07,630 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:07,630 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:07,630 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:07,630 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:07,630 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:07,630 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:07,630 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:07,630 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration7_Loop [2025-04-26 16:59:07,630 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:07,630 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:07,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:07,646 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:07,646 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:07,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:07,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:07,648 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:07,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:59:07,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:07,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:07,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:07,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:07,666 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:07,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:59:07,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:07,667 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:07,736 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:07,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:59:07,741 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:07,741 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:07,741 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:07,741 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:07,741 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:07,741 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:07,741 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:07,741 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:07,741 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration7_Loop [2025-04-26 16:59:07,741 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:07,741 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:07,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:07,757 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:07,757 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:07,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:07,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:07,759 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:07,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:59:07,761 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-04-26 16:59:07,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:07,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:07,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:07,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:07,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:07,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:07,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:07,776 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:07,778 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:07,778 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:07,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:07,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:07,780 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:07,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:59:07,782 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:07,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:07,785 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:07,785 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:07,785 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, y) = 1*x1 - 1*y Supporting invariants [] [2025-04-26 16:59:07,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:07,790 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:07,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:07,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:59:07,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:59:07,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:07,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:07,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:07,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:07,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:07,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:07,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:07,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:07,836 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:07,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:59:07,846 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-04-26 16:59:07,846 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55072 states and 173907 transitions. cyclomatic complexity: 124182 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (in total 23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:09,104 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55072 states and 173907 transitions. cyclomatic complexity: 124182. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (in total 23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 146558 states and 456745 transitions. Complement of second has 7 states. [2025-04-26 16:59:09,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:59:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (in total 23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-04-26 16:59:09,106 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 21 letters. Loop has 2 letters. [2025-04-26 16:59:09,106 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:09,106 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 23 letters. Loop has 2 letters. [2025-04-26 16:59:09,106 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:09,106 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 21 letters. Loop has 4 letters. [2025-04-26 16:59:09,106 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:09,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146558 states and 456745 transitions. [2025-04-26 16:59:10,982 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 16:59:11,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146558 states to 105293 states and 325299 transitions. [2025-04-26 16:59:11,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24344 [2025-04-26 16:59:12,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24744 [2025-04-26 16:59:12,035 INFO L74 IsDeterministic]: Start isDeterministic. Operand 105293 states and 325299 transitions. [2025-04-26 16:59:12,035 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:12,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105293 states and 325299 transitions. [2025-04-26 16:59:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105293 states and 325299 transitions. [2025-04-26 16:59:13,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105293 to 62424. [2025-04-26 16:59:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62424 states, 62424 states have (on average 3.186723055235166) internal successors, (in total 198928), 62423 states have internal predecessors, (198928), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62424 states to 62424 states and 198928 transitions. [2025-04-26 16:59:13,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62424 states and 198928 transitions. [2025-04-26 16:59:13,720 INFO L438 stractBuchiCegarLoop]: Abstraction has 62424 states and 198928 transitions. [2025-04-26 16:59:13,720 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:59:13,721 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62424 states and 198928 transitions. [2025-04-26 16:59:14,061 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 16:59:14,061 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:14,061 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:14,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:14,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:59:14,062 INFO L752 eck$LassoCheckResult]: Stem: "[90] $Ultimate##0-->L15: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[127] L15-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[100] L32-->L34: Formula: (< v_x5_1 v_w_1) InVars {x5=v_x5_1, w=v_w_1} OutVars{x5=v_x5_1, w=v_w_1} AuxVars[] AssignedVars[]" "[130] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[102] L34-->L32: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" "[133] L16-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[100] L32-->L34: Formula: (< v_x5_1 v_w_1) InVars {x5=v_x5_1, w=v_w_1} OutVars{x5=v_x5_1, w=v_w_1} AuxVars[] AssignedVars[]" "[136] L17-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[102] L34-->L32: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" "[139] L18-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[99] L32-->thread1FINAL: Formula: (<= v_w_2 v_x5_4) InVars {x5=v_x5_4, w=v_w_2} OutVars{x5=v_x5_4, w=v_w_2} AuxVars[] AssignedVars[]" "[142] L19-->$Ultimate##0: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" "[103] L41-->thread2FINAL: Formula: (<= v_w_4 v_x4_4) InVars {x4=v_x4_4, w=v_w_4} OutVars{x4=v_x4_4, w=v_w_4} AuxVars[] AssignedVars[]" "[120] $Ultimate##0-->L79-1: Formula: (< 0 v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" "[107] L50-->thread3FINAL: Formula: (<= v_w_6 v_x2_4) InVars {x2=v_x2_4, w=v_w_6} OutVars{x2=v_x2_4, w=v_w_6} AuxVars[] AssignedVars[]" "[122] L79-1-->L81: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[112] L59-->L61: Formula: (< v_x3_1 v_w_7) InVars {w=v_w_7, x3=v_x3_1} OutVars{w=v_w_7, x3=v_x3_1} AuxVars[] AssignedVars[]" "[124] L81-->L79-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[114] L61-->L59: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[121] L79-1-->thread6FINAL: Formula: (<= v_x1_8 v_y_2) InVars {y=v_y_2, x1=v_x1_8} OutVars{y=v_y_2, x1=v_x1_8} AuxVars[] AssignedVars[]" "[111] L59-->thread4FINAL: Formula: (<= v_w_8 v_x3_4) InVars {w=v_w_8, x3=v_x3_4} OutVars{w=v_w_8, x3=v_x3_4} AuxVars[] AssignedVars[]" [2025-04-26 16:59:14,062 INFO L754 eck$LassoCheckResult]: Loop: "[116] L68-->L70: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[118] L70-->L68: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:59:14,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash 150147717, now seen corresponding path program 1 times [2025-04-26 16:59:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:14,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050326259] [2025-04-26 16:59:14,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:14,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:59:14,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:59:14,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:59:14,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:59:14,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050326259] [2025-04-26 16:59:14,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050326259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:59:14,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:59:14,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:59:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422513918] [2025-04-26 16:59:14,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:59:14,109 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:59:14,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash 4675, now seen corresponding path program 2 times [2025-04-26 16:59:14,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:14,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370937194] [2025-04-26 16:59:14,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:59:14,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:14,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:14,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:14,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:59:14,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:14,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:14,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:14,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:14,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:14,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:14,133 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:14,133 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:14,134 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:14,134 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:14,134 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:14,134 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,134 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:14,134 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:14,134 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration8_Loop [2025-04-26 16:59:14,134 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:14,134 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:14,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:14,150 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:14,150 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:14,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:14,152 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:14,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:59:14,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:14,155 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:14,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:59:14,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:14,172 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:14,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:59:14,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:14,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:14,240 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:14,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:14,244 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:14,244 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:14,244 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:14,244 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:14,244 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:14,244 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,244 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:14,244 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:14,244 INFO L132 ssoRankerPreferences]: Filename of dumped script: m11.c.bpl_petrified1_Iteration8_Loop [2025-04-26 16:59:14,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:14,244 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:14,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:14,263 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:14,263 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:14,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:14,266 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:14,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:59:14,268 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-04-26 16:59:14,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:14,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:14,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:14,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:14,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:14,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:14,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:14,283 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:14,290 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:14,290 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:14,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:14,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:14,294 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:14,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:59:14,295 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:14,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:14,298 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:14,298 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:14,298 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:59:14,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:14,304 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:14,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:14,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:59:14,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:59:14,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:14,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:14,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:14,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:14,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:14,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:14,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:14,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:14,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:59:14,370 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-04-26 16:59:14,370 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62424 states and 198928 transitions. cyclomatic complexity: 142365 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:15,645 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62424 states and 198928 transitions. cyclomatic complexity: 142365. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 136699 states and 417896 transitions. Complement of second has 7 states. [2025-04-26 16:59:15,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:59:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-26 16:59:15,646 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 21 letters. Loop has 2 letters. [2025-04-26 16:59:15,647 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:15,647 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 23 letters. Loop has 2 letters. [2025-04-26 16:59:15,647 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:15,647 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 21 letters. Loop has 4 letters. [2025-04-26 16:59:15,647 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:15,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136699 states and 417896 transitions. [2025-04-26 16:59:17,009 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 254 [2025-04-26 16:59:17,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136699 states to 94386 states and 284452 transitions. [2025-04-26 16:59:17,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21479 [2025-04-26 16:59:17,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22032 [2025-04-26 16:59:17,947 INFO L74 IsDeterministic]: Start isDeterministic. Operand 94386 states and 284452 transitions. [2025-04-26 16:59:17,947 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:17,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94386 states and 284452 transitions. [2025-04-26 16:59:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94386 states and 284452 transitions. [2025-04-26 16:59:19,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94386 to 64657. [2025-04-26 16:59:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64657 states, 64657 states have (on average 3.131787741466508) internal successors, (in total 202492), 64656 states have internal predecessors, (202492), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64657 states to 64657 states and 202492 transitions. [2025-04-26 16:59:19,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64657 states and 202492 transitions. [2025-04-26 16:59:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:59:19,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:59:19,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:59:19,692 INFO L87 Difference]: Start difference. First operand 64657 states and 202492 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:59:19,812 INFO L93 Difference]: Finished difference Result 20218 states and 58184 transitions. [2025-04-26 16:59:19,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20218 states and 58184 transitions. [2025-04-26 16:59:19,927 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:59:19,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20218 states to 0 states and 0 transitions. [2025-04-26 16:59:19,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:59:19,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:59:19,927 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:59:19,928 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:59:19,928 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:59:19,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:59:19,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:59:19,929 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:59:19,929 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:59:19,929 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:59:19,929 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:59:19,929 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:59:19,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:59:19,946 INFO L201 PluginConnector]: Adding new model m11.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:59:19 BoogieIcfgContainer [2025-04-26 16:59:19,946 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:59:19,947 INFO L158 Benchmark]: Toolchain (without parser) took 34683.55ms. Allocated memory was 155.2MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 86.4MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2025-04-26 16:59:19,947 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.71ms. Allocated memory is still 155.2MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:59:19,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.74ms. Allocated memory is still 155.2MB. Free memory was 86.4MB in the beginning and 84.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:59:19,948 INFO L158 Benchmark]: Boogie Preprocessor took 23.39ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 83.4MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:59:19,948 INFO L158 Benchmark]: RCFGBuilder took 195.47ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 73.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:59:19,948 INFO L158 Benchmark]: BuchiAutomizer took 34416.06ms. Allocated memory was 155.2MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 72.9MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2025-04-26 16:59:19,949 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.71ms. Allocated memory is still 155.2MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.74ms. Allocated memory is still 155.2MB. Free memory was 86.4MB in the beginning and 84.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.39ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 83.4MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 195.47ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 73.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 34416.06ms. Allocated memory was 155.2MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 72.9MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.2s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.3s. Büchi inclusion checks took 6.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 8.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 105357 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 11.8s Buchi closure took 0.4s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [8, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 631 mSDsluCounter, 818 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 405 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 545 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 413 mSDtfsCounter, 545 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT7 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 1.6s InitialAbstraction: Time to compute Ample Reduction [ms]: 1607, Number of transitions in reduction automaton: 34420, Number of states in reduction automaton: 9762, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (1 trivial, 8 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x5 + w and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + w and consists of 4 locations. One deterministic module has affine ranking function w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + w and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:59:19,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...