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.r018-smll-177946787900079.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 AutonomousCar-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.7K Mar 5 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 5 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 5 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 5 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 5 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 5 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 159K 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 AutonomousCar-PT-05b-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779481109299

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 20:18:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 20:18:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:18:31] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2026-05-22 20:18:31] [INFO ] Transformed 255 places.
[2026-05-22 20:18:31] [INFO ] Transformed 490 transitions.
[2026-05-22 20:18:31] [INFO ] Found NUPN structural information;
[2026-05-22 20:18:31] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (61 resets) in 3070 ms. (13 steps per ms) remains 8/16 properties
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (86 resets) in 398 ms. (100 steps per ms) remains 6/8 properties
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-22 20:18:33] [INFO ] Flatten gal took : 308 ms
BEST_FIRST walk for 40004 steps (86 resets) in 850 ms. (47 steps per ms) remains 6/6 properties
[2026-05-22 20:18:33] [INFO ] Flatten gal took : 225 ms
[2026-05-22 20:18:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3133457933540971475.gal : 169 ms
BEST_FIRST walk for 40002 steps (86 resets) in 916 ms. (43 steps per ms) remains 5/6 properties
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-22 20:18:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1159981470867464922.prop : 6 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/ReachabilityCardinality3133457933540971475.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1159981470867464922.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40002 steps (88 resets) in 709 ms. (56 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality1159981470867464922.prop.
BEST_FIRST walk for 40000 steps (57 resets) in 566 ms. (70 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (70 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :6 after 21
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :21 after 30
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :30 after 51
BEST_FIRST walk for 40003 steps (37 resets) in 436 ms. (91 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :51 after 11171
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :11171 after 24061
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2200886608657850871.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12586917670720334218.kers'
[2026-05-22 20:18:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2200886608657850871.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12586917670720334218.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 490 rows 255 cols 2527 entries
Finished phase 1 with 245 SingleSign rule and 0 generalized
[2026-05-22 20:18:34] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12586917670720334218.kers
Total runtime 4 ms.
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :24061 after 127471
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :127471 after 625167
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AutonomousCar-PT-05b-ReachabilityFireability-2024-01 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-05b-ReachabilityFireability-2024-13 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 151/255 variables, 10/114 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 151/265 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/265 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 490/745 variables, 255/520 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 0/520 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/745 variables, 0/520 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 745/745 variables, and 520 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1466 ms.
Refiners :[Domain max(s): 255/255 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 2 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :625167 after 3.15128e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 175/255 variables, 10/90 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 175/265 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AutonomousCar-PT-05b-ReachabilityFireability-2024-15 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 11/276 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/277 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 490/745 variables, 255/532 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/532 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/745 variables, 0/532 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 745/745 variables, and 532 constraints, problems are : Problem set: 3 solved, 2 unsolved in 4640 ms.
Refiners :[Domain max(s): 255/255 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6297ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 527 ms.
Support contains 60 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Graph (trivial) has 145 edges and 255 vertex of which 2 / 255 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 761 edges and 254 vertex of which 251 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 251 transition count 418
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 78 rules applied. Total rules applied 148 place count 184 transition count 407
Reduce places removed 5 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 21 rules applied. Total rules applied 169 place count 179 transition count 391
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 18 rules applied. Total rules applied 187 place count 163 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 188 place count 162 transition count 389
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 188 place count 162 transition count 376
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 214 place count 149 transition count 376
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 233 place count 130 transition count 357
Iterating global reduction 5 with 19 rules applied. Total rules applied 252 place count 130 transition count 357
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 5 with 101 rules applied. Total rules applied 353 place count 130 transition count 256
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 385 place count 114 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 388 place count 114 transition count 237
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 394 place count 114 transition count 231
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 400 place count 108 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 402 place count 108 transition count 229
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 406 place count 108 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 407 place count 107 transition count 228
Applied a total of 407 rules in 190 ms. Remains 107 /255 variables (removed 148) and now considering 228/490 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 107/255 places, 228/490 transitions.
RANDOM walk for 40000 steps (298 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (168 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (147 resets) in 477 ms. (83 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1055295 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 2
Probabilistic random walk after 1055295 steps, saw 166239 distinct states, run finished after 3007 ms. (steps per millisecond=350 ) 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-5187083122599393211.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15071837741477475192.kers'
[2026-05-22 20:18:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5187083122599393211.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15071837741477475192.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 228 rows 107 cols 1400 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-22 20:18:44] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15071837741477475192.kers
Total runtime 2 ms.
[2026-05-22 20:18:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/335 variables, 107/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/335 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 118 constraints, problems are : Problem set: 0 solved, 2 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/107 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 228/335 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/335 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1254 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1515ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 301 ms.
Support contains 60 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 228/228 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 107/107 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 228/228 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2026-05-22 20:18:46] [INFO ] Invariant cache hit.
[2026-05-22 20:18:46] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-22 20:18:46] [INFO ] Invariant cache hit.
[2026-05-22 20:18:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:18:46] [INFO ] Implicit Places using invariants and state equation in 149 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 270 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/107 places, 228/228 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 288 ms. Remains : 106/107 places, 228/228 transitions.
RANDOM walk for 40000 steps (100 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (107 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (101 resets) in 450 ms. (88 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1101955 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 2
Probabilistic random walk after 1101955 steps, saw 172949 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) 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-1417596600602765364.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4308880370490791366.kers'
[2026-05-22 20:18:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1417596600602765364.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4308880370490791366.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 228 rows 106 cols 1397 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-22 20:18:50] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4308880370490791366.kers
Total runtime 1 ms.
[2026-05-22 20:18:50] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/328 variables, 100/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/334 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/334 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 116 constraints, problems are : Problem set: 0 solved, 2 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/100 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 228/328 variables, 100/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/334 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/334 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1227ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 174 ms.
Support contains 60 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 228/228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 106/106 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 228/228 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2026-05-22 20:18:51] [INFO ] Invariant cache hit.
[2026-05-22 20:18:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-22 20:18:51] [INFO ] Invariant cache hit.
[2026-05-22 20:18:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:18:51] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2026-05-22 20:18:51] [INFO ] Redundant transitions in 11 ms returned []
Running 225 sub problems to find dead transitions.
[2026-05-22 20:18:51] [INFO ] Invariant cache hit.
[2026-05-22 20:18:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 225 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :3.15128e+06 after 1.52413e+07
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 228/333 variables, 105/144 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 12 (OVERLAPS) 1/334 variables, 1/152 constraints. Problems are: Problem set: 3 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/334 variables, 8/160 constraints. Problems are: Problem set: 3 solved, 222 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 334/334 variables, and 161 constraints, problems are : Problem set: 3 solved, 222 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 3 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 2/104 variables, 8/12 constraints. Problems are: Problem set: 3 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 29/41 constraints. Problems are: Problem set: 3 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 228/332 variables, 104/145 constraints. Problems are: Problem set: 3 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 1/146 constraints. Problems are: Problem set: 3 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 219/365 constraints. Problems are: Problem set: 3 solved, 222 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.52413e+07 after 2.07102e+07
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 6/371 constraints. Problems are: Problem set: 3 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 4/375 constraints. Problems are: Problem set: 3 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/375 constraints. Problems are: Problem set: 3 solved, 222 unsolved
SMT process timed out in 60430ms, After SMT, problems are : Problem set: 3 solved, 222 unsolved
Search for dead transitions found 3 dead transitions in 60437ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/106 places, 225/228 transitions.
Graph (complete) has 510 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 105 /106 variables (removed 1) and now considering 225/225 (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-5698261865980849639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8341523706054196896.kers'
[2026-05-22 20:19:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5698261865980849639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8341523706054196896.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 225 rows 105 cols 1389 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-22 20:19:52] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8341523706054196896.kers
Total runtime 2 ms.
[2026-05-22 20:19:52] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-22 20:19:52] [INFO ] Invariant cache hit.
[2026-05-22 20:19:52] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 105/106 places, 225/228 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60890 ms. Remains : 105/106 places, 225/228 transitions.
RANDOM walk for 40000 steps (234 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (149 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (139 resets) in 461 ms. (86 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1087408 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :0 out of 2
Probabilistic random walk after 1087408 steps, saw 170780 distinct states, run finished after 3001 ms. (steps per millisecond=362 ) properties seen :0
[2026-05-22 20:19:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/105 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 225/330 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/330 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 115 constraints, problems are : Problem set: 0 solved, 2 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/105 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 225/330 variables, 105/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 118 constraints, problems are : Problem set: 0 solved, 2 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 802ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 261 ms.
Support contains 60 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/105 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2026-05-22 20:19:56] [INFO ] Invariant cache hit.
[2026-05-22 20:19:56] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-22 20:19:56] [INFO ] Invariant cache hit.
[2026-05-22 20:19:56] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2026-05-22 20:19:56] [INFO ] Redundant transitions in 11 ms returned []
Running 222 sub problems to find dead transitions.
[2026-05-22 20:19:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 3/105 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 225/330 variables, 105/152 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 12 (OVERLAPS) 0/330 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 157 constraints, problems are : Problem set: 0 solved, 222 unsolved in 28427 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 3/105 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 222 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :2.07102e+07 after 4.31427e+07
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 225/330 variables, 105/152 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 222/374 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 5/382 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 330/330 variables, and 383 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 58617ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 58620ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58816 ms. Remains : 105/105 places, 225/225 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 20:20:55] [INFO ] Flatten gal took : 106 ms
[2026-05-22 20:20:55] [INFO ] Applying decomposition
[2026-05-22 20:20:55] [INFO ] Flatten gal took : 92 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/graph11780451583194867771.txt' '-o' '/tmp/graph11780451583194867771.bin' '-w' '/tmp/graph11780451583194867771.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11780451583194867771.bin' '-l' '-1' '-v' '-w' '/tmp/graph11780451583194867771.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:20:56] [INFO ] Decomposing Gal with order
[2026-05-22 20:20:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:20:56] [INFO ] Removed a total of 702 redundant transitions.
[2026-05-22 20:20:56] [INFO ] Flatten gal took : 351 ms
[2026-05-22 20:20:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 16 ms.
[2026-05-22 20:20:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6003279314116161463.gal : 10 ms
[2026-05-22 20:20:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17632027326335999592.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/ReachabilityCardinality6003279314116161463.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17632027326335999592.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/ReachabilityCardinality17632027326335999592.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 63
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :63 after 3.09486e+08
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,1.58e+11,0.130204,7036,694,129,4733,779,803,5017,127,1969,0
Total reachable state count : 158000170058

Verifying 2 reachability properties.
Invariant property AutonomousCar-PT-05b-ReachabilityFireability-2024-07 does not hold.
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-05b-ReachabilityFireability-2024-07,1.28018e+06,0.136076,7224,154,25,4733,779,915,5017,157,1969,495
Invariant property AutonomousCar-PT-05b-ReachabilityFireability-2024-09 does not hold.
FORMULA AutonomousCar-PT-05b-ReachabilityFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-05b-ReachabilityFireability-2024-09,1.26731e+08,0.163358,7224,185,33,4733,779,1073,5125,170,1969,6939
All properties solved without resorting to model-checking.
Total runtime 145695 ms.

BK_STOP 1779481257279

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="AutonomousCar-PT-05b"
export BK_EXAMINATION="ReachabilityFireability"
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 AutonomousCar-PT-05b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-smll-177946787900079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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