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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.1K Mar 5 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 5 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 5 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 5 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 5 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 5 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:22 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 1.5M 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-10a-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779523862016

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-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-23 08:11:03] [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-23 08:11:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:11:04] [INFO ] Load time of PNML (sax parser for PT used): 355 ms
[2026-05-23 08:11:04] [INFO ] Transformed 97 places.
[2026-05-23 08:11:04] [INFO ] Transformed 1921 transitions.
[2026-05-23 08:11:04] [INFO ] Found NUPN structural information;
[2026-05-23 08:11:04] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 611 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1844 resets) in 5315 ms. (7 steps per ms) remains 5/12 properties
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (136 resets) in 502 ms. (79 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (132 resets) in 506 ms. (78 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (130 resets) in 275 ms. (144 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (146 resets) in 708 ms. (56 steps per ms) remains 5/5 properties
[2026-05-23 08:11:06] [INFO ] Flatten gal took : 1276 ms
BEST_FIRST walk for 40003 steps (100 resets) in 373 ms. (106 steps per ms) remains 5/5 properties
[2026-05-23 08:11:06] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11091185366420962115.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6415263933499086623.kers'
[2026-05-23 08:11:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11091185366420962115.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6415263933499086623.kers]
Normalized transition count is 1496 out of 1497 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 8 ms.
// Phase 1: matrix 1496 rows 96 cols 25097 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-23 08:11:07] [INFO ] Computed 15 invariants in 24 ms
Computed 15 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-6415263933499086623.kers
Total runtime 30 ms.
[2026-05-23 08:11:07] [INFO ] State equation strengthened by 403 read => feed constraints.
[2026-05-23 08:11:07] [INFO ] Flatten gal took : 451 ms
Excessive predecessor constraint size, skipping predecessor.
[2026-05-23 08:11:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1646109130378925498.gal : 233 ms
[2026-05-23 08:11:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17142627061839802980.prop : 7 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/ReachabilityCardinality1646109130378925498.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17142627061839802980.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AutonomousCar-PT-10a-ReachabilityCardinality-2024-01 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-10a-ReachabilityCardinality-2024-10 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 35/97 variables, 13/77 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 35/112 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality17142627061839802980.prop.
At refinement iteration 6 (OVERLAPS) 1496/1593 variables, 97/209 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 402/611 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 0/611 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1594 variables, 1/612 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1594/1594 variables, and 612 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1639 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 5/1 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/40 variables, 40/40 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/41 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AutonomousCar-PT-10a-ReachabilityCardinality-2024-03 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 57/97 variables, 14/55 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 57/112 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 46
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :46 after 56
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :56 after 298
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :298 after 362
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :362 after 2116
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2116 after 7554
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :7554 after 9858
At refinement iteration 6 (OVERLAPS) 1496/1593 variables, 97/209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 402/611 constraints. Problems are: Problem set: 3 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :9858 after 40314
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 1/612 constraints. Problems are: Problem set: 3 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :40314 after 242978
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :242978 after 1.46928e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/1593 variables, 6/618 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1593 variables, 0/618 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/1594 variables, 1/619 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1594 variables, 0/619 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1594 variables, 0/619 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1594/1594 variables, and 619 constraints, problems are : Problem set: 3 solved, 2 unsolved in 4889 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 7012ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1055 ms.
Support contains 27 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Graph (complete) has 1257 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.33 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 96 transition count 1492
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 92 transition count 1490
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 90 transition count 1490
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 90 transition count 1489
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 89 transition count 1489
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 22 place count 83 transition count 1423
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 83 transition count 1423
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 33 place count 83 transition count 1418
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 78 place count 78 transition count 1378
Applied a total of 78 rules in 537 ms. Remains 78 /97 variables (removed 19) and now considering 1378/1498 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 547 ms. Remains : 78/97 places, 1378/1498 transitions.
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.46928e+06 after 5.89261e+06
RANDOM walk for 40000 steps (1742 resets) in 2020 ms. (19 steps per ms) remains 1/2 properties
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (170 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12989481938186296853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7193547711473210332.kers'
[2026-05-23 08:11:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12989481938186296853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7193547711473210332.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 1378 rows 77 cols 24460 entries
Finished phase 1 with 64 SingleSign rule and 0 generalized
[2026-05-23 08:11:16] [INFO ] Computed 14 invariants in 13 ms
Computed 14 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-7193547711473210332.kers
Total runtime 18 ms.
[2026-05-23 08:11:16] [INFO ] State equation strengthened by 302 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/75 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1378/1453 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 302/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1456 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1456 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1456 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1456/1456 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 78/78 constraints, ReadFeed: 302/302 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/75 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1378/1453 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 302/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/1456 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1456 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1456 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1456 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1456 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1456 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1456/1456 variables, and 400 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2606 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 78/78 constraints, ReadFeed: 302/302 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 3502ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 647 ms.
Support contains 21 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 1378/1378 transitions.
Graph (complete) has 1113 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 76 transition count 1367
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 76 transition count 1367
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 76 transition count 1365
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 27 place count 74 transition count 1345
Applied a total of 27 rules in 224 ms. Remains 74 /78 variables (removed 4) and now considering 1345/1378 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 74/78 places, 1345/1378 transitions.
RANDOM walk for 40000 steps (1150 resets) in 2312 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (182 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 522633 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 522633 steps, saw 67468 distinct states, run finished after 3007 ms. (steps per millisecond=173 ) 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-5966699274428042466.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6653362872898765162.kers'
[2026-05-23 08:11:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5966699274428042466.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6653362872898765162.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 1345 rows 73 cols 24273 entries
Finished phase 1 with 61 SingleSign rule and 0 generalized
[2026-05-23 08:11:24] [INFO ] Computed 13 invariants in 13 ms
Computed 13 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-6653362872898765162.kers
Total runtime 17 ms.
[2026-05-23 08:11:24] [INFO ] State equation strengthened by 272 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/69 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :5.89261e+06 after 2.3681e+07
At refinement iteration 3 (OVERLAPS) 1345/1414 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1414 variables, 272/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1414 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/1419 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1419 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1419 variables, and 359 constraints, problems are : Problem set: 0 solved, 1 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 74/74 constraints, ReadFeed: 272/272 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/69 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1345/1414 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1414 variables, 272/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1414 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1414 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/1419 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1419 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1419 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1419 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1419/1419 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3765 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 74/74 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 4525ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 571 ms.
Support contains 21 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 1345/1345 transitions.
Applied a total of 0 rules in 93 ms. Remains 74 /74 variables (removed 0) and now considering 1345/1345 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 74/74 places, 1345/1345 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 1345/1345 transitions.
Applied a total of 0 rules in 89 ms. Remains 74 /74 variables (removed 0) and now considering 1345/1345 (removed 0) transitions.
[2026-05-23 08:11:29] [INFO ] Invariant cache hit.
[2026-05-23 08:11:30] [INFO ] Implicit Places using invariants in 709 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 728 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/74 places, 1345/1345 transitions.
Applied a total of 0 rules in 101 ms. Remains 73 /73 variables (removed 0) and now considering 1345/1345 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 920 ms. Remains : 73/74 places, 1345/1345 transitions.
RANDOM walk for 40000 steps (1124 resets) in 1779 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (183 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 586567 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 1
Probabilistic random walk after 586567 steps, saw 74553 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) 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-16063943139176573915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-452002506078509387.kers'
[2026-05-23 08:11:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16063943139176573915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-452002506078509387.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1345 rows 73 cols 24273 entries
Finished phase 1 with 61 SingleSign rule and 0 generalized
[2026-05-23 08:11:34] [INFO ] Computed 12 invariants in 13 ms
Computed 12 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-452002506078509387.kers
Total runtime 19 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1345/1413 variables, 68/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1413 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/1418 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1418 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1418 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1418/1418 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 73/73 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1345/1413 variables, 68/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1413 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1413 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1413 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/1418 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1418 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1418 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1418 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1418 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1418/1418 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2958 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 3840ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7506 steps, including 507 resets, run visited all 1 properties in 250 ms. (steps per millisecond=30 )
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 258 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 34344 ms.

BK_STOP 1779523898317

--------------------
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-10a"
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-10a, 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-177946788000150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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