/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 ../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:52:21,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:52:21,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:52:21,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:52:21,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:52:21,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:52:21,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:52:21,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:52:21,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:52:21,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:52:21,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:52:21,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:52:21,513 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:52:21,513 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:52:21,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:52:21,514 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:52:21,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:52:21,515 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:52:21,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:52:21,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:52:21,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:52:21,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:21,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:52:21,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:52:21,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:52:21,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:52:21,515 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:52:21,516 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:52:21,516 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:52:21,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:52:21,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:52:21,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:52:21,746 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:52:21,746 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:52:21,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl [2025-04-26 16:52:21,747 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/ForkInLoop02-Incrementer.bpl' [2025-04-26 16:52:21,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:52:21,760 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:52:21,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:21,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:52:21,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:52:21,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,783 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:52:21,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:21,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:52:21,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:52:21,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:52:21,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:52:21,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:52:21,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:52:21,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:52:21,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/1) ... [2025-04-26 16:52:21,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:21,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:21,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:21,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:52:21,853 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2025-04-26 16:52:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2025-04-26 16:52:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2025-04-26 16:52:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:52:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:52:21,854 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:52:21,885 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:52:21,886 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:52:21,937 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:52:21,937 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:52:21,946 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:52:21,946 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 16:52:21,947 INFO L201 PluginConnector]: Adding new model ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:21 BoogieIcfgContainer [2025-04-26 16:52:21,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:52:21,948 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:52:21,948 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:52:21,953 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:52:21,953 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:21,953 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:21" (1/2) ... [2025-04-26 16:52:21,954 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6984cc31 and model type ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:52:21, skipping insertion in model container [2025-04-26 16:52:21,954 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:21,954 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ForkInLoop02-Incrementer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:21" (2/2) ... [2025-04-26 16:52:21,955 INFO L376 chiAutomizerObserver]: Analyzing ICFG ForkInLoop02-Incrementer.bpl [2025-04-26 16:52:21,977 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:22,016 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:22,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:22,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:22,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:22,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:52:22,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 11 transitions, 26 flow [2025-04-26 16:52:22,068 INFO L116 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-04-26 16:52:22,072 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-26 16:52:22,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 12 events. 1/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 11 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 4. Up to 2 conditions per place. [2025-04-26 16:52:22,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 13 places, 11 transitions, 26 flow [2025-04-26 16:52:22,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 13 places, 11 transitions, 26 flow [2025-04-26 16:52:22,078 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 13 places, 11 transitions, 26 flow [2025-04-26 16:52:22,084 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:22,098 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 52#[fooFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:52:22,099 WARN L140 AmpleReduction]: Number of pruned transitions: 7 [2025-04-26 16:52:22,099 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:22,099 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:22,099 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:8 [2025-04-26 16:52:22,099 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:5 [2025-04-26 16:52:22,099 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:22,099 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:22,099 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:22,100 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (in total 15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:22,105 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:22,105 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:22,106 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:22,106 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:22,106 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:22,106 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:22,106 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:22,106 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:22,107 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (in total 15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:22,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 16:52:22,114 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:22,114 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:22,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:22,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:22,116 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:22,117 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (in total 15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:22,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 16:52:22,117 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:22,117 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:22,119 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:22,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:22,123 INFO L752 eck$LassoCheckResult]: Stem: "[18] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[14] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[28] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_newid_5) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_5} OutVars{fooThread1of1ForFork0_thidvar0=v_fooThread1of1ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_5} AuxVars[] AssignedVars[fooThread1of1ForFork0_thidvar0]" "[22] $Ultimate##0-->L31: Formula: (= (+ v_n_2 1) v_n_1) InVars {n=v_n_2} OutVars{n=v_n_1} AuxVars[] AssignedVars[n]" "[17] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[26] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[23] L31-->fooErr0ASSERT_VIOLATIONASSERT: Formula: (< 2 v_n_3) InVars {n=v_n_3} OutVars{n=v_n_3} AuxVars[] AssignedVars[]" [2025-04-26 16:52:22,125 INFO L754 eck$LassoCheckResult]: Loop: "[27] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:22,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash 965346679, now seen corresponding path program 1 times [2025-04-26 16:52:22,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:22,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588832321] [2025-04-26 16:52:22,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:22,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:22,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:22,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:22,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:52:22,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:52:22,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588832321] [2025-04-26 16:52:22,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588832321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:52:22,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:52:22,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:52:22,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412169185] [2025-04-26 16:52:22,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:52:22,247 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:52:22,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 1 times [2025-04-26 16:52:22,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:22,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034045744] [2025-04-26 16:52:22,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:22,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:22,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:22,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:22,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,250 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:22,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:22,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:22,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:52:22,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:52:22,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:52:22,301 INFO L87 Difference]: Start difference. First operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (in total 15), 13 states have internal predecessors, (15), 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 4 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:52:22,330 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-04-26 16:52:22,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 12 transitions. [2025-04-26 16:52:22,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:22,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 8 transitions. [2025-04-26 16:52:22,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-04-26 16:52:22,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-04-26 16:52:22,336 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8 states and 8 transitions. [2025-04-26 16:52:22,336 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:22,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-04-26 16:52:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 8 transitions. [2025-04-26 16:52:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-04-26 16:52:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.0) internal successors, (in total 8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-04-26 16:52:22,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-04-26 16:52:22,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:52:22,365 INFO L438 stractBuchiCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-04-26 16:52:22,366 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:52:22,366 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 8 transitions. [2025-04-26 16:52:22,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:22,366 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:22,366 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:22,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:22,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:22,378 INFO L752 eck$LassoCheckResult]: Stem: "[18] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[14] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[28] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_newid_5) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_5} OutVars{fooThread1of1ForFork0_thidvar0=v_fooThread1of1ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_5} AuxVars[] AssignedVars[fooThread1of1ForFork0_thidvar0]" "[22] $Ultimate##0-->L31: Formula: (= (+ v_n_2 1) v_n_1) InVars {n=v_n_2} OutVars{n=v_n_1} AuxVars[] AssignedVars[n]" "[17] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[26] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[24] L31-->fooFINAL: Formula: (<= v_n_4 2) InVars {n=v_n_4} OutVars{n=v_n_4} AuxVars[] AssignedVars[]" [2025-04-26 16:52:22,378 INFO L754 eck$LassoCheckResult]: Loop: "[27] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:22,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:22,379 INFO L85 PathProgramCache]: Analyzing trace with hash 965346680, now seen corresponding path program 1 times [2025-04-26 16:52:22,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:22,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460833579] [2025-04-26 16:52:22,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:22,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:22,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:22,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:22,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,395 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:22,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:22,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:22,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:22,401 INFO L85 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 2 times [2025-04-26 16:52:22,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:22,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887171088] [2025-04-26 16:52:22,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:52:22,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:22,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:22,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:22,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:52:22,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:22,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:22,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:22,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:22,404 INFO L85 PathProgramCache]: Analyzing trace with hash -139023965, now seen corresponding path program 1 times [2025-04-26 16:52:22,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:22,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3646822] [2025-04-26 16:52:22,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:22,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:22,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:22,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:22,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,410 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:22,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:22,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:22,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:22,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:22,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:22,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:22,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,490 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:22,493 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:22,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:52:22,503 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:22,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:22,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:22,506 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:22,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2025-04-26 16:52:22,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 42 flow [2025-04-26 16:52:22,524 INFO L116 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-04-26 16:52:22,524 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:52:22,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 19 events. 1/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 14. Up to 3 conditions per place. [2025-04-26 16:52:22,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 16 transitions, 42 flow [2025-04-26 16:52:22,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 42 flow [2025-04-26 16:52:22,525 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 20 places, 16 transitions, 42 flow [2025-04-26 16:52:22,525 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:22,554 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 63#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0]true [2025-04-26 16:52:22,554 WARN L140 AmpleReduction]: Number of pruned transitions: 15 [2025-04-26 16:52:22,554 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:22,554 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:22,555 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:22 [2025-04-26 16:52:22,555 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:11 [2025-04-26 16:52:22,555 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:22,555 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:22,555 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:22,555 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 34 states, 27 states have (on average 1.5185185185185186) internal successors, (in total 41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:22,555 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:22,555 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:22,555 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:22,555 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:22,555 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:22,555 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:22,555 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:22,555 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:22,555 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 27 states have (on average 1.5185185185185186) internal successors, (in total 41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:22,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:22,557 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:22,557 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:22,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-04-26 16:52:22,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:22,557 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:22,557 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 27 states have (on average 1.5185185185185186) internal successors, (in total 41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:22,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:22,558 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:22,558 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:22,558 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-04-26 16:52:22,558 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:22,559 INFO L752 eck$LassoCheckResult]: Stem: "[34] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[30] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[48] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_9 v_fooThread1of2ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_9} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_9, fooThread1of2ForFork0_thidvar0=v_fooThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork0_thidvar0]" "[33] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[49] L20-1-->$Ultimate##0: Formula: (= v_fooThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_newid_11) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_11} OutVars{fooThread2of2ForFork0_thidvar0=v_fooThread2of2ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_11} AuxVars[] AssignedVars[fooThread2of2ForFork0_thidvar0]" "[33] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[46] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:22,559 INFO L754 eck$LassoCheckResult]: Loop: "[47] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:22,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1537568080, now seen corresponding path program 1 times [2025-04-26 16:52:22,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:22,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392102081] [2025-04-26 16:52:22,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:22,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:22,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:22,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:22,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:22,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:22,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:22,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 1 times [2025-04-26 16:52:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:22,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779111991] [2025-04-26 16:52:22,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:22,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:22,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:22,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:22,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:22,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:22,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:22,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:22,570 INFO L85 PathProgramCache]: Analyzing trace with hash -419970177, now seen corresponding path program 1 times [2025-04-26 16:52:22,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:22,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498321447] [2025-04-26 16:52:22,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:22,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:22,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:22,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:22,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:22,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:22,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:22,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:22,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:22,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:22,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:22,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,617 WARN L166 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:22,622 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:22,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2025-04-26 16:52:22,632 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:22,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:22,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:22,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:22,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2025-04-26 16:52:22,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 21 transitions, 60 flow [2025-04-26 16:52:22,656 INFO L116 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-04-26 16:52:22,656 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-26 16:52:22,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 1/26 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2025-04-26 16:52:22,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 21 transitions, 60 flow [2025-04-26 16:52:22,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 21 transitions, 60 flow [2025-04-26 16:52:22,657 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 27 places, 21 transitions, 60 flow [2025-04-26 16:52:22,657 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:22,741 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 130#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [2025-04-26 16:52:22,741 WARN L140 AmpleReduction]: Number of pruned transitions: 99 [2025-04-26 16:52:22,741 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:22,741 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:22,741 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:84 [2025-04-26 16:52:22,741 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:62 [2025-04-26 16:52:22,742 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:22,742 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:22,742 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:22,742 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 147 states, 132 states have (on average 1.7424242424242424) internal successors, (in total 230), 146 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:22,742 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:22,742 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:22,742 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:22,742 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:22,742 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:22,742 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:22,742 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:22,742 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:22,743 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 147 states, 132 states have (on average 1.7424242424242424) internal successors, (in total 230), 146 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:22,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:22,748 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:22,748 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:22,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:22,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:22,748 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:22,749 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 147 states, 132 states have (on average 1.7424242424242424) internal successors, (in total 230), 146 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:22,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:22,753 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:22,753 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:22,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:22,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:22,753 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[67] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[89] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_16 v_fooThread1of3ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_16} OutVars{fooThread1of3ForFork0_thidvar0=v_fooThread1of3ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_16} AuxVars[] AssignedVars[fooThread1of3ForFork0_thidvar0]" "[70] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[90] L20-1-->$Ultimate##0: Formula: (= v_fooThread2of3ForFork0_thidvar0_2 v_ULTIMATE.start_newid_18) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_18} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_18, fooThread2of3ForFork0_thidvar0=v_fooThread2of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread2of3ForFork0_thidvar0]" "[70] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[91] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of3ForFork0_thidvar0_2 v_ULTIMATE.start_newid_20) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_20} OutVars{fooThread3of3ForFork0_thidvar0=v_fooThread3of3ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_20} AuxVars[] AssignedVars[fooThread3of3ForFork0_thidvar0]" "[70] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[87] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:22,753 INFO L754 eck$LassoCheckResult]: Loop: "[88] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:22,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash 600195478, now seen corresponding path program 1 times [2025-04-26 16:52:22,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:22,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236405229] [2025-04-26 16:52:22,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:22,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:22,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:22,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:22,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,765 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:22,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:22,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:22,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:22,770 INFO L85 PathProgramCache]: Analyzing trace with hash 119, now seen corresponding path program 1 times [2025-04-26 16:52:22,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:22,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372860215] [2025-04-26 16:52:22,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:22,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:22,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:22,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:22,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:22,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:22,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:22,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:22,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1426190722, now seen corresponding path program 1 times [2025-04-26 16:52:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:22,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915238779] [2025-04-26 16:52:22,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:22,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:22,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:52:22,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:52:22,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:52:22,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:52:22,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:22,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:22,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:22,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,843 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:22,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:22,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:22,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:22,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:22,852 WARN L166 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:22,856 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:22,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2025-04-26 16:52:22,866 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:22,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:22,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:22,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:22,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2025-04-26 16:52:22,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 80 flow [2025-04-26 16:52:22,891 INFO L116 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-04-26 16:52:22,891 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-26 16:52:22,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 33 events. 1/33 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 37. Up to 5 conditions per place. [2025-04-26 16:52:22,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 26 transitions, 80 flow [2025-04-26 16:52:22,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 26 transitions, 80 flow [2025-04-26 16:52:22,892 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 34 places, 26 transitions, 80 flow [2025-04-26 16:52:22,892 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:23,109 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 405#[$Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]true [2025-04-26 16:52:23,109 WARN L140 AmpleReduction]: Number of pruned transitions: 704 [2025-04-26 16:52:23,109 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:23,109 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:23,109 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:331 [2025-04-26 16:52:23,109 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:348 [2025-04-26 16:52:23,109 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:23,109 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:23,110 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:23,111 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 680 states, 649 states have (on average 1.9352850539291218) internal successors, (in total 1256), 679 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:23,111 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:23,111 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:23,111 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:23,111 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:23,111 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:23,111 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:23,112 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:23,112 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:23,112 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 680 states, 649 states have (on average 1.9352850539291218) internal successors, (in total 1256), 679 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:23,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:23,132 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:23,132 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:23,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:23,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:23,132 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:23,133 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 680 states, 649 states have (on average 1.9352850539291218) internal successors, (in total 1256), 679 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:23,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:23,139 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:23,139 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:23,140 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:23,140 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:23,140 INFO L752 eck$LassoCheckResult]: Stem: "[145] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[141] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[167] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_26 v_fooThread1of4ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_26} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_26, fooThread1of4ForFork0_thidvar0=v_fooThread1of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of4ForFork0_thidvar0]" "[144] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[168] L20-1-->$Ultimate##0: Formula: (= v_fooThread2of4ForFork0_thidvar0_2 v_ULTIMATE.start_newid_28) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_28} OutVars{fooThread2of4ForFork0_thidvar0=v_fooThread2of4ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_28} AuxVars[] AssignedVars[fooThread2of4ForFork0_thidvar0]" "[144] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[169] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of4ForFork0_thidvar0_2 v_ULTIMATE.start_newid_30) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_30} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_30, fooThread3of4ForFork0_thidvar0=v_fooThread3of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread3of4ForFork0_thidvar0]" "[144] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[170] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of4ForFork0_thidvar0_2 v_ULTIMATE.start_newid_32) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_32} OutVars{fooThread4of4ForFork0_thidvar0=v_fooThread4of4ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_32} AuxVars[] AssignedVars[fooThread4of4ForFork0_thidvar0]" "[144] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[165] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:23,140 INFO L754 eck$LassoCheckResult]: Loop: "[166] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:23,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash -950132790, now seen corresponding path program 1 times [2025-04-26 16:52:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:23,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759840246] [2025-04-26 16:52:23,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:23,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:52:23,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:52:23,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:23,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:52:23,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:52:23,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:23,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 197, now seen corresponding path program 1 times [2025-04-26 16:52:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:23,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424248728] [2025-04-26 16:52:23,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:23,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:23,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:23,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:23,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:23,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:23,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:23,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash 610654748, now seen corresponding path program 1 times [2025-04-26 16:52:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:23,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829026936] [2025-04-26 16:52:23,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:23,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:23,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:52:23,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:52:23,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:23,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:52:23,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:52:23,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:23,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:52:23,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:52:23,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:23,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:52:23,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:52:23,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,238 WARN L166 chiAutomizerObserver]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:23,242 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:23,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2025-04-26 16:52:23,252 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:23,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:23,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:23,254 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:23,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2025-04-26 16:52:23,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 102 flow [2025-04-26 16:52:23,275 INFO L116 PetriNetUnfolderBase]: 1/40 cut-off events. [2025-04-26 16:52:23,275 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-26 16:52:23,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 40 events. 1/40 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 50. Up to 6 conditions per place. [2025-04-26 16:52:23,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 31 transitions, 102 flow [2025-04-26 16:52:23,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 102 flow [2025-04-26 16:52:23,276 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 41 places, 31 transitions, 102 flow [2025-04-26 16:52:23,277 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:23,680 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1660#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:52:23,680 WARN L140 AmpleReduction]: Number of pruned transitions: 4610 [2025-04-26 16:52:23,680 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:23,680 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:23,680 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:1293 [2025-04-26 16:52:23,680 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1782 [2025-04-26 16:52:23,680 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:23,680 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:23,680 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:23,685 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 3076 states, 3013 states have (on average 2.114503816793893) internal successors, (in total 6371), 3075 states have internal predecessors, (6371), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:23,685 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:23,685 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:23,685 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:23,686 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:23,686 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:23,686 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:23,686 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:23,686 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:23,690 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3076 states, 3013 states have (on average 2.114503816793893) internal successors, (in total 6371), 3075 states have internal predecessors, (6371), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:23,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:23,719 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:23,719 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:23,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:23,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:23,720 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:23,725 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3076 states, 3013 states have (on average 2.114503816793893) internal successors, (in total 6371), 3075 states have internal predecessors, (6371), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:23,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:23,752 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:23,753 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:23,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:23,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:23,754 INFO L752 eck$LassoCheckResult]: Stem: "[272] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[268] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[298] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of5ForFork0_thidvar0_2 v_ULTIMATE.start_newid_39) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_39} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_39, fooThread1of5ForFork0_thidvar0=v_fooThread1of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of5ForFork0_thidvar0]" "[271] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[299] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_41 v_fooThread2of5ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_41} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_41, fooThread2of5ForFork0_thidvar0=v_fooThread2of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread2of5ForFork0_thidvar0]" "[271] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[300] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of5ForFork0_thidvar0_2 v_ULTIMATE.start_newid_43) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_43} OutVars{fooThread3of5ForFork0_thidvar0=v_fooThread3of5ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_43} AuxVars[] AssignedVars[fooThread3of5ForFork0_thidvar0]" "[271] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[301] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of5ForFork0_thidvar0_2 v_ULTIMATE.start_newid_45) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_45} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_45, fooThread4of5ForFork0_thidvar0=v_fooThread4of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread4of5ForFork0_thidvar0]" "[271] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[302] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_47 v_fooThread5of5ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_47} OutVars{fooThread5of5ForFork0_thidvar0=v_fooThread5of5ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_47} AuxVars[] AssignedVars[fooThread5of5ForFork0_thidvar0]" "[271] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[296] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:23,754 INFO L754 eck$LassoCheckResult]: Loop: "[297] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:23,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1201729596, now seen corresponding path program 1 times [2025-04-26 16:52:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:23,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583528855] [2025-04-26 16:52:23,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:23,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:23,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:52:23,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:52:23,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:23,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:52:23,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:52:23,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:23,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:23,772 INFO L85 PathProgramCache]: Analyzing trace with hash 328, now seen corresponding path program 1 times [2025-04-26 16:52:23,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:23,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177078182] [2025-04-26 16:52:23,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:23,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:23,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:23,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:23,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:23,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:23,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:23,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:23,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1401087891, now seen corresponding path program 1 times [2025-04-26 16:52:23,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:23,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191180293] [2025-04-26 16:52:23,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:23,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:52:23,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:52:23,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:23,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:52:23,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:52:23,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:23,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:52:23,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:52:23,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:23,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:52:23,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:52:23,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:23,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:23,858 WARN L166 chiAutomizerObserver]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:23,863 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:23,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2025-04-26 16:52:23,872 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:23,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:23,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:23,874 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:23,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2025-04-26 16:52:23,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 126 flow [2025-04-26 16:52:23,896 INFO L116 PetriNetUnfolderBase]: 1/47 cut-off events. [2025-04-26 16:52:23,897 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-26 16:52:23,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 47 events. 1/47 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 64. Up to 7 conditions per place. [2025-04-26 16:52:23,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 36 transitions, 126 flow [2025-04-26 16:52:23,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 36 transitions, 126 flow [2025-04-26 16:52:23,898 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 48 places, 36 transitions, 126 flow [2025-04-26 16:52:23,899 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:25,337 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7645#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0]true [2025-04-26 16:52:25,338 WARN L140 AmpleReduction]: Number of pruned transitions: 28042 [2025-04-26 16:52:25,338 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:25,338 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:25,338 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:5096 [2025-04-26 16:52:25,338 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:8642 [2025-04-26 16:52:25,338 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:25,338 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:25,338 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:25,372 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 13739 states, 13612 states have (on average 2.277769615045548) internal successors, (in total 31005), 13738 states have internal predecessors, (31005), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:25,372 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:25,372 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:25,372 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:25,372 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:25,372 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:25,372 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:25,373 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:25,373 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:25,402 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13739 states, 13612 states have (on average 2.277769615045548) internal successors, (in total 31005), 13738 states have internal predecessors, (31005), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:25,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:25,547 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:25,547 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:25,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:25,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:25,548 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:25,566 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13739 states, 13612 states have (on average 2.277769615045548) internal successors, (in total 31005), 13738 states have internal predecessors, (31005), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:25,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:25,699 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:25,699 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:25,699 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:25,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:25,700 INFO L752 eck$LassoCheckResult]: Stem: "[468] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[464] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[498] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_55) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_55} OutVars{fooThread1of6ForFork0_thidvar0=v_fooThread1of6ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_55} AuxVars[] AssignedVars[fooThread1of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[499] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_57 v_fooThread2of6ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_57} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_57, fooThread2of6ForFork0_thidvar0=v_fooThread2of6ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread2of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[500] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_59) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_59} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_59, fooThread3of6ForFork0_thidvar0=v_fooThread3of6ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread3of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[501] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_61) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_61} OutVars{fooThread4of6ForFork0_thidvar0=v_fooThread4of6ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_61} AuxVars[] AssignedVars[fooThread4of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[502] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_63 v_fooThread5of6ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_63} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_63, fooThread5of6ForFork0_thidvar0=v_fooThread5of6ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread5of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[503] L20-1-->$Ultimate##0: Formula: (= v_fooThread6of6ForFork0_thidvar0_2 v_ULTIMATE.start_newid_65) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_65} OutVars{fooThread6of6ForFork0_thidvar0=v_fooThread6of6ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_65} AuxVars[] AssignedVars[fooThread6of6ForFork0_thidvar0]" "[467] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[496] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:25,700 INFO L754 eck$LassoCheckResult]: Loop: "[497] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:25,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:25,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1036479964, now seen corresponding path program 1 times [2025-04-26 16:52:25,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:25,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824365473] [2025-04-26 16:52:25,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:25,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:52:25,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:52:25,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:25,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:25,707 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:25,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:52:25,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:52:25,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:25,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:25,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:25,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash 528, now seen corresponding path program 1 times [2025-04-26 16:52:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:25,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506633645] [2025-04-26 16:52:25,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:25,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:25,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:25,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:25,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:25,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:25,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:25,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:25,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:25,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:25,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:25,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:25,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:25,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2066108309, now seen corresponding path program 1 times [2025-04-26 16:52:25,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:25,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649235034] [2025-04-26 16:52:25,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:25,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:25,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:52:25,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:52:25,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:25,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:25,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:25,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:52:25,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:52:25,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:25,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:25,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:25,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:52:25,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:52:25,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:25,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:25,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:25,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:52:25,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:52:25,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:25,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:25,812 WARN L166 chiAutomizerObserver]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:25,816 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:25,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:25,824 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:25,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:25,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:25,826 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:25,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2025-04-26 16:52:25,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 41 transitions, 152 flow [2025-04-26 16:52:25,849 INFO L116 PetriNetUnfolderBase]: 1/54 cut-off events. [2025-04-26 16:52:25,849 INFO L117 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-04-26 16:52:25,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 54 events. 1/54 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 79. Up to 8 conditions per place. [2025-04-26 16:52:25,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 41 transitions, 152 flow [2025-04-26 16:52:25,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 41 transitions, 152 flow [2025-04-26 16:52:25,850 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 55 places, 41 transitions, 152 flow [2025-04-26 16:52:25,851 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:31,069 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 36368#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [2025-04-26 16:52:31,070 WARN L140 AmpleReduction]: Number of pruned transitions: 159295 [2025-04-26 16:52:31,070 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:31,070 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:31,070 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:20304 [2025-04-26 16:52:31,070 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:40274 [2025-04-26 16:52:31,070 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:31,070 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:31,070 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:31,185 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 60579 states, 60324 states have (on average 2.42394403554141) internal successors, (in total 146222), 60578 states have internal predecessors, (146222), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:31,185 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:31,185 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:31,185 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:31,185 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:31,185 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:31,185 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:31,185 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:31,185 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:31,278 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60579 states, 60324 states have (on average 2.42394403554141) internal successors, (in total 146222), 60578 states have internal predecessors, (146222), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:31,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:31,919 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:31,919 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:31,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:31,920 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:31,920 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:31,999 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60579 states, 60324 states have (on average 2.42394403554141) internal successors, (in total 146222), 60578 states have internal predecessors, (146222), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:32,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:32,610 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:32,610 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:32,610 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:32,611 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:32,611 INFO L752 eck$LassoCheckResult]: Stem: "[749] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[745] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[783] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_74) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_74} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_74, fooThread1of7ForFork0_thidvar0=v_fooThread1of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[784] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_76 v_fooThread2of7ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_76} OutVars{fooThread2of7ForFork0_thidvar0=v_fooThread2of7ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_76} AuxVars[] AssignedVars[fooThread2of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[785] L20-1-->$Ultimate##0: Formula: (= v_fooThread3of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_78) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_78} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_78, fooThread3of7ForFork0_thidvar0=v_fooThread3of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread3of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[786] L20-1-->$Ultimate##0: Formula: (= v_fooThread4of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_80) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_80} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_80, fooThread4of7ForFork0_thidvar0=v_fooThread4of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread4of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[787] L20-1-->$Ultimate##0: Formula: (= v_fooThread5of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_82) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_82} OutVars{fooThread5of7ForFork0_thidvar0=v_fooThread5of7ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_82} AuxVars[] AssignedVars[fooThread5of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[788] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_84 v_fooThread6of7ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_84} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_84, fooThread6of7ForFork0_thidvar0=v_fooThread6of7ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread6of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[789] L20-1-->$Ultimate##0: Formula: (= v_fooThread7of7ForFork0_thidvar0_2 v_ULTIMATE.start_newid_86) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_86} OutVars{fooThread7of7ForFork0_thidvar0=v_fooThread7of7ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_86} AuxVars[] AssignedVars[fooThread7of7ForFork0_thidvar0]" "[748] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[781] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:32,611 INFO L754 eck$LassoCheckResult]: Loop: "[782] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:32,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash -832484454, now seen corresponding path program 1 times [2025-04-26 16:52:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:32,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259336745] [2025-04-26 16:52:32,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:32,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:32,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:52:32,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:52:32,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:32,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:32,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:32,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:52:32,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:52:32,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:32,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:32,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:32,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:32,624 INFO L85 PathProgramCache]: Analyzing trace with hash 813, now seen corresponding path program 1 times [2025-04-26 16:52:32,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:32,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81207452] [2025-04-26 16:52:32,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:32,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:32,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:32,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:32,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:32,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:32,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:32,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:32,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:32,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:32,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:32,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:32,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -37213516, now seen corresponding path program 1 times [2025-04-26 16:52:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:32,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388499980] [2025-04-26 16:52:32,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:32,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:32,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:52:32,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:52:32,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:32,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:32,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:32,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:52:32,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:52:32,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:32,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:32,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:32,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:52:32,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:52:32,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:32,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:32,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:32,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:52:32,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:52:32,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:32,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:32,718 WARN L166 chiAutomizerObserver]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:32,722 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:32,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:32,732 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:32,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:32,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:32,735 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:32,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2025-04-26 16:52:32,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 46 transitions, 180 flow [2025-04-26 16:52:32,759 INFO L116 PetriNetUnfolderBase]: 1/61 cut-off events. [2025-04-26 16:52:32,760 INFO L117 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-04-26 16:52:32,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 61 events. 1/61 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 132 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 95. Up to 9 conditions per place. [2025-04-26 16:52:32,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 46 transitions, 180 flow [2025-04-26 16:52:32,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 46 transitions, 180 flow [2025-04-26 16:52:32,761 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 62 places, 46 transitions, 180 flow [2025-04-26 16:52:32,761 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:03,104 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 172793#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]true [2025-04-26 16:53:03,105 WARN L140 AmpleReduction]: Number of pruned transitions: 860069 [2025-04-26 16:53:03,105 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:53:03,105 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:53:03,105 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:81567 [2025-04-26 16:53:03,105 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:183143 [2025-04-26 16:53:03,105 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:53:03,105 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:53:03,105 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:03,756 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 264711 states, 264200 states have (on average 2.5525132475397427) internal successors, (in total 674374), 264710 states have internal predecessors, (674374), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:03,756 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:03,756 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:03,756 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:03,756 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:03,756 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:03,756 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:03,756 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:03,756 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:04,072 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 264711 states, 264200 states have (on average 2.5525132475397427) internal successors, (in total 674374), 264710 states have internal predecessors, (674374), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:07,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:53:07,627 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:07,627 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:07,627 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:07,627 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:53:07,627 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:07,967 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 264711 states, 264200 states have (on average 2.5525132475397427) internal successors, (in total 674374), 264710 states have internal predecessors, (674374), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:11,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:53:11,339 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:11,339 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:11,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:11,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:53:11,340 INFO L752 eck$LassoCheckResult]: Stem: "[1131] $Ultimate##0-->L18: Formula: (= v_ULTIMATE.start_newid_1 0) InVars {} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_1} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[1127] L18-->L20-1: Formula: (= v_n_5 0) InVars {} OutVars{n=v_n_5} AuxVars[] AssignedVars[n]" "[1169] L20-1-->$Ultimate##0: Formula: (= v_fooThread1of8ForFork0_thidvar0_2 v_ULTIMATE.start_newid_96) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_96} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_96, fooThread1of8ForFork0_thidvar0=v_fooThread1of8ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of8ForFork0_thidvar0]" "[1130] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[1170] L20-1-->$Ultimate##0: Formula: (= v_fooThread2of8ForFork0_thidvar0_2 v_ULTIMATE.start_newid_98) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_98} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_98, fooThread2of8ForFork0_thidvar0=v_fooThread2of8ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread2of8ForFork0_thidvar0]" "[1130] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[1171] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_100 v_fooThread3of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_100} OutVars{fooThread3of8ForFork0_thidvar0=v_fooThread3of8ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_100} AuxVars[] AssignedVars[fooThread3of8ForFork0_thidvar0]" "[1130] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[1172] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_102 v_fooThread4of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_102} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_102, fooThread4of8ForFork0_thidvar0=v_fooThread4of8ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread4of8ForFork0_thidvar0]" "[1130] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[1173] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_104 v_fooThread5of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_104} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_104, fooThread5of8ForFork0_thidvar0=v_fooThread5of8ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread5of8ForFork0_thidvar0]" "[1130] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[1174] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_106 v_fooThread6of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_106} OutVars{fooThread6of8ForFork0_thidvar0=v_fooThread6of8ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_106} AuxVars[] AssignedVars[fooThread6of8ForFork0_thidvar0]" "[1130] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[1175] L20-1-->$Ultimate##0: Formula: (= v_fooThread7of8ForFork0_thidvar0_2 v_ULTIMATE.start_newid_108) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_108} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_108, fooThread7of8ForFork0_thidvar0=v_fooThread7of8ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread7of8ForFork0_thidvar0]" "[1130] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[1176] L20-1-->$Ultimate##0: Formula: (= v_ULTIMATE.start_newid_110 v_fooThread8of8ForFork0_thidvar0_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_110} OutVars{fooThread8of8ForFork0_thidvar0=v_fooThread8of8ForFork0_thidvar0_2, ULTIMATE.start_newid=v_ULTIMATE.start_newid_110} AuxVars[] AssignedVars[fooThread8of8ForFork0_thidvar0]" "[1130] L21-->L20-1: Formula: (= (+ v_ULTIMATE.start_newid_3 1) v_ULTIMATE.start_newid_2) InVars {ULTIMATE.start_newid=v_ULTIMATE.start_newid_3} OutVars{ULTIMATE.start_newid=v_ULTIMATE.start_newid_2} AuxVars[] AssignedVars[ULTIMATE.start_newid]" "[1167] L20-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:53:11,340 INFO L754 eck$LassoCheckResult]: Loop: "[1168] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:53:11,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash -940428186, now seen corresponding path program 1 times [2025-04-26 16:53:11,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:11,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526248793] [2025-04-26 16:53:11,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:11,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:11,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:53:11,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:53:11,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:11,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:53:11,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:53:11,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:11,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:11,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1199, now seen corresponding path program 1 times [2025-04-26 16:53:11,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:11,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704239998] [2025-04-26 16:53:11,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:11,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:11,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:53:11,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:53:11,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:11,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:53:11,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:53:11,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:11,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:11,358 INFO L85 PathProgramCache]: Analyzing trace with hash 911498474, now seen corresponding path program 1 times [2025-04-26 16:53:11,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:11,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488202692] [2025-04-26 16:53:11,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:11,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:53:11,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:53:11,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:11,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:53:11,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:53:11,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:11,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:53:11,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:53:11,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,462 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:11,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:53:11,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:53:11,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:11,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:11,472 WARN L166 chiAutomizerObserver]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:53:11,478 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:53:11,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Ended with exit code 0 [2025-04-26 16:53:11,486 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:11,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:11,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:11,488 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:11,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2025-04-26 16:53:11,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 51 transitions, 210 flow [2025-04-26 16:53:11,518 INFO L116 PetriNetUnfolderBase]: 1/68 cut-off events. [2025-04-26 16:53:11,518 INFO L117 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-04-26 16:53:11,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 68 events. 1/68 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 112. Up to 10 conditions per place. [2025-04-26 16:53:11,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 51 transitions, 210 flow [2025-04-26 16:53:11,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 51 transitions, 210 flow [2025-04-26 16:53:11,520 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 69 places, 51 transitions, 210 flow [2025-04-26 16:53:11,520 INFO L135 AmpleReduction]: Starting ample reduction