/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/indep_loops_minus1_7.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:43:37,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:43:37,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:43:37,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:43:37,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:43:37,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:43:37,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:43:37,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:43:37,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:43:37,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:43:37,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:43:37,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:43:37,850 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:43:37,850 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:43:37,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:43:37,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:43:37,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:43:37,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:43:37,852 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:43:37,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:43:37,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:43:37,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:43:37,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:37,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:43:37,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:43:37,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:43:37,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:43:37,852 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:43:37,853 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:43:37,853 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:43:38,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:43:38,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:43:38,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:43:38,078 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:43:38,079 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:43:38,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_7.c.bpl [2025-04-26 18:43:38,080 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_7.c.bpl' [2025-04-26 18:43:38,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:43:38,098 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:43:38,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:38,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:43:38,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:43:38,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,131 INFO L138 Inliner]: procedures = 8, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:43:38,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:43:38,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:43:38,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:43:38,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:43:38,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:43:38,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:43:38,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:43:38,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:43:38,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/1) ... [2025-04-26 18:43:38,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:43:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:38,179 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 18:43:38,182 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 18:43:38,205 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:43:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:43:38,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:43:38,205 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:43:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:43:38,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:43:38,205 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:43:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:43:38,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:43:38,205 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:43:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:43:38,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:43:38,206 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:43:38,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:43:38,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:43:38,206 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 18:43:38,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 18:43:38,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 18:43:38,206 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 18:43:38,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 18:43:38,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 18:43:38,206 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread7 given in one single declaration [2025-04-26 18:43:38,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread7 [2025-04-26 18:43:38,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread7 [2025-04-26 18:43:38,207 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 18:43:38,244 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:43:38,245 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:43:38,318 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:43:38,319 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:43:38,329 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:43:38,329 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:43:38,329 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:43:38 BoogieIcfgContainer [2025-04-26 18:43:38,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:43:38,330 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:43:38,330 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:43:38,334 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:43:38,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:38,335 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:43:38" (1/2) ... [2025-04-26 18:43:38,335 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c28e83c and model type indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:43:38, skipping insertion in model container [2025-04-26 18:43:38,335 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:43:38,336 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:43:38" (2/2) ... [2025-04-26 18:43:38,336 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_7.c.bpl [2025-04-26 18:43:38,404 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-04-26 18:43:38,436 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:43:38,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:43:38,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:38,438 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 18:43:38,440 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 18:43:38,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 58 transitions, 165 flow [2025-04-26 18:43:38,522 INFO L116 PetriNetUnfolderBase]: 7/44 cut-off events. [2025-04-26 18:43:38,524 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-26 18:43:38,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 44 events. 7/44 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-04-26 18:43:38,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 58 transitions, 165 flow [2025-04-26 18:43:38,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 44 transitions, 130 flow [2025-04-26 18:43:38,530 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 59 places, 44 transitions, 130 flow [2025-04-26 18:43:38,530 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 44 transitions, 130 flow [2025-04-26 18:43:39,999 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33791 states, 33790 states have (on average 6.879165433560225) internal successors, (in total 232447), 33790 states have internal predecessors, (232447), 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 18:43:40,096 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 33791 states, 33790 states have (on average 6.879165433560225) internal successors, (in total 232447), 33790 states have internal predecessors, (232447), 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 18:43:40,098 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:43:42,373 WARN L140 AmpleReduction]: Number of pruned transitions: 92460 [2025-04-26 18:43:42,374 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:43:42,374 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 16431 [2025-04-26 18:43:42,374 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:38 [2025-04-26 18:43:42,374 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:17296 [2025-04-26 18:43:42,374 WARN L145 AmpleReduction]: Times succ was already a loop node:46221 [2025-04-26 18:43:42,374 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:8801 [2025-04-26 18:43:42,374 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:43:42,447 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 33766 states, 33765 states have (on average 4.143136383829409) internal successors, (in total 139893), 33765 states have internal predecessors, (139893), 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 18:43:42,454 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:43:42,454 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:43:42,454 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:43:42,454 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:43:42,454 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:43:42,454 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:43:42,454 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:43:42,454 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:43:42,511 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33766 states, 33765 states have (on average 4.143136383829409) internal successors, (in total 139893), 33765 states have internal predecessors, (139893), 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 18:43:43,153 INFO L131 ngComponentsAnalysis]: Automaton has 3931 accepting balls. 33047 [2025-04-26 18:43:43,154 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:43,154 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:43,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:43:43,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:43,160 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:43:43,209 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33766 states, 33765 states have (on average 4.143136383829409) internal successors, (in total 139893), 33765 states have internal predecessors, (139893), 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 18:43:43,724 INFO L131 ngComponentsAnalysis]: Automaton has 3931 accepting balls. 33047 [2025-04-26 18:43:43,724 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:43,725 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:43,726 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:43:43,726 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:43,730 INFO L752 eck$LassoCheckResult]: Stem: "[140] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:43:43,730 INFO L754 eck$LassoCheckResult]: Loop: "[110] L32-->L34: 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[]" "[112] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:43:43,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash 171, now seen corresponding path program 1 times [2025-04-26 18:43:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:43,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478057258] [2025-04-26 18:43:43,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:43,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:43,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:43:43,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:43:43,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:43,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:43,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:43,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:43:43,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:43:43,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:43,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:43,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:43,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-04-26 18:43:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:43,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773694442] [2025-04-26 18:43:43,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:43,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:43,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:43,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:43,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:43,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:43,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:43,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:43,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:43,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:43,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:43,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:43,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:43,829 INFO L85 PathProgramCache]: Analyzing trace with hash 167853, now seen corresponding path program 1 times [2025-04-26 18:43:43,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:43,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731228992] [2025-04-26 18:43:43,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:43,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:43,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:43,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:43,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:43,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:43,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:43:43,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:43:43,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:43,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:43,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:43,959 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:43,960 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:43,960 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:43,960 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:43,960 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:43,960 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:43,960 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:43,960 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:43,961 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:43:43,961 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:43,961 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:43,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:44,019 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:44,020 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:44,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:44,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:44,024 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 18:43:44,025 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 18:43:44,030 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:44,030 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:44,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:43:44,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:44,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:44,078 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 18:43:44,079 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 18:43:44,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:44,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:44,179 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:44,185 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 18:43:44,186 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:44,188 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:44,188 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:44,188 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:44,188 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:44,189 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:44,189 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:44,189 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:44,189 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:43:44,189 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:44,189 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:44,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:44,227 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:44,230 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:44,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:44,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:44,241 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 18:43:44,242 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 18:43:44,243 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 18:43:44,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:44,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:44,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:44,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:44,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:44,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:44,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:44,280 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:44,293 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:44,293 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:44,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:44,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:44,315 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 18:43:44,316 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 18:43:44,317 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:44,320 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 18:43:44,321 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 18:43:44,321 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:44,322 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:44,322 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:43:44,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:44,332 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:44,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:44,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:43:44,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:43:44,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:44,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:44,444 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:44,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:44,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:44,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:44,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:44,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:44,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:44,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:44,496 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 18:43:44,533 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 18:43:44,613 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 33766 states, 33765 states have (on average 4.143136383829409) internal successors, (in total 139893), 33765 states have internal predecessors, (139893), 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.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 18:43:46,068 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 33766 states, 33765 states have (on average 4.143136383829409) internal successors, (in total 139893), 33765 states have internal predecessors, (139893), 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.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 88688 states and 382495 transitions. Complement of second has 6 states. [2025-04-26 18:43:46,069 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 18:43:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 18:43:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 18:43:46,077 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:43:46,078 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:46,078 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:43:46,078 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:46,078 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:43:46,078 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:46,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88688 states and 382495 transitions. [2025-04-26 18:43:47,634 INFO L131 ngComponentsAnalysis]: Automaton has 3350 accepting balls. 20589 [2025-04-26 18:43:48,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88688 states to 56444 states and 237778 transitions. [2025-04-26 18:43:48,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25129 [2025-04-26 18:43:48,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37960 [2025-04-26 18:43:48,907 INFO L74 IsDeterministic]: Start isDeterministic. Operand 56444 states and 237778 transitions. [2025-04-26 18:43:48,909 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:48,911 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56444 states and 237778 transitions. [2025-04-26 18:43:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56444 states and 237778 transitions. [2025-04-26 18:43:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56444 to 44667. [2025-04-26 18:43:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44667 states, 44667 states have (on average 4.354154073477064) internal successors, (in total 194487), 44666 states have internal predecessors, (194487), 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 18:43:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44667 states to 44667 states and 194487 transitions. [2025-04-26 18:43:51,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44667 states and 194487 transitions. [2025-04-26 18:43:51,145 INFO L438 stractBuchiCegarLoop]: Abstraction has 44667 states and 194487 transitions. [2025-04-26 18:43:51,146 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:43:51,146 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44667 states and 194487 transitions. [2025-04-26 18:43:51,659 INFO L131 ngComponentsAnalysis]: Automaton has 3350 accepting balls. 20589 [2025-04-26 18:43:51,659 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:51,659 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:51,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:43:51,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:51,662 INFO L752 eck$LassoCheckResult]: Stem: "[140] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[109] L32-->thread1FINAL: 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[]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L13-->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 18:43:51,662 INFO L754 eck$LassoCheckResult]: Loop: "[114] L41-->L43: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[116] L43-->L41: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:43:51,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash 5202594, now seen corresponding path program 1 times [2025-04-26 18:43:51,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:51,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114287933] [2025-04-26 18:43:51,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:51,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:51,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:51,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:51,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:51,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:51,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:51,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:51,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:51,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:51,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:51,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:51,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash 4611, now seen corresponding path program 1 times [2025-04-26 18:43:51,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:51,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724202889] [2025-04-26 18:43:51,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:51,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:51,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:51,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:51,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:51,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:51,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:51,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:51,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:51,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:51,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:51,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:51,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash 704729188, now seen corresponding path program 1 times [2025-04-26 18:43:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:51,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060705839] [2025-04-26 18:43:51,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:51,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:51,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:43:51,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:43:51,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:51,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:51,705 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:51,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:43:51,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:43:51,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:51,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:51,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:51,721 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:51,721 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:51,721 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:51,721 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:51,721 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:51,721 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:51,721 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:51,721 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:51,721 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:51,721 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:51,721 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:51,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:51,738 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:51,738 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:51,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:51,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:51,740 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 18:43:51,742 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 18:43:51,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:51,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:51,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:43:51,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:51,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:51,764 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 18:43:51,765 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 18:43:51,766 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:51,767 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:51,831 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:51,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:51,836 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:51,836 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:51,836 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:51,836 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:51,836 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:51,836 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:51,836 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:51,836 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:51,836 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:51,836 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:51,836 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:51,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:51,860 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:51,860 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:51,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:51,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:51,862 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 18:43:51,863 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 18:43:51,864 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 18:43:51,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:51,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:51,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:51,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:51,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:51,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:51,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:51,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:51,881 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:51,881 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:51,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:51,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:51,883 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 18:43:51,885 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 18:43:51,886 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:51,889 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:43:51,890 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 18:43:51,890 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:51,890 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:51,890 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 18:43:51,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:43:51,898 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:51,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:51,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:51,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:51,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:51,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:51,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:51,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:51,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:51,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:51,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:51,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:51,931 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:51,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:51,945 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 18:43:51,945 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 18:43:51,946 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44667 states and 194487 transitions. cyclomatic complexity: 154199 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 18:43:53,747 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44667 states and 194487 transitions. cyclomatic complexity: 154199. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 122260 states and 524963 transitions. Complement of second has 6 states. [2025-04-26 18:43:53,751 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 18:43:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 18:43:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-26 18:43:53,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:43:53,753 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:53,753 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:43:53,753 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:53,753 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:43:53,753 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:53,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122260 states and 524963 transitions. [2025-04-26 18:43:55,690 INFO L131 ngComponentsAnalysis]: Automaton has 2763 accepting balls. 12057 [2025-04-26 18:43:56,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122260 states to 80191 states and 338501 transitions. [2025-04-26 18:43:56,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27879 [2025-04-26 18:43:56,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37797 [2025-04-26 18:43:56,997 INFO L74 IsDeterministic]: Start isDeterministic. Operand 80191 states and 338501 transitions. [2025-04-26 18:43:56,997 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:56,997 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80191 states and 338501 transitions. [2025-04-26 18:43:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80191 states and 338501 transitions. [2025-04-26 18:43:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80191 to 70230. [2025-04-26 18:43:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70230 states, 70230 states have (on average 4.305268403816033) internal successors, (in total 302359), 70229 states have internal predecessors, (302359), 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 18:43:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70230 states to 70230 states and 302359 transitions. [2025-04-26 18:43:59,578 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70230 states and 302359 transitions. [2025-04-26 18:43:59,578 INFO L438 stractBuchiCegarLoop]: Abstraction has 70230 states and 302359 transitions. [2025-04-26 18:43:59,578 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:43:59,578 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70230 states and 302359 transitions. [2025-04-26 18:44:00,049 INFO L131 ngComponentsAnalysis]: Automaton has 2763 accepting balls. 12057 [2025-04-26 18:44:00,049 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:00,049 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:00,050 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:00,050 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:00,051 INFO L752 eck$LassoCheckResult]: Stem: "[140] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[109] L32-->thread1FINAL: 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[]" "[111] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L13-->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]" "[113] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[115] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[146] L14-->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 18:44:00,051 INFO L754 eck$LassoCheckResult]: Loop: "[118] L50-->L52: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[120] L52-->L50: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:44:00,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 371767502, now seen corresponding path program 1 times [2025-04-26 18:44:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:00,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713126905] [2025-04-26 18:44:00,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:00,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:00,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:00,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:00,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:00,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:00,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:00,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:00,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:00,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:00,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:00,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:00,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 4739, now seen corresponding path program 1 times [2025-04-26 18:44:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:00,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954049034] [2025-04-26 18:44:00,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:00,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:00,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:00,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:00,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:00,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:00,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:00,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:00,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:00,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:00,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:00,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:00,072 INFO L85 PathProgramCache]: Analyzing trace with hash 786287632, now seen corresponding path program 1 times [2025-04-26 18:44:00,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:00,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705401673] [2025-04-26 18:44:00,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:00,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:00,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:00,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:00,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:00,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:00,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:00,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:00,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:00,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:00,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:00,094 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:00,094 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:00,094 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:00,094 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:00,094 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:00,094 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:00,094 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:00,095 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:00,095 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:00,095 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:00,095 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:00,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:00,110 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:00,110 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:00,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:00,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:00,112 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 18:44:00,113 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 18:44:00,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:00,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:00,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:00,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:00,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:00,135 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 18:44:00,314 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 18:44:00,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:00,314 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:00,386 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:00,391 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 18:44:00,391 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:00,391 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:00,391 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:00,391 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:00,391 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:00,391 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:00,391 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:00,391 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:00,391 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:00,391 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:00,391 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:00,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:00,408 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:00,408 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:00,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:00,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:00,410 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 18:44:00,412 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 18:44:00,413 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 18:44:00,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:00,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:00,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:00,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:00,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:00,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:00,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:00,427 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:00,431 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:00,431 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:00,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:00,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:00,434 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 18:44:00,435 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 18:44:00,436 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:00,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:00,440 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:00,440 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:00,440 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 18:44:00,445 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 18:44:00,446 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:00,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:00,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:00,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:00,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:00,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:00,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:00,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:00,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:00,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:00,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:00,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:00,490 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:00,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:00,503 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 18:44:00,504 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 18:44:00,504 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70230 states and 302359 transitions. cyclomatic complexity: 237318 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 18:44:02,916 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70230 states and 302359 transitions. cyclomatic complexity: 237318. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 189127 states and 799174 transitions. Complement of second has 6 states. [2025-04-26 18:44:02,917 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 18:44:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 18:44:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-04-26 18:44:02,918 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:44:02,918 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,918 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:44:02,918 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,918 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:44:02,918 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189127 states and 799174 transitions. [2025-04-26 18:44:06,233 INFO L131 ngComponentsAnalysis]: Automaton has 2260 accepting balls. 7217 [2025-04-26 18:44:07,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189127 states to 122279 states and 508168 transitions. [2025-04-26 18:44:07,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35108 [2025-04-26 18:44:08,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41243 [2025-04-26 18:44:08,113 INFO L74 IsDeterministic]: Start isDeterministic. Operand 122279 states and 508168 transitions. [2025-04-26 18:44:08,113 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:08,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122279 states and 508168 transitions. [2025-04-26 18:44:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122279 states and 508168 transitions. [2025-04-26 18:44:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122279 to 114496. [2025-04-26 18:44:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114496 states, 114496 states have (on average 4.136502585243153) internal successors, (in total 473613), 114495 states have internal predecessors, (473613), 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 18:44:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114496 states to 114496 states and 473613 transitions. [2025-04-26 18:44:12,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 114496 states and 473613 transitions. [2025-04-26 18:44:12,361 INFO L438 stractBuchiCegarLoop]: Abstraction has 114496 states and 473613 transitions. [2025-04-26 18:44:12,361 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:44:12,361 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114496 states and 473613 transitions. [2025-04-26 18:44:13,136 INFO L131 ngComponentsAnalysis]: Automaton has 2260 accepting balls. 7217 [2025-04-26 18:44:13,136 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:13,136 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:13,137 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:13,137 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:13,138 INFO L752 eck$LassoCheckResult]: Stem: "[140] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] L32-->L34: 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[]" "[143] L13-->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]" "[112] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[146] L14-->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]" "[109] L32-->thread1FINAL: 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[]" "[149] L15-->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]" "[113] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[117] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 18:44:13,138 INFO L754 eck$LassoCheckResult]: Loop: "[122] L59-->L61: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[124] L61-->L59: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 18:44:13,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash 7241178, now seen corresponding path program 1 times [2025-04-26 18:44:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:13,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961809971] [2025-04-26 18:44:13,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:13,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:13,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:13,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:13,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:13,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:13,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:13,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 1 times [2025-04-26 18:44:13,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:13,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567105392] [2025-04-26 18:44:13,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:13,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:13,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:13,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:13,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:13,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:13,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:13,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1631158628, now seen corresponding path program 1 times [2025-04-26 18:44:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:13,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059430260] [2025-04-26 18:44:13,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:13,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:13,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:44:13,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:44:13,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:13,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:44:13,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:44:13,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:13,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:13,209 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:13,209 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:13,209 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:13,209 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:13,209 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:13,209 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,209 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:13,209 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:13,209 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:13,209 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:13,209 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:13,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:13,223 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:13,224 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:13,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:13,227 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 18:44:13,228 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 18:44:13,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:13,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:13,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:44:13,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:13,250 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 18:44:13,449 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 18:44:13,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:13,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:13,517 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:13,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:44:13,522 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:13,522 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:13,522 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:13,522 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:13,522 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:13,522 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,522 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:13,522 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:13,522 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:13,522 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:13,522 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:13,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:13,536 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:13,536 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:13,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:13,538 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 18:44:13,539 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 18:44:13,541 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 18:44:13,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:13,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:13,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:13,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:13,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:13,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:13,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:13,555 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:13,557 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:13,557 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:13,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:13,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:13,559 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 18:44:13,560 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 18:44:13,560 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:13,563 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 18:44:13,563 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:13,563 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:13,564 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 18:44:13,569 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 18:44:13,570 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:13,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:13,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:13,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:13,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:13,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:13,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:13,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:13,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:13,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:13,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:13,609 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:13,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:13,624 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 18:44:13,625 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 18:44:13,625 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114496 states and 473613 transitions. cyclomatic complexity: 365805 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 18:44:15,944 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114496 states and 473613 transitions. cyclomatic complexity: 365805. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 204048 states and 824708 transitions. Complement of second has 6 states. [2025-04-26 18:44:15,944 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 18:44:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 18:44:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-26 18:44:15,945 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:44:15,945 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:15,945 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:44:15,945 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:15,945 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:44:15,945 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:15,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204048 states and 824708 transitions. [2025-04-26 18:44:19,420 INFO L131 ngComponentsAnalysis]: Automaton has 2043 accepting balls. 5001 [2025-04-26 18:44:21,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204048 states to 164959 states and 659048 transitions. [2025-04-26 18:44:21,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46987 [2025-04-26 18:44:21,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52311 [2025-04-26 18:44:21,864 INFO L74 IsDeterministic]: Start isDeterministic. Operand 164959 states and 659048 transitions. [2025-04-26 18:44:21,864 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:21,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 164959 states and 659048 transitions. [2025-04-26 18:44:22,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164959 states and 659048 transitions. [2025-04-26 18:44:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164959 to 154542. [2025-04-26 18:44:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154542 states, 154542 states have (on average 4.064112021327536) internal successors, (in total 628076), 154541 states have internal predecessors, (628076), 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 18:44:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154542 states to 154542 states and 628076 transitions. [2025-04-26 18:44:27,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154542 states and 628076 transitions. [2025-04-26 18:44:27,091 INFO L438 stractBuchiCegarLoop]: Abstraction has 154542 states and 628076 transitions. [2025-04-26 18:44:27,091 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:44:27,091 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154542 states and 628076 transitions. [2025-04-26 18:44:28,351 INFO L131 ngComponentsAnalysis]: Automaton has 1987 accepting balls. 4889 [2025-04-26 18:44:28,351 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:28,351 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:28,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:28,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:28,354 INFO L752 eck$LassoCheckResult]: Stem: "[140] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] L32-->L34: 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[]" "[143] L13-->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]" "[112] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[146] L14-->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]" "[109] L32-->thread1FINAL: 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[]" "[149] L15-->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]" "[113] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[152] L16-->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]" "[117] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[121] L59-->thread4FINAL: Formula: (<= v_z_8 v_x4_4) InVars {x4=v_x4_4, z=v_z_8} OutVars{x4=v_x4_4, z=v_z_8} AuxVars[] AssignedVars[]" [2025-04-26 18:44:28,354 INFO L754 eck$LassoCheckResult]: Loop: "[126] L68-->L70: Formula: (< v_x5_2 v_z_10) InVars {x5=v_x5_2, z=v_z_10} OutVars{x5=v_x5_2, z=v_z_10} AuxVars[] AssignedVars[]" "[128] L70-->L68: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-04-26 18:44:28,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:28,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1631125151, now seen corresponding path program 1 times [2025-04-26 18:44:28,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:28,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559435411] [2025-04-26 18:44:28,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:28,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:28,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:44:28,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:44:28,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:28,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:28,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:28,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:44:28,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:44:28,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:28,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:28,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:28,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:28,366 INFO L85 PathProgramCache]: Analyzing trace with hash 4995, now seen corresponding path program 1 times [2025-04-26 18:44:28,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:28,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154713565] [2025-04-26 18:44:28,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:28,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:28,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:28,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:28,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:28,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:28,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:28,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:28,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:28,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:28,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:28,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:28,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash 151796963, now seen corresponding path program 1 times [2025-04-26 18:44:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:28,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342182703] [2025-04-26 18:44:28,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:28,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:28,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:44:28,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:44:28,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:28,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:28,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:28,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:44:28,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:44:28,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:28,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:28,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:28,392 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:28,392 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:28,392 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:28,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:28,393 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:28,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:28,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:28,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:28,393 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:28,393 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:28,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:28,406 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:28,406 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:28,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:28,408 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 18:44:28,410 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 18:44:28,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:28,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:28,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:28,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:28,433 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 18:44:28,434 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 18:44:28,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:28,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:28,502 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:28,506 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 18:44:28,506 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:28,506 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:28,507 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:28,507 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:28,507 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:28,507 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,507 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:28,507 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:28,507 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:28,507 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:28,507 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:28,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:28,524 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:28,524 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:28,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:28,526 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 18:44:28,527 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 18:44:28,528 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 18:44:28,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:28,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:28,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:28,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:28,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:28,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:28,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:28,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:28,542 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:28,542 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:28,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:28,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:28,544 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 18:44:28,545 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 18:44:28,546 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:28,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:44:28,549 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:28,549 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:28,549 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 18:44:28,555 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 18:44:28,556 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:28,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:28,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:44:28,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:44:28,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:28,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:28,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:28,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:28,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:28,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:28,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:28,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:28,595 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:28,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:28,608 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 18:44:28,609 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 18:44:28,609 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154542 states and 628076 transitions. cyclomatic complexity: 482132 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 18:44:31,578 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154542 states and 628076 transitions. cyclomatic complexity: 482132. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 286579 states and 1119744 transitions. Complement of second has 6 states. [2025-04-26 18:44:31,579 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 18:44:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 18:44:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-26 18:44:31,579 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:44:31,579 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:31,579 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:44:31,579 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:31,579 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:44:31,579 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:31,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286579 states and 1119744 transitions. [2025-04-26 18:44:35,996 INFO L131 ngComponentsAnalysis]: Automaton has 1877 accepting balls. 3923 [2025-04-26 18:44:38,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286579 states to 219117 states and 850223 transitions. [2025-04-26 18:44:38,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57577 [2025-04-26 18:44:38,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60800 [2025-04-26 18:44:38,680 INFO L74 IsDeterministic]: Start isDeterministic. Operand 219117 states and 850223 transitions. [2025-04-26 18:44:38,680 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:38,680 INFO L218 hiAutomatonCegarLoop]: Abstraction has 219117 states and 850223 transitions. [2025-04-26 18:44:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219117 states and 850223 transitions.