Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107900413.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is LamportFastMutEx-PT-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107900413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 14K Mar 7 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 7 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 7 16:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 140K Mar 7 16:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.6K Mar 15 11:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Mar 15 11:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 15 11:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 15 11:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Mar 7 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Mar 7 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Mar 7 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 172K Mar 7 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 11:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Mar 15 11:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 114K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779876712279

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-27 10:11:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 10:11:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 10:11:54] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2026-05-27 10:11:54] [INFO ] Transformed 135 places.
[2026-05-27 10:11:54] [INFO ] Transformed 230 transitions.
[2026-05-27 10:11:54] [INFO ] Found NUPN structural information;
[2026-05-27 10:11:54] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4]
[2026-05-27 10:11:54] [INFO ] Parsed PT model containing 135 places and 230 transitions and 990 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
FORMULA LamportFastMutEx-PT-4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 4, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1] Max Struct:[4, 4, 4, 4, 4, 4, 16, 1, 1, 1, 1, 1, 1, 1]
FORMULA LamportFastMutEx-PT-4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 16, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4424787385616803232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14228281154984106988.kers'
[2026-05-27 10:11:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4424787385616803232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14228281154984106988.kers]
Normalized transition count is 144 out of 180 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 144 rows 98 cols 432 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 10:11:54] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14228281154984106988.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 16, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 112 ms. (88 steps per ms)
FORMULA LamportFastMutEx-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (12 resets) in 220 ms. (271 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1, 3, 3, 3, 12] Max Struct:[4, 4, 4, 4, 4, 16]
[2026-05-27 10:11:55] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13713290928503933297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1405657751402326828.kers'
[2026-05-27 10:11:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13713290928503933297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1405657751402326828.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 144 rows 98 cols 432 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-27 10:11:55] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1405657751402326828.kers
Total runtime 2 ms.
[2026-05-27 10:11:55] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2026-05-27 10:11:55] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2026-05-27 10:11:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-27 10:11:55] [INFO ] [Real]Added 40 Read/Feed constraints in 17 ms returned sat
[2026-05-27 10:11:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 10:11:56] [INFO ] [Nat]Absence check using 26 positive place invariants in 25 ms returned sat
[2026-05-27 10:11:56] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2026-05-27 10:11:56] [INFO ] [Nat]Added 40 Read/Feed constraints in 31 ms returned sat
[2026-05-27 10:11:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1185 ms
[2026-05-27 10:11:57] [INFO ] [Real]Absence check using 26 positive place invariants in 19 ms returned sat
[2026-05-27 10:11:57] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2026-05-27 10:11:57] [INFO ] [Real]Added 40 Read/Feed constraints in 11 ms returned sat
[2026-05-27 10:11:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 10:11:57] [INFO ] [Nat]Absence check using 26 positive place invariants in 19 ms returned sat
[2026-05-27 10:11:57] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-27 10:11:57] [INFO ] [Nat]Added 40 Read/Feed constraints in 21 ms returned sat
[2026-05-27 10:11:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2026-05-27 10:11:58] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 27 ms.
[2026-05-27 10:11:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2026-05-27 10:11:58] [INFO ] Added : 63 causal constraints over 14 iterations in 768 ms. Result :sat
Minimization took 135 ms.
[2026-05-27 10:11:59] [INFO ] [Real]Absence check using 26 positive place invariants in 16 ms returned sat
[2026-05-27 10:11:59] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2026-05-27 10:11:59] [INFO ] [Real]Added 40 Read/Feed constraints in 11 ms returned sat
[2026-05-27 10:11:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 10:11:59] [INFO ] [Nat]Absence check using 26 positive place invariants in 15 ms returned sat
[2026-05-27 10:11:59] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-27 10:11:59] [INFO ] [Nat]Added 40 Read/Feed constraints in 26 ms returned sat
[2026-05-27 10:11:59] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 29 ms.
[2026-05-27 10:11:59] [INFO ] Added : 35 causal constraints over 8 iterations in 242 ms. Result :sat
Minimization took 85 ms.
[2026-05-27 10:11:59] [INFO ] [Real]Absence check using 26 positive place invariants in 18 ms returned sat
[2026-05-27 10:12:00] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-27 10:12:00] [INFO ] [Real]Added 40 Read/Feed constraints in 12 ms returned sat
[2026-05-27 10:12:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 10:12:00] [INFO ] [Nat]Absence check using 26 positive place invariants in 18 ms returned sat
[2026-05-27 10:12:00] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-27 10:12:00] [INFO ] [Nat]Added 40 Read/Feed constraints in 29 ms returned sat
[2026-05-27 10:12:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 920 ms
[2026-05-27 10:12:01] [INFO ] [Real]Absence check using 26 positive place invariants in 15 ms returned sat
[2026-05-27 10:12:01] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-27 10:12:01] [INFO ] [Real]Added 40 Read/Feed constraints in 13 ms returned sat
[2026-05-27 10:12:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 10:12:01] [INFO ] [Nat]Absence check using 26 positive place invariants in 15 ms returned sat
[2026-05-27 10:12:01] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-27 10:12:01] [INFO ] [Nat]Added 40 Read/Feed constraints in 18 ms returned sat
[2026-05-27 10:12:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 711 ms
[2026-05-27 10:12:02] [INFO ] [Real]Absence check using 26 positive place invariants in 16 ms returned sat
[2026-05-27 10:12:02] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-27 10:12:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 10:12:02] [INFO ] [Nat]Absence check using 26 positive place invariants in 18 ms returned sat
[2026-05-27 10:12:02] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-27 10:12:02] [INFO ] [Nat]Added 40 Read/Feed constraints in 34 ms returned sat
[2026-05-27 10:12:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 738 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1, 3, 3, 3, 12] Max Struct:[3, 4, 4, 3, 3, 12]
FORMULA LamportFastMutEx-PT-4-UpperBounds-07 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 180/180 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 176
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 98 transition count 172
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 94 transition count 172
Applied a total of 16 rules in 68 ms. Remains 94 /102 variables (removed 8) and now considering 172/180 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 94/102 places, 172/180 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2158383321360726907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5504024069963448928.kers'
[2026-05-27 10:12:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2158383321360726907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5504024069963448928.kers]
Normalized transition count is 136 out of 172 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 136 rows 90 cols 448 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-27 10:12:03] [INFO ] Computed 26 invariants in 2 ms
Computed 26 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5504024069963448928.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1714 ms. (583 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 918 ms. (1088 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2026-05-27 10:12:06] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5815694554772621280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1643396112923341837.kers'
[2026-05-27 10:12:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5815694554772621280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1643396112923341837.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 136 rows 90 cols 448 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-27 10:12:06] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1643396112923341837.kers
Total runtime 2 ms.
[2026-05-27 10:12:06] [INFO ] [Real]Absence check using 26 positive place invariants in 15 ms returned sat
[2026-05-27 10:12:06] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-27 10:12:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-27 10:12:06] [INFO ] [Real]Added 40 Read/Feed constraints in 10 ms returned sat
[2026-05-27 10:12:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 10:12:06] [INFO ] [Nat]Absence check using 26 positive place invariants in 15 ms returned sat
[2026-05-27 10:12:06] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-27 10:12:06] [INFO ] [Nat]Added 40 Read/Feed constraints in 14 ms returned sat
[2026-05-27 10:12:06] [INFO ] Computed and/alt/rep : 116/496/116 causal constraints (skipped 16 transitions) in 16 ms.
[2026-05-27 10:12:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 416 ms
[2026-05-27 10:12:07] [INFO ] Added : 45 causal constraints over 10 iterations in 705 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 14 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 94/94 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 14 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2026-05-27 10:12:07] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2026-05-27 10:12:07] [INFO ] Invariant cache hit.
[2026-05-27 10:12:08] [INFO ] Implicit Places using invariants in 278 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 281 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/94 places, 172/172 transitions.
Applied a total of 0 rules in 12 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 313 ms. Remains : 90/94 places, 172/172 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7207594030551014035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9537560941201538448.kers'
[2026-05-27 10:12:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7207594030551014035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9537560941201538448.kers]
Normalized transition count is 136 out of 172 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 136 rows 86 cols 432 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-27 10:12:08] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9537560941201538448.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1945 ms. (513 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 722 ms. (1383 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2026-05-27 10:12:10] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6137077349196750520.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1524471994089908553.kers'
[2026-05-27 10:12:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6137077349196750520.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1524471994089908553.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 136 rows 86 cols 432 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-27 10:12:10] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1524471994089908553.kers
Total runtime 1 ms.
[2026-05-27 10:12:10] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2026-05-27 10:12:10] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-27 10:12:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-27 10:12:10] [INFO ] [Real]Added 24 Read/Feed constraints in 7 ms returned sat
[2026-05-27 10:12:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 10:12:11] [INFO ] [Nat]Absence check using 22 positive place invariants in 16 ms returned sat
[2026-05-27 10:12:11] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2026-05-27 10:12:11] [INFO ] [Nat]Added 24 Read/Feed constraints in 9 ms returned sat
[2026-05-27 10:12:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2026-05-27 10:12:11] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 19 ms.
[2026-05-27 10:12:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2026-05-27 10:12:11] [INFO ] Added : 54 causal constraints over 11 iterations in 549 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 14 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 13 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2026-05-27 10:12:12] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2026-05-27 10:12:12] [INFO ] Invariant cache hit.
[2026-05-27 10:12:12] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-27 10:12:12] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2026-05-27 10:12:12] [INFO ] Invariant cache hit.
[2026-05-27 10:12:12] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-27 10:12:12] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2026-05-27 10:12:12] [INFO ] Redundant transitions in 9 ms returned []
Running 168 sub problems to find dead transitions.
[2026-05-27 10:12:12] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2026-05-27 10:12:12] [INFO ] Invariant cache hit.
[2026-05-27 10:12:12] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 22/112 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 20/132 constraints. Problems are: Problem set: 22 solved, 146 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/152 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 13/165 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 2/167 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/168 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/169 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/169 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 136/226 variables, 90/259 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 24/283 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 3/286 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 1/287 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 1/288 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 0/288 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 15 (OVERLAPS) 0/226 variables, 0/288 constraints. Problems are: Problem set: 24 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 288 constraints, problems are : Problem set: 24 solved, 144 unsolved in 27150 ms.
Refiners :[Domain max(s): 90/90 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 6/92 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 41/133 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/133 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 4/90 variables, 16/149 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 4/153 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 21/174 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/175 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/175 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 136/226 variables, 90/265 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 24/289 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 144/433 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 1/434 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 3/437 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 5/442 constraints. Problems are: Problem set: 24 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 1/443 constraints. Problems are: Problem set: 24 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 444 constraints, problems are : Problem set: 24 solved, 144 unsolved in 30025 ms.
Refiners :[Domain max(s): 90/90 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 144/168 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57338ms problems are : Problem set: 24 solved, 144 unsolved
Search for dead transitions found 24 dead transitions in 57355ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/90 places, 148/172 transitions.
Applied a total of 0 rules in 12 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2026-05-27 10:13:10] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 58056 ms. Remains : 90/90 places, 148/172 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7557257032894882268.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10500363871843987510.kers'
[2026-05-27 10:13:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7557257032894882268.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10500363871843987510.kers]
Normalized transition count is 120 out of 148 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 120 rows 86 cols 388 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-27 10:13:10] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10500363871843987510.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1869 ms. (534 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 567 ms. (1760 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[4]
[2026-05-27 10:13:12] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5044907629973102474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5400389496814642785.kers'
[2026-05-27 10:13:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5044907629973102474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5400389496814642785.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 120 rows 86 cols 388 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-27 10:13:12] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5400389496814642785.kers
Total runtime 2 ms.
[2026-05-27 10:13:12] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned sat
[2026-05-27 10:13:12] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-05-27 10:13:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 10:13:12] [INFO ] [Real]Added 20 Read/Feed constraints in 9 ms returned sat
[2026-05-27 10:13:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 10:13:12] [INFO ] [Nat]Absence check using 22 positive place invariants in 17 ms returned sat
[2026-05-27 10:13:12] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2026-05-27 10:13:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 12 ms returned sat
[2026-05-27 10:13:12] [INFO ] Computed and/alt/rep : 104/420/104 causal constraints (skipped 12 transitions) in 18 ms.
[2026-05-27 10:13:13] [INFO ] Added : 49 causal constraints over 10 iterations in 221 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[4]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 12 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 90/90 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 148/148 transitions.
Applied a total of 0 rules in 12 ms. Remains 90 /90 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2026-05-27 10:13:13] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2026-05-27 10:13:13] [INFO ] Invariant cache hit.
[2026-05-27 10:13:13] [INFO ] Implicit Places using invariants in 210 ms returned []
[2026-05-27 10:13:13] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2026-05-27 10:13:13] [INFO ] Invariant cache hit.
[2026-05-27 10:13:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-27 10:13:14] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2026-05-27 10:13:14] [INFO ] Redundant transitions in 8 ms returned []
Running 144 sub problems to find dead transitions.
[2026-05-27 10:13:14] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2026-05-27 10:13:14] [INFO ] Invariant cache hit.
[2026-05-27 10:13:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 4/90 variables, 16/108 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 16/168 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 120/210 variables, 90/261 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 281 constraints, problems are : Problem set: 0 solved, 144 unsolved in 20763 ms.
Refiners :[Domain max(s): 90/90 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 4/90 variables, 16/146 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 21/171 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 120/210 variables, 90/261 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 144/425 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 10/436 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 6/442 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/210 variables, and 442 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30025 ms.
Refiners :[Domain max(s): 90/90 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 90/90 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50856ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 50860ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51496 ms. Remains : 90/90 places, 148/148 transitions.
RANDOM walk for 40000 steps (8 resets) in 1299 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 563 ms. (70 steps per ms) remains 2/2 properties
[2026-05-27 10:14:05] [INFO ] Flatten gal took : 136 ms
[2026-05-27 10:14:05] [INFO ] Flatten gal took : 118 ms
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 2/2 properties
[2026-05-27 10:14:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2775336188119494379.gal : 22 ms
[2026-05-27 10:14:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4538504713040561461.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2775336188119494379.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4538504713040561461.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4538504713040561461.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 16
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 24
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :24 after 83
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :83 after 176
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :176 after 1367
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1367 after 3308
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3308 after 11037
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :70336 after 105471
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :105471 after 364090
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :652189 after 824356
Interrupted probabilistic random walk after 688343 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 2
Probabilistic random walk after 688343 steps, saw 176497 distinct states, run finished after 3007 ms. (steps per millisecond=228 ) properties seen :0
[2026-05-27 10:14:08] [INFO ] Flow matrix only has 120 transitions (discarded 28 similar events)
[2026-05-27 10:14:08] [INFO ] Invariant cache hit.
[2026-05-27 10:14:08] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.4985e+06,2.95966,69512,2,12452,20,226520,8,0,513,275015,0
Total reachable state count : 1498496

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

At refinement iteration 2 (OVERLAPS) 68/72 variables, 16/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,2.96718,69512,1,0,20,226520,8,0,520,275015,0
Invariant property MIN0 is true.

At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 68/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,2.97502,69512,1,0,20,226520,8,0,526,275015,0
After SMT solving in domain Real declared 72/210 variables, and 88 constraints, problems are : Problem set: 2 solved, 0 unsolved in 67 ms.
Refiners :[Domain max(s): 72/90 constraints, Positive P Invariants (semi-flows): 16/22 constraints, State Equation: 0/90 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
FORMULA LamportFastMutEx-PT-4-UpperBounds-01 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4342537404306047777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3314425004455954676.kers'
[2026-05-27 10:14:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4342537404306047777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3314425004455954676.kers]
Normalized transition count is 120 out of 148 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 120 rows 86 cols 388 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-27 10:14:08] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3314425004455954676.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (2 resets) in 1438 ms. (694 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 135796 ms.

BK_STOP 1779876850255

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-4, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107900413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-4.tgz
mv LamportFastMutEx-PT-4 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;