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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.0K Mar 5 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 5 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 5 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Mar 5 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 5 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 5 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 5 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:23 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.6M 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-10b-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779532651062

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-23 10:37:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 10:37:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 10:37:33] [INFO ] Load time of PNML (sax parser for PT used): 414 ms
[2026-05-23 10:37:33] [INFO ] Transformed 425 places.
[2026-05-23 10:37:33] [INFO ] Transformed 2252 transitions.
[2026-05-23 10:37:33] [INFO ] Found NUPN structural information;
[2026-05-23 10:37:33] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 612 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (275 resets) in 3712 ms. (10 steps per ms) remains 11/16 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (54 resets) in 455 ms. (87 steps per ms) remains 10/11 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (37 resets) in 510 ms. (78 steps per ms) remains 9/10 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (39 resets) in 1657 ms. (24 steps per ms) remains 9/9 properties
[2026-05-23 10:37:35] [INFO ] Flatten gal took : 1074 ms
BEST_FIRST walk for 40003 steps (38 resets) in 1219 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (86 resets) in 774 ms. (51 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (56 resets) in 310 ms. (128 steps per ms) remains 8/9 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-23 10:37:36] [INFO ] Flatten gal took : 628 ms
BEST_FIRST walk for 40003 steps (54 resets) in 357 ms. (111 steps per ms) remains 7/8 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (39 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (45 resets) in 930 ms. (42 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (54 resets) in 183 ms. (217 steps per ms) remains 6/7 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-23 10:37:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16186098931763268379.gal : 434 ms
[2026-05-23 10:37:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14764007394727608067.prop : 9 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/ReachabilityCardinality16186098931763268379.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14764007394727608067.prop' '--nowitness' '--gen-order' 'FOLLOW'
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16172111731668668036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16152972412380043517.kers'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
[2026-05-23 10:37:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16172111731668668036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16152972412380043517.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2252 rows 425 cols 29816 entries
Finished phase 1 with 410 SingleSign rule and 0 generalized
[2026-05-23 10:37:36] [INFO ] Computed 15 invariants in 23 ms
Computed 15 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-16152972412380043517.kers
Total runtime 30 ms.
Excessive predecessor constraint size, skipping predecessor.
Problem AutonomousCar-PT-10b-ReachabilityFireability-2024-07 is UNSAT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 322/402 variables, 14/94 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 322/416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Loading property file /tmp/ReachabilityCardinality14764007394727608067.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 23/425 variables, 1/417 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 23/440 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2252/2677 variables, 425/865 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2677 variables, 0/865 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :6 after 27
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :27 after 61
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :61 after 76
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :76 after 1041
At refinement iteration 10 (OVERLAPS) 0/2677 variables, 1/866 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2677 variables, 0/866 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2677 variables, 0/866 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2677/2677 variables, and 866 constraints, problems are : Problem set: 1 solved, 5 unsolved in 3952 ms.
Refiners :[Domain max(s): 425/425 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 334/402 variables, 14/82 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 334/416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 23/425 variables, 1/417 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 23/440 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2252/2677 variables, 425/865 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2677 variables, 1/866 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2677 variables, 0/866 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/2677 variables, 0/866 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
After SMT solving in domain Int declared 2677/2677 variables, and 866 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5015 ms.
Refiners :[Domain max(s): 425/425 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9277ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2507 ms.
Support contains 68 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 281 edges and 425 vertex of which 4 / 425 are part of one of the 2 SCC in 10 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1994 edges and 423 vertex of which 416 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.36 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 143 rules applied. Total rules applied 145 place count 416 transition count 2100
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 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 172 rules applied. Total rules applied 317 place count 275 transition count 2069
Reduce places removed 14 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 22 rules applied. Total rules applied 339 place count 261 transition count 2061
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 12 rules applied. Total rules applied 351 place count 253 transition count 2057
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 353 place count 251 transition count 2057
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 30 Pre rules applied. Total rules applied 353 place count 251 transition count 2027
Deduced a syphon composed of 30 places in 8 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 413 place count 221 transition count 2027
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 449 place count 185 transition count 1991
Iterating global reduction 5 with 36 rules applied. Total rules applied 485 place count 185 transition count 1991
Ensure Unique test removed 403 transitions
Reduce isomorphic transitions removed 403 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 5 with 404 rules applied. Total rules applied 889 place count 185 transition count 1587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 890 place count 184 transition count 1587
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 890 place count 184 transition count 1586
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 892 place count 183 transition count 1586
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 894 place count 181 transition count 1575
Iterating global reduction 7 with 2 rules applied. Total rules applied 896 place count 181 transition count 1575
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 897 place count 181 transition count 1574
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 953 place count 153 transition count 1546
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 955 place count 153 transition count 1544
Free-agglomeration rule applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 978 place count 153 transition count 1521
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 1001 place count 130 transition count 1521
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1002 place count 130 transition count 1520
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1008 place count 130 transition count 1520
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1009 place count 129 transition count 1519
Applied a total of 1009 rules in 1271 ms. Remains 129 /425 variables (removed 296) and now considering 1519/2252 (removed 733) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1282 ms. Remains : 129/425 places, 1519/2252 transitions.
RANDOM walk for 40000 steps (1006 resets) in 1094 ms. (36 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (83 resets) in 162 ms. (245 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (84 resets) in 659 ms. (60 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (81 resets) in 343 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (83 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (92 resets) in 880 ms. (45 steps per ms) remains 4/5 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2901431439295717254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17083194952094797034.kers'
[2026-05-23 10:37:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2901431439295717254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17083194952094797034.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1519 rows 129 cols 25880 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 10:37:50] [INFO ] Computed 15 invariants in 17 ms
Computed 15 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-17083194952094797034.kers
Total runtime 22 ms.
[2026-05-23 10:37:50] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/122 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 1024
At refinement iteration 3 (OVERLAPS) 1514/1636 variables, 122/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :1041 after 2.27195e+07
At refinement iteration 4 (INCLUDED_ONLY) 0/1636 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/1645 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1645 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1645 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1645 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/1647 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1647 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/1648 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :2.27195e+07 after 2.27349e+07
At refinement iteration 12 (INCLUDED_ONLY) 0/1648 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1648 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1648/1648 variables, and 145 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1053 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/122 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2.27349e+07 after 2.3119e+07
At refinement iteration 3 (OVERLAPS) 1514/1636 variables, 122/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1636 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :2.3119e+07 after 5.08103e+07
At refinement iteration 5 (INCLUDED_ONLY) 0/1636 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1636 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/1645 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1645 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1645 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1645 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/1647 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1647 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/1648 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1648 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1648 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1648/1648 variables, and 149 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4308 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 5462ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1863 ms.
Support contains 44 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 1519/1519 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 129 transition count 1509
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 119 transition count 1508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 118 transition count 1508
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 22 place count 118 transition count 1506
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 116 transition count 1506
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 30 place count 112 transition count 1483
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 112 transition count 1483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 112 transition count 1482
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 48 place count 112 transition count 1469
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 71 place count 99 transition count 1459
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 76 place count 99 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 77 place count 98 transition count 1458
Iterating global reduction 5 with 1 rules applied. Total rules applied 78 place count 98 transition count 1458
Applied a total of 78 rules in 375 ms. Remains 98 /129 variables (removed 31) and now considering 1458/1519 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 98/129 places, 1458/1519 transitions.
RANDOM walk for 40000 steps (1137 resets) in 1248 ms. (32 steps per ms) remains 4/4 properties
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :5.08103e+07 after 7.73755e+08
BEST_FIRST walk for 40003 steps (97 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (96 resets) in 450 ms. (88 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (96 resets) in 131 ms. (303 steps per ms) remains 3/4 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9721522678718621152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11847206411292693796.kers'
[2026-05-23 10:37:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9721522678718621152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11847206411292693796.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 1458 rows 97 cols 25574 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-23 10:37:59] [INFO ] Computed 15 invariants in 15 ms
Computed 15 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-11847206411292693796.kers
Total runtime 19 ms.
[2026-05-23 10:37:59] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1455/1548 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1548 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/1556 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1556 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1556 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1556 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1556 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1556/1556 variables, and 114 constraints, problems are : Problem set: 0 solved, 3 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 98/98 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/93 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1455/1548 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1548 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1548 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/1556 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1556 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1556 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1556 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1556 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1556/1556 variables, and 118 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4458 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 98/98 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5323ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1273 ms.
Support contains 43 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 1458/1458 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 1457
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 97 transition count 1447
Applied a total of 12 rules in 171 ms. Remains 97 /98 variables (removed 1) and now considering 1447/1458 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 97/98 places, 1447/1458 transitions.
RANDOM walk for 40000 steps (1108 resets) in 1061 ms. (37 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (95 resets) in 108 ms. (367 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (90 resets) in 375 ms. (106 steps per ms) remains 1/2 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (99 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-3934192072254791016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16481345784822540780.kers'
[2026-05-23 10:38:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3934192072254791016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16481345784822540780.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 1447 rows 96 cols 25492 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-23 10:38:06] [INFO ] Computed 15 invariants in 15 ms
Computed 15 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-16481345784822540780.kers
Total runtime 20 ms.
[2026-05-23 10:38:06] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/92 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1444/1536 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1536 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/1544 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1544 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1544 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1544 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1544 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1544/1544 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/92 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1444/1536 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1536 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1536 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1536 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1544 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1544 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1544 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1544 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1544 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1544/1544 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1914 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2578ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 237 ms.
Support contains 33 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 1447/1447 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 96 transition count 1446
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 1446
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 94 transition count 1444
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 94 transition count 1440
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 44 place count 90 transition count 1410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 89 transition count 1409
Applied a total of 45 rules in 285 ms. Remains 89 /97 variables (removed 8) and now considering 1409/1447 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 89/97 places, 1409/1447 transitions.
RANDOM walk for 40000 steps (399 resets) in 1036 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 9834 steps (8 resets) in 58 ms. (166 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 37312 ms.

BK_STOP 1779532690087

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-10b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-10b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-smll-177946788000159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10b.tgz
mv AutonomousCar-PT-10b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;