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-177946842000526.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 BusinessProcesses-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 131K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779616877923

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 10:01:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 10:01:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 10:01:19] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2026-05-24 10:01:19] [INFO ] Transformed 518 places.
[2026-05-24 10:01:19] [INFO ] Transformed 471 transitions.
[2026-05-24 10:01:19] [INFO ] Found NUPN structural information;
[2026-05-24 10:01:19] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2026-05-24 10:01:19] [INFO ] Flatten gal took : 153 ms
[2026-05-24 10:01:19] [INFO ] Flatten gal took : 69 ms
[2026-05-24 10:01:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11427262002711696569.gal : 42 ms
[2026-05-24 10:01:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7299756237073870668.prop : 3 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/ReachabilityCardinality11427262002711696569.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7299756237073870668.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (335 resets) in 2597 ms. (15 steps per ms) remains 9/16 properties

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
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality7299756237073870668.prop.
BEST_FIRST walk for 40004 steps (59 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
BEST_FIRST walk for 40004 steps (56 resets) in 807 ms. (49 steps per ms) remains 9/9 properties
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :22 after 197
BEST_FIRST walk for 40004 steps (54 resets) in 151 ms. (263 steps per ms) remains 7/9 properties
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :197 after 391
BEST_FIRST walk for 40004 steps (57 resets) in 101 ms. (392 steps per ms) remains 5/7 properties
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (61 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (44 resets) in 731 ms. (54 steps per ms) remains 4/5 properties
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (47 resets) in 352 ms. (113 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3498226272669973967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11738801920725499669.kers'
[2026-05-24 10:01:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3498226272669973967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11738801920725499669.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 471 rows 518 cols 1415 entries
Finished phase 1 with 367 SingleSign rule and 66 generalized
[2026-05-24 10:01:20] [INFO ] Computed 85 invariants in 3 ms
Computed 85 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11738801920725499669.kers
Total runtime 4 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 284/422 variables, 63/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 284/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 96/518 variables, 22/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 96/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 471/989 variables, 518/1121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/989 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/989 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 989/989 variables, and 1121 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2517 ms.
Refiners :[Domain max(s): 518/518 constraints, Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 518/518 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 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/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 284/422 variables, 63/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 284/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 8/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 96/518 variables, 22/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 96/612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 7774ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 138 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (complete) has 1071 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 517 transition count 416
Reduce places removed 55 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 70 rules applied. Total rules applied 126 place count 462 transition count 401
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 141 place count 447 transition count 401
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 141 place count 447 transition count 365
Deduced a syphon composed of 36 places in 6 ms
Ensure Unique test removed 4 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 217 place count 407 transition count 365
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 258 place count 366 transition count 324
Iterating global reduction 3 with 41 rules applied. Total rules applied 299 place count 366 transition count 324
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 299 place count 366 transition count 321
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 305 place count 363 transition count 321
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 393 place count 319 transition count 277
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 396 place count 319 transition count 274
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 399 place count 316 transition count 274
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 403 place count 316 transition count 274
Applied a total of 403 rules in 169 ms. Remains 316 /518 variables (removed 202) and now considering 274/471 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 316/518 places, 274/471 transitions.
RANDOM walk for 40000 steps (429 resets) in 529 ms. (75 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (84 resets) in 184 ms. (216 steps per ms) remains 2/3 properties
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2893542572556144923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12979274604946336977.kers'
[2026-05-24 10:01:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2893542572556144923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12979274604946336977.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 274 rows 316 cols 1004 entries
Finished phase 1 with 177 SingleSign rule and 59 generalized
[2026-05-24 10:01:29] [INFO ] Computed 80 invariants in 1 ms
Computed 80 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12979274604946336977.kers
Total runtime 4 ms.
[2026-05-24 10:01:29] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/267 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/315 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 274/589 variables, 315/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 6/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/590 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/590 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/590 variables, and 402 constraints, problems are : Problem set: 0 solved, 2 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 316/316 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 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/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/267 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 48/315 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 274/589 variables, 315/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 6/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/590 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/590 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 590/590 variables, and 416 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 316/316 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 2834ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 427 ms.
Support contains 77 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 274/274 transitions.
Graph (complete) has 823 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 315 transition count 265
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 307 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 306 transition count 264
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 19 place count 306 transition count 247
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 56 place count 286 transition count 247
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 60 place count 282 transition count 243
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 65 place count 281 transition count 243
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 123 place count 252 transition count 214
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 252 transition count 212
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 250 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 249 transition count 211
Applied a total of 128 rules in 46 ms. Remains 249 /316 variables (removed 67) and now considering 211/274 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 249/316 places, 211/274 transitions.
RANDOM walk for 40000 steps (681 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1016895 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 1
Probabilistic random walk after 1016895 steps, saw 339529 distinct states, run finished after 3005 ms. (steps per millisecond=338 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13127824842769052806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13485958346432870836.kers'
[2026-05-24 10:01:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13127824842769052806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13485958346432870836.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 249 cols 869 entries
Finished phase 1 with 118 SingleSign rule and 55 generalized
[2026-05-24 10:01:35] [INFO ] Computed 76 invariants in 10 ms
Computed 76 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-13485958346432870836.kers
Total runtime 11 ms.
[2026-05-24 10:01:35] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/170 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/205 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/248 variables, 22/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 211/459 variables, 248/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/460 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/460 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 326 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 249/249 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/170 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/205 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 43/248 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 16/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 211/459 variables, 248/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/460 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/460 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/460 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2513 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 249/249 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3023ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 77 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 211/211 transitions.
Applied a total of 0 rules in 11 ms. Remains 249 /249 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 249/249 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 211/211 transitions.
Applied a total of 0 rules in 7 ms. Remains 249 /249 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2026-05-24 10:01:38] [INFO ] Invariant cache hit.
[2026-05-24 10:01:38] [INFO ] Implicit Places using invariants in 128 ms returned [49, 57, 197, 212]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 137 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 245/249 places, 211/211 transitions.
Applied a total of 0 rules in 8 ms. Remains 245 /245 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 155 ms. Remains : 245/249 places, 211/211 transitions.
RANDOM walk for 40000 steps (628 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1044994 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1044994 steps, saw 348931 distinct states, run finished after 3003 ms. (steps per millisecond=347 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16369367897262597551.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-677081111141551359.kers'
[2026-05-24 10:01:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16369367897262597551.kers, --Pflows, --basisKERS=/tmp/petrispot-output-677081111141551359.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 245 cols 861 entries
Finished phase 1 with 119 SingleSign rule and 54 generalized
[2026-05-24 10:01:41] [INFO ] Computed 72 invariants in 1 ms
Computed 72 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-677081111141551359.kers
Total runtime 2 ms.
[2026-05-24 10:01:41] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/168 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/202 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/244 variables, 21/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 211/455 variables, 244/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/456 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/456 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/168 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 34/202 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/244 variables, 21/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 211/455 variables, 244/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/455 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/455 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/456 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/456 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/456 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 326 constraints, problems are : Problem set: 0 solved, 1 unsolved in 966 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 245/245 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1597ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 77 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 211/211 transitions.
Applied a total of 0 rules in 21 ms. Remains 245 /245 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 245/245 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 211/211 transitions.
Applied a total of 0 rules in 20 ms. Remains 245 /245 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2026-05-24 10:01:43] [INFO ] Invariant cache hit.
[2026-05-24 10:01:43] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-24 10:01:43] [INFO ] Invariant cache hit.
[2026-05-24 10:01:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 10:01:44] [INFO ] Implicit Places using invariants and state equation in 331 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 518 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 244/245 places, 211/211 transitions.
Applied a total of 0 rules in 8 ms. Remains 244 /244 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 546 ms. Remains : 244/245 places, 211/211 transitions.
RANDOM walk for 40000 steps (657 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1116859 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :0 out of 1
Probabilistic random walk after 1116859 steps, saw 369713 distinct states, run finished after 3001 ms. (steps per millisecond=372 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2684131723884736732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15116814971805977527.kers'
[2026-05-24 10:01:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2684131723884736732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15116814971805977527.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 244 cols 858 entries
Finished phase 1 with 119 SingleSign rule and 54 generalized
[2026-05-24 10:01:47] [INFO ] Computed 71 invariants in 8 ms
Computed 71 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-15116814971805977527.kers
Total runtime 9 ms.
[2026-05-24 10:01:47] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/168 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/200 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/243 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 211/454 variables, 243/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/455 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/455 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 244/244 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/168 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 32/200 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 43/243 variables, 21/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 211/454 variables, 243/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/455 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/455 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/455 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 244/244 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1225ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 77 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 211/211 transitions.
Applied a total of 0 rules in 8 ms. Remains 244 /244 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 244/244 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 211/211 transitions.
Applied a total of 0 rules in 7 ms. Remains 244 /244 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2026-05-24 10:01:48] [INFO ] Invariant cache hit.
[2026-05-24 10:01:48] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-24 10:01:48] [INFO ] Invariant cache hit.
[2026-05-24 10:01:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 10:01:49] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2026-05-24 10:01:49] [INFO ] Redundant transitions in 7 ms returned []
Running 207 sub problems to find dead transitions.
[2026-05-24 10:01:49] [INFO ] Invariant cache hit.
[2026-05-24 10:01:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 2/244 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Problem TDEAD120 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 20/111 constraints. Problems are: Problem set: 4 solved, 203 unsolved
Problem TDEAD124 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 20/131 constraints. Problems are: Problem set: 12 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 20/151 constraints. Problems are: Problem set: 12 solved, 195 unsolved
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 20/171 constraints. Problems are: Problem set: 16 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 20/191 constraints. Problems are: Problem set: 16 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/211 constraints. Problems are: Problem set: 16 solved, 191 unsolved
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/231 constraints. Problems are: Problem set: 22 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 20/251 constraints. Problems are: Problem set: 22 solved, 185 unsolved
Problem TDEAD107 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD149 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 20/271 constraints. Problems are: Problem set: 25 solved, 182 unsolved
SMT process timed out in 30129ms, After SMT, problems are : Problem set: 25 solved, 182 unsolved
Search for dead transitions found 25 dead transitions in 30130ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 244/244 places, 186/211 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 186
Applied a total of 1 rules in 7 ms. Remains 243 /244 variables (removed 1) and now considering 186/186 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10102670688334106840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15655467294785663317.kers'
[2026-05-24 10:02:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10102670688334106840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15655467294785663317.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 243 cols 706 entries
Finished phase 1 with 120 SingleSign rule and 52 generalized
[2026-05-24 10:02:19] [INFO ] Computed 71 invariants in 1 ms
Computed 71 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15655467294785663317.kers
Total runtime 1 ms.
[2026-05-24 10:02:19] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-24 10:02:19] [INFO ] Invariant cache hit.
[2026-05-24 10:02:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 10:02:19] [INFO ] Implicit Places using invariants and state equation in 284 ms returned [89, 208, 227, 232, 236]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 435 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 238/244 places, 186/211 transitions.
Applied a total of 0 rules in 10 ms. Remains 238 /238 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 31326 ms. Remains : 238/244 places, 186/211 transitions.
RANDOM walk for 40000 steps (663 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1146520 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :0 out of 1
Probabilistic random walk after 1146520 steps, saw 379071 distinct states, run finished after 3001 ms. (steps per millisecond=382 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17262954286945635030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12181659265599581318.kers'
[2026-05-24 10:02:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17262954286945635030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12181659265599581318.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 238 cols 696 entries
Finished phase 1 with 144 SingleSign rule and 28 generalized
[2026-05-24 10:02:23] [INFO ] Computed 66 invariants in 1 ms
Computed 66 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12181659265599581318.kers
Total runtime 1 ms.
[2026-05-24 10:02:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/168 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/200 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/237 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 186/423 variables, 237/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/424 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/424 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 238/238 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/168 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 32/200 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 37/237 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/423 variables, 237/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/424 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/424 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 238/238 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1928ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 77 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 238/238 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 186/186 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-24 10:02:25] [INFO ] Invariant cache hit.
[2026-05-24 10:02:25] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-24 10:02:25] [INFO ] Invariant cache hit.
[2026-05-24 10:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 10:02:25] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2026-05-24 10:02:25] [INFO ] Redundant transitions in 10 ms returned []
Running 182 sub problems to find dead transitions.
[2026-05-24 10:02:25] [INFO ] Invariant cache hit.
[2026-05-24 10:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 2/238 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 9/95 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 8 (OVERLAPS) 186/424 variables, 238/335 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 1/336 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 20/356 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 20/376 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 20/396 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/416 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 20/436 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 20/456 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 20/476 constraints. Problems are: Problem set: 11 solved, 171 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 479 constraints, problems are : Problem set: 11 solved, 171 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 238/238 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 174/174 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 85/93 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/93 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/238 variables, 50/143 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 8/151 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 89/240 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/241 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/241 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 186/424 variables, 238/479 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 1/480 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 171/651 constraints. Problems are: Problem set: 11 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 20/671 constraints. Problems are: Problem set: 11 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 690 constraints, problems are : Problem set: 11 solved, 171 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 238/238 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/182 constraints, Known Traps: 214/214 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 11 solved, 171 unsolved
Search for dead transitions found 11 dead transitions in 60109ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 238/238 places, 175/186 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 236 transition count 175
Applied a total of 2 rules in 8 ms. Remains 236 /238 variables (removed 2) and now considering 175/175 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4218761770201627583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3198781990454909095.kers'
[2026-05-24 10:03:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4218761770201627583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3198781990454909095.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 236 cols 626 entries
Finished phase 1 with 125 SingleSign rule and 39 generalized
[2026-05-24 10:03:25] [INFO ] Computed 72 invariants in 1 ms
Computed 72 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3198781990454909095.kers
Total runtime 2 ms.
[2026-05-24 10:03:25] [INFO ] Implicit Places using invariants in 112 ms returned [232, 234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 113 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 234/238 places, 175/186 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 60694 ms. Remains : 234/238 places, 175/186 transitions.
RANDOM walk for 40000 steps (652 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1190469 steps, run timeout after 3001 ms. (steps per millisecond=396 ) properties seen :0 out of 1
Probabilistic random walk after 1190469 steps, saw 392469 distinct states, run finished after 3001 ms. (steps per millisecond=396 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8588806398822886888.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17495104691907746525.kers'
[2026-05-24 10:03:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8588806398822886888.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17495104691907746525.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 234 cols 622 entries
Finished phase 1 with 127 SingleSign rule and 37 generalized
[2026-05-24 10:03:28] [INFO ] Computed 70 invariants in 4 ms
Computed 70 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17495104691907746525.kers
Total runtime 5 ms.
[2026-05-24 10:03:28] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 89/166 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/198 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/233 variables, 21/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 175/408 variables, 233/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/409 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/409 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 234/234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 89/166 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 32/198 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 35/233 variables, 21/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 175/408 variables, 233/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/409 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/409 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/409 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1171 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 234/234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 77 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 234/234 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2026-05-24 10:03:30] [INFO ] Invariant cache hit.
[2026-05-24 10:03:30] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-24 10:03:30] [INFO ] Invariant cache hit.
[2026-05-24 10:03:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 10:03:30] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2026-05-24 10:03:30] [INFO ] Redundant transitions in 2 ms returned []
Running 171 sub problems to find dead transitions.
[2026-05-24 10:03:30] [INFO ] Invariant cache hit.
[2026-05-24 10:03:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 2/234 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/409 variables, and 313 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/234 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 243/243 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 144/159 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/234 variables, 49/208 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 6/214 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 99/313 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 20/393 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 20/413 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 20/433 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 20/453 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 20/493 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 20/513 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/234 variables, 20/533 constraints. Problems are: Problem set: 0 solved, 171 unsolved
SMT process timed out in 60060ms, After SMT, problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60428 ms. Remains : 234/234 places, 175/175 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 234 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 174
Applied a total of 2 rules in 8 ms. Remains 233 /234 variables (removed 1) and now considering 174/175 (removed 1) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6932610238103061806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14020957887011757227.kers'
[2026-05-24 10:04:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6932610238103061806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14020957887011757227.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 233 cols 618 entries
Finished phase 1 with 126 SingleSign rule and 37 generalized
[2026-05-24 10:04:30] [INFO ] Computed 70 invariants in 1 ms
Computed 70 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14020957887011757227.kers
Total runtime 2 ms.
[2026-05-24 10:04:30] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 10:04:31] [INFO ] [Nat]Absence check using 49 positive place invariants in 7 ms returned sat
[2026-05-24 10:04:31] [INFO ] [Nat]Absence check using 49 positive and 21 generalized place invariants in 5 ms returned sat
[2026-05-24 10:04:31] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 10:04:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 10:04:31] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 10:04:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 219 ms
TRAPS : Iteration 1
[2026-05-24 10:04:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
TRAPS : Iteration 2
[2026-05-24 10:04:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
TRAPS : Iteration 3
[2026-05-24 10:04:31] [INFO ] After 517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:04:31] [INFO ] After 700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 10:04:31] [INFO ] Flatten gal took : 15 ms
[2026-05-24 10:04:31] [INFO ] Flatten gal took : 12 ms
[2026-05-24 10:04:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5084099397207907656.gal : 3 ms
[2026-05-24 10:04:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14319155526462852040.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/ReachabilityCardinality5084099397207907656.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14319155526462852040.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/ReachabilityCardinality14319155526462852040.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 38
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :38 after 77
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :77 after 755
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :755 after 9247
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9247 after 116305
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :116305 after 883713
Detected timeout of ITS tools.
[2026-05-24 10:04:46] [INFO ] Flatten gal took : 10 ms
[2026-05-24 10:04:46] [INFO ] Applying decomposition
[2026-05-24 10:04:46] [INFO ] Flatten gal took : 10 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/graph3347638778172698736.txt' '-o' '/tmp/graph3347638778172698736.bin' '-w' '/tmp/graph3347638778172698736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3347638778172698736.bin' '-l' '-1' '-v' '-w' '/tmp/graph3347638778172698736.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:04:46] [INFO ] Decomposing Gal with order
[2026-05-24 10:04:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:04:46] [INFO ] Removed a total of 66 redundant transitions.
[2026-05-24 10:04:47] [INFO ] Flatten gal took : 64 ms
[2026-05-24 10:04:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 17 ms.
[2026-05-24 10:04:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17736979467523375279.gal : 5 ms
[2026-05-24 10:04:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6866550702687885586.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/ReachabilityCardinality17736979467523375279.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6866550702687885586.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/ReachabilityCardinality6866550702687885586.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 73
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :73 after 854492
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-2024-15 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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\_mod\_flat,7.61378e+08,0.849271,13372,1259,160,17545,1108,740,29415,131,3131,0
Total reachable state count : 761377540

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-2024-15 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
BusinessProcesses-PT-10-ReachabilityCardinality-2024-15,6.72277e+06,1.36806,13632,573,121,17545,1108,1042,29415,150,3131,0
Over-approximation ignoring read arcs solved 0 properties in 17512 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 10:04:48] [INFO ] Flatten gal took : 20 ms
[2026-05-24 10:04:48] [INFO ] Applying decomposition
[2026-05-24 10:04:48] [INFO ] Flatten gal took : 19 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/graph5242109391190114828.txt' '-o' '/tmp/graph5242109391190114828.bin' '-w' '/tmp/graph5242109391190114828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5242109391190114828.bin' '-l' '-1' '-v' '-w' '/tmp/graph5242109391190114828.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:04:48] [INFO ] Decomposing Gal with order
[2026-05-24 10:04:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:04:48] [INFO ] Removed a total of 258 redundant transitions.
[2026-05-24 10:04:48] [INFO ] Flatten gal took : 37 ms
[2026-05-24 10:04:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2026-05-24 10:04:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8844822675968252489.gal : 9 ms
[2026-05-24 10:04:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15400336224764573243.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/ReachabilityCardinality8844822675968252489.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15400336224764573243.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/ReachabilityCardinality15400336224764573243.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 933
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :933 after 1193
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1193 after 1.61902e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.61902e+06 after 8.63366e+16
Detected timeout of ITS tools.
[2026-05-24 10:34:49] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
[2026-05-24 10:34:49] [INFO ] Applying decomposition
[2026-05-24 10:34:49] [INFO ] Flatten gal took : 6 ms
Built C files in :
/tmp/ltsmin13374084876195206518
[2026-05-24 10:34:49] [INFO ] Computing symmetric may disable matrix : 175 transitions.
[2026-05-24 10:34:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:34:49] [INFO ] Computing symmetric may enable matrix : 175 transitions.
[2026-05-24 10:34:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph1806692693546418020.txt' '-o' '/tmp/graph1806692693546418020.bin' '-w' '/tmp/graph1806692693546418020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1806692693546418020.bin' '-l' '-1' '-v' '-w' '/tmp/graph1806692693546418020.weights' '-q' '0' '-e' '0.001'
[2026-05-24 10:34:49] [INFO ] Computing Do-Not-Accords matrix : 175 transitions.
[2026-05-24 10:34:49] [INFO ] Decomposing Gal with order
[2026-05-24 10:34:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 10:34:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:34:49] [INFO ] Removed a total of 73 redundant transitions.
[2026-05-24 10:34:49] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13374084876195206518
Running compilation step : cd /tmp/ltsmin13374084876195206518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-24 10:34:49] [INFO ] Flatten gal took : 20 ms
[2026-05-24 10:34:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 9 ms.
[2026-05-24 10:34:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16522180508557793722.gal : 3 ms
[2026-05-24 10:34:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16099881207865401899.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/ReachabilityCardinality16522180508557793722.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16099881207865401899.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/ReachabilityCardinality16099881207865401899.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 5
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5 after 361
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :361 after 1.8005e+06
Compilation finished in 514 ms.
Running link step : cd /tmp/ltsmin13374084876195206518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13374084876195206518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'BusinessProcessesPT10ReachabilityCardinality202415==true'
LTSmin run took 1573 ms.
Found Violation
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2012374 ms.

BK_STOP 1779618891417

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="BusinessProcesses-PT-10"
export BK_EXAMINATION="ReachabilityCardinality"
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 BusinessProcesses-PT-10, examination is ReachabilityCardinality"
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-177946842000526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;