About the Execution of ITS-Tools for BridgeAndVehicles-PT-V50P50N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.775 | 3600000.00 | 3325340.00 | 291401.40 | 50 50 ? 1 1 ? ? 50 1 1 1 ? ? 50 1 1 | normal |
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.r034-tall-177946841900261.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 BridgeAndVehicles-PT-V50P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900261
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.1M
-rw-r--r-- 1 mcc users 20K Mar 5 08:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 5 08:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 294K Mar 5 08:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Mar 5 08:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.3K Mar 15 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 62K Mar 15 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 178K Mar 15 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Mar 5 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Mar 5 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 652K Mar 5 08:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.5M Mar 5 08:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 15 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Mar 15 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 BridgeAndVehicles-PT-V50P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779556539822
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-23 17:15:40] [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-23 17:15:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:15:41] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2026-05-23 17:15:41] [INFO ] Transformed 138 places.
[2026-05-23 17:15:41] [INFO ] Transformed 2348 transitions.
[2026-05-23 17:15:41] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 12
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 1, 0, 50, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 1, 0, 50, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15810135163753068795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-199276884235839361.kers'
[2026-05-23 17:15:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15810135163753068795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-199276884235839361.kers]
Normalized transition count is 290 out of 2348 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 138 cols 1450 entries
Finished phase 1 with 31 SingleSign rule and 100 generalized
[2026-05-23 17:15:41] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-199276884235839361.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 50, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 2, 50, 50, 1, 1, 1, 1, 1]
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (23 resets) in 253 ms. (39 steps per ms)
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (27 resets) in 100 ms. (297 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 1, 20] Max Struct:[50, 2, 50]
[2026-05-23 17:15:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11993591914386664061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10036067082655141791.kers'
[2026-05-23 17:15:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11993591914386664061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10036067082655141791.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 138 cols 1450 entries
Finished phase 1 with 31 SingleSign rule and 100 generalized
[2026-05-23 17:15:41] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10036067082655141791.kers
Total runtime 3 ms.
[2026-05-23 17:15:41] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-23 17:15:41] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2026-05-23 17:15:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:15:42] [INFO ] [Real]Added 42 Read/Feed constraints in 27 ms returned sat
[2026-05-23 17:15:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:15:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-23 17:15:42] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-23 17:15:42] [INFO ] [Nat]Added 42 Read/Feed constraints in 37 ms returned sat
[2026-05-23 17:15:42] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 140 ms.
[2026-05-23 17:15:42] [INFO ] Added : 22 causal constraints over 20 iterations in 604 ms. Result :sat
Minimization took 252 ms.
[2026-05-23 17:15:43] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2026-05-23 17:15:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-23 17:15:43] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-23 17:15:43] [INFO ] [Real]Added 42 Read/Feed constraints in 18 ms returned sat
[2026-05-23 17:15:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:15:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-23 17:15:43] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-23 17:15:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 29 ms returned sat
[2026-05-23 17:15:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2026-05-23 17:15:43] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 122 ms.
[2026-05-23 17:15:44] [INFO ] Added : 21 causal constraints over 5 iterations in 307 ms. Result :sat
Minimization took 207 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8, 1, 20] Max Struct:[50, 1, 50]
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 20] Max Struct:[50, 50]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 367 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2026-05-23 17:15:45] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7886912948152058024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15222310177489742796.kers'
[2026-05-23 17:15:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7886912948152058024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15222310177489742796.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 136 cols 1448 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 17:15:45] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15222310177489742796.kers
Total runtime 1 ms.
[2026-05-23 17:15:45] [INFO ] State equation strengthened by 42 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Problem TDEAD1248 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 1 solved, 2344 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2203/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42182ms problems are : Problem set: 1 solved, 2344 unsolved
Search for dead transitions found 1 dead transitions in 42209ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 168 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42782 ms. Remains : 136/138 places, 2347/2348 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8985669497812274756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1013869789989348688.kers'
[2026-05-23 17:16:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8985669497812274756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1013869789989348688.kers]
Normalized transition count is 290 out of 2347 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 136 cols 1448 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 17:16:28] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1013869789989348688.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[8, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 6715 ms. (148 steps per ms)
BEST_FIRST walk for 2000001 steps (1616 resets) in 4697 ms. (425 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2026-05-23 17:16:39] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17585985479068555781.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9236532863190219793.kers'
[2026-05-23 17:16:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17585985479068555781.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9236532863190219793.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 136 cols 1448 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 17:16:39] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9236532863190219793.kers
Total runtime 2 ms.
[2026-05-23 17:16:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 17:16:39] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-23 17:16:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:16:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-23 17:16:39] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-23 17:16:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:16:39] [INFO ] [Nat]Added 42 Read/Feed constraints in 34 ms returned sat
[2026-05-23 17:16:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2026-05-23 17:16:40] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 31 ms.
[2026-05-23 17:16:40] [INFO ] Added : 22 causal constraints over 14 iterations in 384 ms. Result :sat
Minimization took 158 ms.
[2026-05-23 17:16:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:16:40] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-23 17:16:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:16:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:16:40] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-23 17:16:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 24 ms returned sat
[2026-05-23 17:16:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2026-05-23 17:16:41] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 34 ms.
[2026-05-23 17:16:41] [INFO ] Added : 21 causal constraints over 5 iterations in 190 ms. Result :sat
Minimization took 235 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2347/2347 transitions.
Applied a total of 0 rules in 167 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 136/136 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2347/2347 transitions.
Applied a total of 0 rules in 232 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2026-05-23 17:16:42] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2026-05-23 17:16:42] [INFO ] Invariant cache hit.
[2026-05-23 17:16:43] [INFO ] Implicit Places using invariants in 384 ms returned []
[2026-05-23 17:16:43] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2026-05-23 17:16:43] [INFO ] Invariant cache hit.
[2026-05-23 17:16:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:16:44] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1433 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/136 places, 2347/2347 transitions.
Applied a total of 0 rules in 159 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1824 ms. Remains : 134/136 places, 2347/2347 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17373309944757611624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14323520189292858617.kers'
[2026-05-23 17:16:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17373309944757611624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14323520189292858617.kers]
Normalized transition count is 290 out of 2347 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 134 cols 1246 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-23 17:16:44] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14323520189292858617.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 6274 ms. (159 steps per ms)
BEST_FIRST walk for 2000002 steps (1618 resets) in 4326 ms. (462 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2026-05-23 17:16:55] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2066924206607591050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10524577856556008055.kers'
[2026-05-23 17:16:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2066924206607591050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10524577856556008055.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 134 cols 1246 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-23 17:16:55] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10524577856556008055.kers
Total runtime 2 ms.
[2026-05-23 17:16:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:16:55] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-23 17:16:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:16:55] [INFO ] [Real]Added 42 Read/Feed constraints in 35 ms returned sat
[2026-05-23 17:16:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:16:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 17:16:55] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2026-05-23 17:16:55] [INFO ] [Nat]Added 42 Read/Feed constraints in 33 ms returned sat
[2026-05-23 17:16:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2026-05-23 17:16:55] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 82 ms.
[2026-05-23 17:16:56] [INFO ] Added : 21 causal constraints over 20 iterations in 474 ms. Result :sat
Minimization took 142 ms.
[2026-05-23 17:16:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:16:56] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2026-05-23 17:16:56] [INFO ] [Real]Added 42 Read/Feed constraints in 16 ms returned sat
[2026-05-23 17:16:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:16:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:16:56] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-23 17:16:56] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2026-05-23 17:16:56] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 31 ms.
[2026-05-23 17:16:56] [INFO ] Added : 21 causal constraints over 5 iterations in 182 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 151 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 134/134 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 151 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2026-05-23 17:16:58] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2026-05-23 17:16:58] [INFO ] Invariant cache hit.
[2026-05-23 17:16:58] [INFO ] Implicit Places using invariants in 335 ms returned []
[2026-05-23 17:16:58] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2026-05-23 17:16:58] [INFO ] Invariant cache hit.
[2026-05-23 17:16:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:16:59] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
[2026-05-23 17:16:59] [INFO ] Redundant transitions in 124 ms returned []
Running 2344 sub problems to find dead transitions.
[2026-05-23 17:16:59] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2026-05-23 17:16:59] [INFO ] Invariant cache hit.
[2026-05-23 17:16:59] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Problem TDEAD1268 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1541 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/424 variables, and 7 constraints, problems are : Problem set: 14 solved, 2330 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 14 solved, 2330 unsolved
Problem TDEAD198 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2255 is UNSAT
Problem TDEAD2276 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 2/7 constraints. Problems are: Problem set: 99 solved, 2245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/424 variables, and 7 constraints, problems are : Problem set: 99 solved, 2245 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2188/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61746ms problems are : Problem set: 99 solved, 2245 unsolved
Search for dead transitions found 99 dead transitions in 61752ms
Found 99 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 99 transitions
Dead transitions reduction (with SMT) removed 99 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/134 places, 2248/2347 transitions.
Applied a total of 0 rules in 144 ms. Remains 134 /134 variables (removed 0) and now considering 2248/2248 (removed 0) transitions.
[2026-05-23 17:18:01] [INFO ] Redundant transitions in 98 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63751 ms. Remains : 134/134 places, 2248/2347 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11616099479234271277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3060911045643341358.kers'
[2026-05-23 17:18:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11616099479234271277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3060911045643341358.kers]
Normalized transition count is 288 out of 2248 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 134 cols 1242 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-23 17:18:01] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3060911045643341358.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 6022 ms. (166 steps per ms)
BEST_FIRST walk for 2000001 steps (1619 resets) in 4199 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2026-05-23 17:18:11] [INFO ] Flow matrix only has 288 transitions (discarded 1960 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5503738671365810257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4274025438843117355.kers'
[2026-05-23 17:18:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5503738671365810257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4274025438843117355.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 134 cols 1242 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-23 17:18:11] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4274025438843117355.kers
Total runtime 5 ms.
[2026-05-23 17:18:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:18:12] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-23 17:18:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:18:12] [INFO ] [Real]Added 40 Read/Feed constraints in 24 ms returned sat
[2026-05-23 17:18:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:18:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:18:12] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-23 17:18:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 25 ms returned sat
[2026-05-23 17:18:12] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 32 ms.
[2026-05-23 17:18:12] [INFO ] Added : 21 causal constraints over 20 iterations in 481 ms. Result :sat
Minimization took 241 ms.
[2026-05-23 17:18:13] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 17:18:13] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-23 17:18:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:18:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:18:13] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-23 17:18:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 25 ms returned sat
[2026-05-23 17:18:13] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 32 ms.
[2026-05-23 17:18:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2026-05-23 17:18:13] [INFO ] Added : 21 causal constraints over 5 iterations in 427 ms. Result :sat
Minimization took 230 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2248/2248 transitions.
Applied a total of 0 rules in 133 ms. Remains 134 /134 variables (removed 0) and now considering 2248/2248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 134/134 places, 2248/2248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2248/2248 transitions.
Applied a total of 0 rules in 134 ms. Remains 134 /134 variables (removed 0) and now considering 2248/2248 (removed 0) transitions.
[2026-05-23 17:18:15] [INFO ] Flow matrix only has 288 transitions (discarded 1960 similar events)
[2026-05-23 17:18:15] [INFO ] Invariant cache hit.
[2026-05-23 17:18:15] [INFO ] Implicit Places using invariants in 323 ms returned []
[2026-05-23 17:18:15] [INFO ] Flow matrix only has 288 transitions (discarded 1960 similar events)
[2026-05-23 17:18:15] [INFO ] Invariant cache hit.
[2026-05-23 17:18:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:18:16] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2026-05-23 17:18:16] [INFO ] Redundant transitions in 52 ms returned []
Running 2245 sub problems to find dead transitions.
[2026-05-23 17:18:16] [INFO ] Flow matrix only has 288 transitions (discarded 1960 similar events)
[2026-05-23 17:18:16] [INFO ] Invariant cache hit.
[2026-05-23 17:18:16] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2245 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 2245/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2245 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 2103/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61653ms problems are : Problem set: 0 solved, 2245 unsolved
Search for dead transitions found 0 dead transitions in 61658ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63122 ms. Remains : 134/134 places, 2248/2248 transitions.
RANDOM walk for 40001 steps (92 resets) in 784 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (28 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40010 steps (28 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (32 resets) in 274 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
[2026-05-23 17:19:18] [INFO ] Flatten gal took : 339 ms
[2026-05-23 17:19:18] [INFO ] Flatten gal took : 144 ms
[2026-05-23 17:19:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17333690429875181347.gal : 60 ms
[2026-05-23 17:19:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13962164104079588860.prop : 0 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/ReachabilityCardinality17333690429875181347.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13962164104079588860.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 ...330
Loading property file /tmp/ReachabilityCardinality13962164104079588860.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 16
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :16 after 34
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :34 after 68
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :68 after 205
Interrupted probabilistic random walk after 253436 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 4
Probabilistic random walk after 253436 steps, saw 67930 distinct states, run finished after 3005 ms. (steps per millisecond=84 ) properties seen :0
[2026-05-23 17:19:21] [INFO ] Flow matrix only has 288 transitions (discarded 1960 similar events)
[2026-05-23 17:19:21] [INFO ] Invariant cache hit.
[2026-05-23 17:19:21] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 292/397 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/399 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 23/422 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/422 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1966 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 292/397 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/399 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 23/422 variables, 23/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/422 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 186 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3585 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5565ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1405 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2248/2248 transitions.
Applied a total of 0 rules in 133 ms. Remains 134 /134 variables (removed 0) and now considering 2248/2248 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 134/134 places, 2248/2248 transitions.
RANDOM walk for 40000 steps (92 resets) in 518 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (28 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (28 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :205 after 2550
Interrupted probabilistic random walk after 272990 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 4
Probabilistic random walk after 272990 steps, saw 73030 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
[2026-05-23 17:19:32] [INFO ] Flow matrix only has 288 transitions (discarded 1960 similar events)
[2026-05-23 17:19:32] [INFO ] Invariant cache hit.
[2026-05-23 17:19:32] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 292/397 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/399 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 23/422 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/422 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 292/397 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/399 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 23/422 variables, 23/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/422 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 186 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3582 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5448ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1353 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2248/2248 transitions.
Applied a total of 0 rules in 139 ms. Remains 134 /134 variables (removed 0) and now considering 2248/2248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 134/134 places, 2248/2248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2248/2248 transitions.
Applied a total of 0 rules in 139 ms. Remains 134 /134 variables (removed 0) and now considering 2248/2248 (removed 0) transitions.
[2026-05-23 17:19:39] [INFO ] Flow matrix only has 288 transitions (discarded 1960 similar events)
[2026-05-23 17:19:39] [INFO ] Invariant cache hit.
[2026-05-23 17:19:39] [INFO ] Implicit Places using invariants in 362 ms returned []
[2026-05-23 17:19:39] [INFO ] Flow matrix only has 288 transitions (discarded 1960 similar events)
[2026-05-23 17:19:39] [INFO ] Invariant cache hit.
[2026-05-23 17:19:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:19:40] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
[2026-05-23 17:19:40] [INFO ] Redundant transitions in 70 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1528 ms. Remains : 134/134 places, 2248/2248 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1960 transitions
Reduce isomorphic transitions removed 1960 transitions.
Iterating post reduction 0 with 1960 rules applied. Total rules applied 1960 place count 134 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1964 place count 132 transition count 286
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1966 place count 132 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1968 place count 130 transition count 284
Applied a total of 1968 rules in 22 ms. Remains 130 /134 variables (removed 4) and now considering 284/2248 (removed 1964) transitions.
Running SMT prover for 4 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2344805181072971531.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14430921039838839100.kers'
[2026-05-23 17:19:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2344805181072971531.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14430921039838839100.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 130 cols 1230 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-23 17:19:40] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14430921039838839100.kers
Total runtime 1 ms.
[2026-05-23 17:19:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-23 17:19:40] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-23 17:19:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:19:41] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2026-05-23 17:19:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 17:19:41] [INFO ] After 164ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-23 17:19:41] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-23 17:19:41] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2026-05-23 17:19:41] [INFO ] Flatten gal took : 16 ms
[2026-05-23 17:19:41] [INFO ] Flatten gal took : 13 ms
[2026-05-23 17:19:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1502471625308532094.gal : 3 ms
[2026-05-23 17:19:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13285993569464722814.prop : 1 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/ReachabilityCardinality1502471625308532094.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13285993569464722814.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 ...329
Loading property file /tmp/ReachabilityCardinality13285993569464722814.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 20
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :20 after 60
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :60 after 140
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :140 after 504
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :504 after 1980
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1980 after 12240
Invariant property MIN1 does not hold.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :12240 after 120820
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :120820 after 474232
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :474232 after 1.8041e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.8041e+06 after 1.83611e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.83611e+06 after 1.91289e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.91289e+06 after 2.10665e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.10665e+06 after 2.46357e+06
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2550 after 12899
Detected timeout of ITS tools.
[2026-05-23 17:19:56] [INFO ] Flatten gal took : 13 ms
[2026-05-23 17:19:56] [INFO ] Applying decomposition
[2026-05-23 17:19:56] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph340462296334841387.txt' '-o' '/tmp/graph340462296334841387.bin' '-w' '/tmp/graph340462296334841387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph340462296334841387.bin' '-l' '-1' '-v' '-w' '/tmp/graph340462296334841387.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:19:56] [INFO ] Decomposing Gal with order
[2026-05-23 17:19:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:19:56] [INFO ] Removed a total of 255 redundant transitions.
[2026-05-23 17:19:57] [INFO ] Flatten gal took : 87 ms
[2026-05-23 17:19:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 7 ms.
[2026-05-23 17:19:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18087030549743281816.gal : 3 ms
[2026-05-23 17:19:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4562539792225747910.prop : 0 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/ReachabilityCardinality18087030549743281816.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4562539792225747910.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality4562539792225747910.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 150
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :150 after 3416
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3416 after 38096
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :38096 after 253098
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :12899 after 13053
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :13053 after 13375
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :253098 after 718711
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :13375 after 13990
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.55484e+07 after 4.65639e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.42405e+08 after 1.44647e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7.58854e+08 after 7.6414e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.0343e+09 after 5.37866e+09
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :13990 after 15103
Detected timeout of ITS tools.
[2026-05-23 17:20:09] [INFO ] Flatten gal took : 51 ms
[2026-05-23 17:20:09] [INFO ] Applying decomposition
[2026-05-23 17:20:09] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18404838317768432270.txt' '-o' '/tmp/graph18404838317768432270.bin' '-w' '/tmp/graph18404838317768432270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18404838317768432270.bin' '-l' '-1' '-v' '-w' '/tmp/graph18404838317768432270.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:20:09] [INFO ] Decomposing Gal with order
[2026-05-23 17:20:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:20:09] [INFO ] Removed a total of 4174 redundant transitions.
[2026-05-23 17:20:10] [INFO ] Flatten gal took : 533 ms
[2026-05-23 17:20:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 325 labels/synchronizations in 26 ms.
[2026-05-23 17:20:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18443464580755103205.gal : 2 ms
[2026-05-23 17:20:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18382972050349284018.prop : 0 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/ReachabilityCardinality18443464580755103205.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18382972050349284018.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityCardinality18382972050349284018.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :29 after 34
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :34 after 43
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :43 after 60
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :60 after 90
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :90 after 262
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :262 after 668
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :668 after 8104
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :8104 after 31204
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :31204 after 86394
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31371 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-208737309068699300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14980065997432102711.kers'
[2026-05-23 17:20:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-208737309068699300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14980065997432102711.kers]
Normalized transition count is 288 out of 2248 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 134 cols 1242 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-23 17:20:12] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14980065997432102711.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (23 resets) in 62 ms. (158 steps per ms)
BEST_FIRST walk for 10000 steps (7 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2026-05-23 17:20:12] [INFO ] Flow matrix only has 288 transitions (discarded 1960 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4355737622394588024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13086704480135327188.kers'
[2026-05-23 17:20:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4355737622394588024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13086704480135327188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 134 cols 1242 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-23 17:20:12] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13086704480135327188.kers
Total runtime 3 ms.
[2026-05-23 17:20:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:20:12] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-23 17:20:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:20:12] [INFO ] [Real]Added 40 Read/Feed constraints in 18 ms returned sat
[2026-05-23 17:20:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:20:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-23 17:20:12] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2026-05-23 17:20:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 29 ms returned sat
[2026-05-23 17:20:12] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 33 ms.
[2026-05-23 17:20:13] [INFO ] Added : 21 causal constraints over 20 iterations in 488 ms. Result :sat
Minimization took 232 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2248/2248 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 2247
Applied a total of 2 rules in 153 ms. Remains 133 /134 variables (removed 1) and now considering 2247/2248 (removed 1) transitions.
Running 2244 sub problems to find dead transitions.
[2026-05-23 17:20:13] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13678094900976073499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14668387336226828831.kers'
[2026-05-23 17:20:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13678094900976073499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14668387336226828831.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 287 rows 132 cols 1089 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-23 17:20:13] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14668387336226828831.kers
Total runtime 3 ms.
[2026-05-23 17:20:13] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/420 variables, and 6 constraints, problems are : Problem set: 0 solved, 2244 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 2244/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/420 variables, and 6 constraints, problems are : Problem set: 0 solved, 2244 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 2103/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41687ms problems are : Problem set: 0 solved, 2244 unsolved
Search for dead transitions found 0 dead transitions in 41696ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41858 ms. Remains : 133/134 places, 2247/2248 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16991073209109731956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13643963520012852366.kers'
[2026-05-23 17:20:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16991073209109731956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13643963520012852366.kers]
Normalized transition count is 287 out of 2247 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 287 rows 132 cols 1089 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-23 17:20:55] [INFO ] Computed 5 invariants in 7 ms
Computed 5 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13643963520012852366.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[50]
RANDOM walk for 1000000 steps (2682 resets) in 6511 ms. (153 steps per ms)
BEST_FIRST walk for 1000001 steps (991 resets) in 2387 ms. (418 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2026-05-23 17:21:04] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10844694241211355575.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-411585263106190540.kers'
[2026-05-23 17:21:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10844694241211355575.kers, --Pflows, --basisKERS=/tmp/petrispot-output-411585263106190540.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 287 rows 132 cols 1089 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-23 17:21:04] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-411585263106190540.kers
Total runtime 5 ms.
[2026-05-23 17:21:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:21:04] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-23 17:21:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:21:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:21:04] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2026-05-23 17:21:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:21:04] [INFO ] [Nat]Added 40 Read/Feed constraints in 33 ms returned sat
[2026-05-23 17:21:04] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 164 transitions) in 31 ms.
[2026-05-23 17:21:05] [INFO ] Added : 21 causal constraints over 20 iterations in 408 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2247/2247 transitions.
Applied a total of 0 rules in 138 ms. Remains 133 /133 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 133/133 places, 2247/2247 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2247/2247 transitions.
Applied a total of 0 rules in 137 ms. Remains 133 /133 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
[2026-05-23 17:21:06] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:21:06] [INFO ] Invariant cache hit.
[2026-05-23 17:21:06] [INFO ] Implicit Places using invariants in 333 ms returned []
[2026-05-23 17:21:06] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:21:06] [INFO ] Invariant cache hit.
[2026-05-23 17:21:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:21:07] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2026-05-23 17:21:07] [INFO ] Redundant transitions in 53 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1383 ms. Remains : 133/133 places, 2247/2247 transitions.
[2026-05-23 17:21:07] [INFO ] Flatten gal took : 40 ms
[2026-05-23 17:21:07] [INFO ] Flatten gal took : 43 ms
[2026-05-23 17:21:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2070820379861120358.gal : 14 ms
[2026-05-23 17:21:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5422499898186187867.prop : 1 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/ReachabilityCardinality2070820379861120358.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5422499898186187867.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
RANDOM walk for 40000 steps (104 resets) in 649 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (36 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (37 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5422499898186187867.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 34
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :34 after 68
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :68 after 160
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :160 after 193
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :193 after 353
Interrupted probabilistic random walk after 281548 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 2
Probabilistic random walk after 281548 steps, saw 80643 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2026-05-23 17:21:10] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:21:10] [INFO ] Invariant cache hit.
[2026-05-23 17:21:10] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/203 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 114/317 variables, 26/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 102/419 variables, 51/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/420 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/420 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 180 constraints, problems are : Problem set: 0 solved, 2 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/203 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/317 variables, 26/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :353 after 573
At refinement iteration 16 (INCLUDED_ONLY) 0/317 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 102/419 variables, 51/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/419 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/420 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/420 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/420 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 182 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1561 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2446ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 381 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2247/2247 transitions.
Applied a total of 0 rules in 131 ms. Remains 133 /133 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 133/133 places, 2247/2247 transitions.
RANDOM walk for 40000 steps (104 resets) in 396 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (36 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40015 steps (37 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 277668 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 2
Probabilistic random walk after 277668 steps, saw 79645 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2026-05-23 17:21:16] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:21:16] [INFO ] Invariant cache hit.
[2026-05-23 17:21:16] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/203 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 114/317 variables, 26/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 102/419 variables, 51/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/420 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :573 after 1079
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/420 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 180 constraints, problems are : Problem set: 0 solved, 2 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/203 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/317 variables, 26/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/317 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 102/419 variables, 51/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/419 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/420 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/420 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/420 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 182 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1554 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2419ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 367 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2247/2247 transitions.
Applied a total of 0 rules in 131 ms. Remains 133 /133 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 133/133 places, 2247/2247 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2247/2247 transitions.
Applied a total of 0 rules in 132 ms. Remains 133 /133 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
[2026-05-23 17:21:19] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:21:19] [INFO ] Invariant cache hit.
[2026-05-23 17:21:20] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-23 17:21:20] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:21:20] [INFO ] Invariant cache hit.
[2026-05-23 17:21:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:21:21] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2026-05-23 17:21:21] [INFO ] Redundant transitions in 48 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1354 ms. Remains : 133/133 places, 2247/2247 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1960 transitions
Reduce isomorphic transitions removed 1960 transitions.
Iterating post reduction 0 with 1960 rules applied. Total rules applied 1960 place count 133 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1964 place count 131 transition count 285
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1966 place count 131 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1968 place count 129 transition count 283
Applied a total of 1968 rules in 14 ms. Remains 129 /133 variables (removed 4) and now considering 283/2247 (removed 1964) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9698933414726576775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-111673912779625772.kers'
[2026-05-23 17:21:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9698933414726576775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-111673912779625772.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 283 rows 128 cols 1077 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-23 17:21:21] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-111673912779625772.kers
Total runtime 2 ms.
[2026-05-23 17:21:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-23 17:21:21] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 17:21:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:21:21] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 17:21:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 17:21:21] [INFO ] After 36ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 17:21:21] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 17:21:21] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 17:21:21] [INFO ] Flatten gal took : 9 ms
[2026-05-23 17:21:21] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:21:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11494030910587542070.gal : 2 ms
[2026-05-23 17:21:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6745064172196674523.prop : 0 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/ReachabilityCardinality11494030910587542070.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6745064172196674523.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 ...329
Loading property file /tmp/ReachabilityCardinality6745064172196674523.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 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 60
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :60 after 154
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :154 after 550
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :550 after 2618
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :78168 after 79781
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :79781 after 115594
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.30502e+06 after 1.48941e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.87131e+07 after 1.94244e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1079 after 1767
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.96739e+09,5.81656,162224,2,55375,21,533787,8,0,809,351244,0
Total reachable state count : 1967386000
Verifying 2 reachability properties.
Reachability property MAX0 is true.
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,88715,5.82298,162224,2,3693,21,533787,8,0,811,351244,0
Invariant property MIN0 does not hold.
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,88715,5.82837,162224,2,3693,21,533787,8,0,812,351244,0
Over-approximation ignoring read arcs solved 0 properties in 6434 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 17:21:27] [INFO ] Flatten gal took : 35 ms
[2026-05-23 17:21:27] [INFO ] Applying decomposition
[2026-05-23 17:21:27] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10969405920451452601.txt' '-o' '/tmp/graph10969405920451452601.bin' '-w' '/tmp/graph10969405920451452601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10969405920451452601.bin' '-l' '-1' '-v' '-w' '/tmp/graph10969405920451452601.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:21:27] [INFO ] Decomposing Gal with order
[2026-05-23 17:21:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:21:28] [INFO ] Removed a total of 4174 redundant transitions.
[2026-05-23 17:21:28] [INFO ] Flatten gal took : 432 ms
[2026-05-23 17:21:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 325 labels/synchronizations in 21 ms.
[2026-05-23 17:21:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15210976971607657982.gal : 2 ms
[2026-05-23 17:21:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality822095033916560044.prop : 1 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/ReachabilityCardinality15210976971607657982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality822095033916560044.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality822095033916560044.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 26
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :26 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 121
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :121 after 331
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :331 after 2601
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2601 after 2601
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7752 after 7852
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :17901 after 20201
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :223643 after 223643
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :605285 after 610516
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.84053e+06 after 4.84053e+06
Detected timeout of ITS tools.
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-02 in 126455 ms.
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2324343711338271916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14526642800398647061.kers'
[2026-05-23 17:22:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2324343711338271916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14526642800398647061.kers]
Normalized transition count is 288 out of 2248 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 134 cols 1242 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-23 17:22:18] [INFO ] Computed 5 invariants in 6 ms
Computed 5 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-14526642800398647061.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (23 resets) in 65 ms. (151 steps per ms)
BEST_FIRST walk for 10001 steps (8 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2026-05-23 17:22:18] [INFO ] Flow matrix only has 288 transitions (discarded 1960 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8131096007653769541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6550291941474261930.kers'
[2026-05-23 17:22:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8131096007653769541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6550291941474261930.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 134 cols 1242 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-23 17:22:18] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6550291941474261930.kers
Total runtime 3 ms.
[2026-05-23 17:22:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:22:18] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-23 17:22:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:22:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 17:22:18] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-23 17:22:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:22:18] [INFO ] [Nat]Added 40 Read/Feed constraints in 26 ms returned sat
[2026-05-23 17:22:18] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 33 ms.
[2026-05-23 17:22:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2026-05-23 17:22:19] [INFO ] Added : 21 causal constraints over 5 iterations in 438 ms. Result :sat
Minimization took 226 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2248/2248 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 2247
Applied a total of 2 rules in 169 ms. Remains 133 /134 variables (removed 1) and now considering 2247/2248 (removed 1) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 133/134 places, 2247/2248 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10999716453970837004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2136754661344582762.kers'
[2026-05-23 17:22:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10999716453970837004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2136754661344582762.kers]
Normalized transition count is 287 out of 2247 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 287 rows 132 cols 1089 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-23 17:22:20] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2136754661344582762.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[50]
RANDOM walk for 1000000 steps (2682 resets) in 6585 ms. (151 steps per ms)
BEST_FIRST walk for 1000000 steps (1062 resets) in 2559 ms. (390 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2026-05-23 17:22:29] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8504248859068284058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-453743757907176324.kers'
[2026-05-23 17:22:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8504248859068284058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-453743757907176324.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 287 rows 132 cols 1089 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-23 17:22:29] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-453743757907176324.kers
Total runtime 2 ms.
[2026-05-23 17:22:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:22:29] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-23 17:22:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:22:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 17:22:29] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-23 17:22:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:22:29] [INFO ] [Nat]Added 40 Read/Feed constraints in 22 ms returned sat
[2026-05-23 17:22:29] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 164 transitions) in 31 ms.
[2026-05-23 17:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2026-05-23 17:22:30] [INFO ] Added : 21 causal constraints over 5 iterations in 491 ms. Result :sat
Minimization took 223 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2247/2247 transitions.
Applied a total of 0 rules in 134 ms. Remains 133 /133 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 133/133 places, 2247/2247 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2247/2247 transitions.
Applied a total of 0 rules in 139 ms. Remains 133 /133 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
[2026-05-23 17:22:30] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:22:30] [INFO ] Invariant cache hit.
[2026-05-23 17:22:31] [INFO ] Implicit Places using invariants in 324 ms returned []
[2026-05-23 17:22:31] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:22:31] [INFO ] Invariant cache hit.
[2026-05-23 17:22:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:22:32] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2026-05-23 17:22:32] [INFO ] Redundant transitions in 56 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1375 ms. Remains : 133/133 places, 2247/2247 transitions.
[2026-05-23 17:22:32] [INFO ] Flatten gal took : 35 ms
[2026-05-23 17:22:32] [INFO ] Flatten gal took : 35 ms
[2026-05-23 17:22:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14710230611052896807.gal : 11 ms
[2026-05-23 17:22:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1397425481373284696.prop : 0 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/ReachabilityCardinality14710230611052896807.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1397425481373284696.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 ...329
RANDOM walk for 40000 steps (104 resets) in 461 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40023 steps (40 resets) in 265 ms. (150 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality1397425481373284696.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 20
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :20 after 47
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :47 after 98
Interrupted probabilistic random walk after 296583 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 296583 steps, saw 79657 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2026-05-23 17:22:35] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:22:35] [INFO ] Invariant cache hit.
[2026-05-23 17:22:35] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/203 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 114/317 variables, 26/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 102/419 variables, 51/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/420 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/420 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/203 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/317 variables, 26/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 102/419 variables, 51/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/420 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/420 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2191 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2951ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 513 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2247/2247 transitions.
Applied a total of 0 rules in 156 ms. Remains 133 /133 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 133/133 places, 2247/2247 transitions.
RANDOM walk for 40000 steps (104 resets) in 408 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (40 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 286570 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 286570 steps, saw 76590 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2026-05-23 17:22:42] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:22:42] [INFO ] Invariant cache hit.
[2026-05-23 17:22:42] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/203 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 114/317 variables, 26/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 102/419 variables, 51/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/420 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/420 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/199 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/203 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/317 variables, 26/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 102/419 variables, 51/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :98 after 2432
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/420 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/420 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2191 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2933ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 512 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2247/2247 transitions.
Applied a total of 0 rules in 145 ms. Remains 133 /133 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 133/133 places, 2247/2247 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2247/2247 transitions.
Applied a total of 0 rules in 138 ms. Remains 133 /133 variables (removed 0) and now considering 2247/2247 (removed 0) transitions.
[2026-05-23 17:22:46] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:22:46] [INFO ] Invariant cache hit.
[2026-05-23 17:22:46] [INFO ] Implicit Places using invariants in 319 ms returned []
[2026-05-23 17:22:46] [INFO ] Flow matrix only has 287 transitions (discarded 1960 similar events)
[2026-05-23 17:22:46] [INFO ] Invariant cache hit.
[2026-05-23 17:22:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:22:47] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
[2026-05-23 17:22:47] [INFO ] Redundant transitions in 50 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1378 ms. Remains : 133/133 places, 2247/2247 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1960 transitions
Reduce isomorphic transitions removed 1960 transitions.
Iterating post reduction 0 with 1960 rules applied. Total rules applied 1960 place count 133 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1964 place count 131 transition count 285
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1966 place count 131 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1968 place count 129 transition count 283
Applied a total of 1968 rules in 10 ms. Remains 129 /133 variables (removed 4) and now considering 283/2247 (removed 1964) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12620709572699429481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5031922641002827849.kers'
[2026-05-23 17:22:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12620709572699429481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5031922641002827849.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 283 rows 128 cols 1077 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-23 17:22:47] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5031922641002827849.kers
Total runtime 2 ms.
[2026-05-23 17:22:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:22:47] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 17:22:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-23 17:22:47] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 17:22:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 17:22:47] [INFO ] After 39ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 17:22:47] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 17:22:47] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 17:22:47] [INFO ] Flatten gal took : 10 ms
[2026-05-23 17:22:47] [INFO ] Flatten gal took : 10 ms
[2026-05-23 17:22:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11019299634741624121.gal : 2 ms
[2026-05-23 17:22:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10222913961027112176.prop : 0 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/ReachabilityCardinality11019299634741624121.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10222913961027112176.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 ...330
Loading property file /tmp/ReachabilityCardinality10222913961027112176.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 60
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :60 after 154
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :154 after 550
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :550 after 2618
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :78168 after 79812
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :79812 after 115594
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.2457e+06 after 2.44138e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.05036e+07 after 3.13867e+07
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.96739e+09,5.32891,155328,2,48811,21,465599,8,0,809,308974,0
Total reachable state count : 1967386000
Verifying 2 reachability properties.
Reachability property MAX0 is true.
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,89174,5.3351,155328,2,3787,21,465599,8,0,811,308974,0
Invariant property MIN0 does not hold.
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,89174,5.34024,155328,2,3787,21,465599,8,0,812,308974,0
Over-approximation ignoring read arcs solved 0 properties in 5851 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 17:22:53] [INFO ] Flatten gal took : 30 ms
[2026-05-23 17:22:53] [INFO ] Applying decomposition
[2026-05-23 17:22:53] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12698112485971040395.txt' '-o' '/tmp/graph12698112485971040395.bin' '-w' '/tmp/graph12698112485971040395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12698112485971040395.bin' '-l' '-1' '-v' '-w' '/tmp/graph12698112485971040395.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:22:53] [INFO ] Decomposing Gal with order
[2026-05-23 17:22:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:22:53] [INFO ] Removed a total of 4174 redundant transitions.
[2026-05-23 17:22:53] [INFO ] Flatten gal took : 337 ms
[2026-05-23 17:22:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 325 labels/synchronizations in 17 ms.
[2026-05-23 17:22:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18113373066972819223.gal : 2 ms
[2026-05-23 17:22:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4284294483393216661.prop : 0 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/ReachabilityCardinality18113373066972819223.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4284294483393216661.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality4284294483393216661.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :24 after 49
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :49 after 94
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :94 after 179
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :179 after 281
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :281 after 443
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :443 after 957
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :957 after 7954
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7954 after 25904
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :25904 after 56046
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :535346 after 849242
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.76347e+07 after 1.80549e+07
Detected timeout of ITS tools.
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N20-UpperBounds-05 in 85439 ms.
[2026-05-23 17:23:44] [INFO ] Flatten gal took : 31 ms
[2026-05-23 17:23:44] [INFO ] Applying decomposition
[2026-05-23 17:23:44] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4995833167793576150.txt' '-o' '/tmp/graph4995833167793576150.bin' '-w' '/tmp/graph4995833167793576150.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4995833167793576150.bin' '-l' '-1' '-v' '-w' '/tmp/graph4995833167793576150.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:23:44] [INFO ] Decomposing Gal with order
[2026-05-23 17:23:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:23:44] [INFO ] Removed a total of 4174 redundant transitions.
[2026-05-23 17:23:44] [INFO ] Flatten gal took : 370 ms
[2026-05-23 17:23:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 325 labels/synchronizations in 15 ms.
[2026-05-23 17:23:44] [INFO ] Time to serialize gal into /tmp/UpperBounds381229956858416454.gal : 2 ms
[2026-05-23 17:23:44] [INFO ] Time to serialize properties into /tmp/UpperBounds1002987228880277558.prop : 1 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/UpperBounds381229956858416454.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1002987228880277558.prop' '--nowitness'
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 ...282
Loading property file /tmp/UpperBounds1002987228880277558.prop.
Detected timeout of ITS tools.
[2026-05-23 17:46:26] [INFO ] Flatten gal took : 33 ms
[2026-05-23 17:46:26] [INFO ] Time to serialize gal into /tmp/UpperBounds4208134833370311505.gal : 10 ms
[2026-05-23 17:46:26] [INFO ] Time to serialize properties into /tmp/UpperBounds4460259553300669328.prop : 0 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/UpperBounds4208134833370311505.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4460259553300669328.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 ...304
Loading property file /tmp/UpperBounds4460259553300669328.prop.
Detected timeout of ITS tools.
[2026-05-23 18:09:10] [INFO ] Flatten gal took : 393 ms
[2026-05-23 18:09:12] [INFO ] Input system was already deterministic with 2248 transitions.
[2026-05-23 18:09:12] [INFO ] Transformed 134 places.
[2026-05-23 18:09:15] [INFO ] Transformed 2248 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-23 18:09:15] [INFO ] Time to serialize gal into /tmp/UpperBounds13070888132308312206.gal : 26 ms
[2026-05-23 18:09:15] [INFO ] Time to serialize properties into /tmp/UpperBounds14683190028750249529.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/UpperBounds13070888132308312206.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14683190028750249529.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14683190028750249529.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
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="BridgeAndVehicles-PT-V50P50N20"
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 BridgeAndVehicles-PT-V50P50N20, 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 r034-tall-177946841900261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N20.tgz
mv BridgeAndVehicles-PT-V50P50N20 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 '
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 ;