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-177946788000094.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-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.3K Mar 5 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 5 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 5 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 5 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 5 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:20 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 228K 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-06b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779486810375

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 21:53:33] [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-22 21:53:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:53:33] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2026-05-22 21:53:33] [INFO ] Transformed 289 places.
[2026-05-22 21:53:33] [INFO ] Transformed 644 transitions.
[2026-05-22 21:53:33] [INFO ] Found NUPN structural information;
[2026-05-22 21:53:33] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (264 resets) in 2845 ms. (14 steps per ms) remains 2/14 properties
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (66 resets) in 1199 ms. (33 steps per ms) remains 2/2 properties
[2026-05-22 21:53:35] [INFO ] Flatten gal took : 391 ms
BEST_FIRST walk for 40002 steps (53 resets) in 661 ms. (60 steps per ms) remains 2/2 properties
[2026-05-22 21:53:35] [INFO ] Flatten gal took : 187 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17684728968197611871.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9226065694877640410.kers'
[2026-05-22 21:53:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1992285095519927136.gal : 109 ms
[2026-05-22 21:53:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17684728968197611871.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9226065694877640410.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 644 rows 289 cols 3812 entries
[2026-05-22 21:53:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9238252718057613569.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/ReachabilityCardinality1992285095519927136.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9238252718057613569.prop' '--nowitness' '--gen-order' 'FOLLOW'
Finished phase 1 with 278 SingleSign rule and 0 generalized
[2026-05-22 21:53:35] [INFO ] Computed 11 invariants in 5 ms
Computed 11 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9226065694877640410.kers
Total runtime 9 ms.

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
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality9238252718057613569.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 24
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :24 after 55
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :55 after 93
All remaining problems are real, not stopping.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :93 after 88984
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :88984 after 91587
At refinement iteration 2 (OVERLAPS) 227/289 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 227/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :91587 after 516292
At refinement iteration 5 (OVERLAPS) 644/933 variables, 289/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/933 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 589 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2231 ms.
Refiners :[Domain max(s): 289/289 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 289/289 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/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 227/289 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 227/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AutonomousCar-PT-06b-ReachabilityCardinality-2024-09 is UNSAT
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
SMT process timed out in 7863ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 644/644 transitions.
Graph (trivial) has 220 edges and 289 vertex of which 2 / 289 are part of one of the 1 SCC in 14 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 960 edges and 288 vertex of which 284 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 284 transition count 540
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 123 rules applied. Total rules applied 224 place count 186 transition count 515
Reduce places removed 14 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 27 rules applied. Total rules applied 251 place count 172 transition count 502
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 18 rules applied. Total rules applied 269 place count 159 transition count 497
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 271 place count 157 transition count 497
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 271 place count 157 transition count 485
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 295 place count 145 transition count 485
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 318 place count 122 transition count 462
Iterating global reduction 5 with 23 rules applied. Total rules applied 341 place count 122 transition count 462
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 485 place count 122 transition count 318
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 485 place count 122 transition count 317
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 487 place count 121 transition count 317
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 492 place count 116 transition count 292
Iterating global reduction 6 with 5 rules applied. Total rules applied 497 place count 116 transition count 292
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 501 place count 116 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 502 place count 115 transition count 288
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 556 place count 88 transition count 261
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 559 place count 85 transition count 240
Iterating global reduction 8 with 3 rules applied. Total rules applied 562 place count 85 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 565 place count 85 transition count 237
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 573 place count 85 transition count 229
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 581 place count 77 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 582 place count 76 transition count 228
Applied a total of 582 rules in 308 ms. Remains 76 /289 variables (removed 213) and now considering 228/644 (removed 416) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 76/289 places, 228/644 transitions.
RANDOM walk for 40000 steps (261 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (156 resets) in 490 ms. (81 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :516292 after 1.87788e+06
Interrupted probabilistic random walk after 1741832 steps, run timeout after 3001 ms. (steps per millisecond=580 ) properties seen :0 out of 1
Probabilistic random walk after 1741832 steps, saw 262772 distinct states, run finished after 3008 ms. (steps per millisecond=579 ) 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-14297417574733940716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12498786010008097239.kers'
[2026-05-22 21:53:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14297417574733940716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12498786010008097239.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 228 rows 75 cols 1756 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-22 21:53:46] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12498786010008097239.kers
Total runtime 4 ms.
[2026-05-22 21:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/76 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 228/304 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 88 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 76/76 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/76 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 228/304 variables, 76/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 835 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1009ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 26 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 228/228 transitions.
Applied a total of 0 rules in 11 ms. Remains 76 /76 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 76/76 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 228/228 transitions.
Applied a total of 0 rules in 10 ms. Remains 76 /76 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2026-05-22 21:53:47] [INFO ] Invariant cache hit.
[2026-05-22 21:53:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-22 21:53:47] [INFO ] Invariant cache hit.
[2026-05-22 21:53:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 21:53:48] [INFO ] Implicit Places using invariants and state equation in 270 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 385 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 75/76 places, 228/228 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 228
Applied a total of 1 rules in 23 ms. Remains 75 /75 variables (removed 0) and now considering 228/228 (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-797788021145188029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11773651566287226720.kers'
[2026-05-22 21:53:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-797788021145188029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11773651566287226720.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 228 rows 74 cols 1753 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-22 21:53:48] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11773651566287226720.kers
Total runtime 2 ms.
[2026-05-22 21:53:48] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-22 21:53:48] [INFO ] Invariant cache hit.
[2026-05-22 21:53:48] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 75/76 places, 228/228 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 695 ms. Remains : 75/76 places, 228/228 transitions.
RANDOM walk for 40000 steps (123 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (69 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1983006 steps, run timeout after 3001 ms. (steps per millisecond=660 ) properties seen :0 out of 1
Probabilistic random walk after 1983006 steps, saw 294912 distinct states, run finished after 3001 ms. (steps per millisecond=660 ) properties seen :0
[2026-05-22 21:53:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/73 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 228/301 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/303 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 75/75 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/73 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 228/301 variables, 73/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/303 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 87 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1931ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 26 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 228/228 transitions.
Applied a total of 0 rules in 10 ms. Remains 75 /75 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 75/75 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 228/228 transitions.
Applied a total of 0 rules in 27 ms. Remains 75 /75 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2026-05-22 21:53:53] [INFO ] Invariant cache hit.
[2026-05-22 21:53:53] [INFO ] Implicit Places using invariants in 204 ms returned []
[2026-05-22 21:53:53] [INFO ] Invariant cache hit.
[2026-05-22 21:53:54] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2026-05-22 21:53:54] [INFO ] Redundant transitions in 25 ms returned []
Running 225 sub problems to find dead transitions.
[2026-05-22 21:53:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Problem TDEAD197 is UNSAT
At refinement iteration 5 (OVERLAPS) 228/303 variables, 75/91 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 2/93 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 2/95 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 95 constraints, problems are : Problem set: 1 solved, 224 unsolved in 27718 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 3/75 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 228/303 variables, 75/93 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 224/317 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/318 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 2/320 constraints. Problems are: Problem set: 1 solved, 224 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 5/325 constraints. Problems are: Problem set: 1 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/303 variables, and 325 constraints, problems are : Problem set: 1 solved, 224 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 224/225 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 58392ms problems are : Problem set: 1 solved, 224 unsolved
Search for dead transitions found 1 dead transitions in 58396ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 75/75 places, 227/228 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 74 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 74 transition count 226
Applied a total of 3 rules in 41 ms. Remains 74 /75 variables (removed 1) and now considering 226/227 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12307163466899354098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15304172406628381491.kers'
[2026-05-22 21:54:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12307163466899354098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15304172406628381491.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 226 rows 73 cols 1747 entries
Finished phase 1 with 64 SingleSign rule and 0 generalized
[2026-05-22 21:54:52] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15304172406628381491.kers
Total runtime 2 ms.
[2026-05-22 21:54:52] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-22 21:54:52] [INFO ] Invariant cache hit.
[2026-05-22 21:54:53] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 74/75 places, 226/228 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59422 ms. Remains : 74/75 places, 226/228 transitions.
RANDOM walk for 40000 steps (130 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (218 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2119366 steps, run timeout after 3001 ms. (steps per millisecond=706 ) properties seen :0 out of 1
Probabilistic random walk after 2119366 steps, saw 311160 distinct states, run finished after 3001 ms. (steps per millisecond=706 ) properties seen :0
[2026-05-22 21:54:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 226/298 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/300 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 74/74 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 226/298 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/300 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 88 constraints, problems are : Problem set: 0 solved, 1 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 743ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 26 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 226/226 transitions.
Applied a total of 0 rules in 11 ms. Remains 74 /74 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 74/74 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 226/226 transitions.
Applied a total of 0 rules in 11 ms. Remains 74 /74 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2026-05-22 21:54:57] [INFO ] Invariant cache hit.
[2026-05-22 21:54:57] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-22 21:54:57] [INFO ] Invariant cache hit.
[2026-05-22 21:54:57] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2026-05-22 21:54:57] [INFO ] Redundant transitions in 13 ms returned []
Running 223 sub problems to find dead transitions.
[2026-05-22 21:54:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 3/74 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 226/300 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/300 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 93 constraints, problems are : Problem set: 0 solved, 223 unsolved in 19801 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 3/74 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 226/300 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 223/313 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/300 variables, and 324 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 50248ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 50250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50705 ms. Remains : 74/74 places, 226/226 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 21:55:47] [INFO ] Flatten gal took : 157 ms
[2026-05-22 21:55:47] [INFO ] Applying decomposition
[2026-05-22 21:55:48] [INFO ] Flatten gal took : 116 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/graph4409939276948865158.txt' '-o' '/tmp/graph4409939276948865158.bin' '-w' '/tmp/graph4409939276948865158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4409939276948865158.bin' '-l' '-1' '-v' '-w' '/tmp/graph4409939276948865158.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:55:48] [INFO ] Decomposing Gal with order
[2026-05-22 21:55:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:55:48] [INFO ] Removed a total of 1203 redundant transitions.
[2026-05-22 21:55:49] [INFO ] Flatten gal took : 300 ms
[2026-05-22 21:55:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 22 ms.
[2026-05-22 21:55:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8430068059359706847.gal : 15 ms
[2026-05-22 21:55:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11683500885836627614.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/ReachabilityCardinality8430068059359706847.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11683500885836627614.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/ReachabilityCardinality11683500885836627614.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 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 2.66773e+06
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2.66773e+06 after 8.38153e+09
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,4.86429e+12,0.37751,13264,2029,130,18424,1055,782,16228,108,3472,0
Total reachable state count : 4864294113772

Verifying 1 reachability properties.
Reachability property AutonomousCar-PT-06b-ReachabilityCardinality-2024-13 is true.
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-2024-13 TRUE 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-06b-ReachabilityCardinality-2024-13,6.64637e+07,0.415634,13496,133,28,18424,1055,822,16228,117,3472,11893
All properties solved without resorting to model-checking.
Total runtime 136508 ms.

BK_STOP 1779486949658

--------------------
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="AutonomousCar-PT-06b"
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 AutonomousCar-PT-06b, 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 r018-smll-177946788000094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06b.tgz
mv AutonomousCar-PT-06b 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 ;