fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r018-smll-177946787900078
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for AutonomousCar-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
494.951 20824.00 55981.00 116.40 TFTTFFFTFFFTTFFF normal

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-177946787900078.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is AutonomousCar-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.7K Mar 5 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 5 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 5 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 5 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 5 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 5 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 159K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779481077107

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-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 20:17:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 20:17:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:18:00] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2026-05-22 20:18:00] [INFO ] Transformed 255 places.
[2026-05-22 20:18:00] [INFO ] Transformed 490 transitions.
[2026-05-22 20:18:00] [INFO ] Found NUPN structural information;
[2026-05-22 20:18:00] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (62 resets) in 2221 ms. (18 steps per ms) remains 6/12 properties
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (68 resets) in 626 ms. (63 steps per ms) remains 6/6 properties
[2026-05-22 20:18:01] [INFO ] Flatten gal took : 334 ms
[2026-05-22 20:18:01] [INFO ] Flatten gal took : 198 ms
BEST_FIRST walk for 40004 steps (65 resets) in 1120 ms. (35 steps per ms) remains 4/6 properties
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (62 resets) in 426 ms. (93 steps per ms) remains 4/4 properties
[2026-05-22 20:18:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6190510839427363989.gal : 106 ms
[2026-05-22 20:18:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9019150054318017801.prop : 10 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/ReachabilityCardinality6190510839427363989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9019150054318017801.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40001 steps (49 resets) in 725 ms. (55 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality9019150054318017801.prop.
BEST_FIRST walk for 40003 steps (61 resets) in 549 ms. (72 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12628216209542583463.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17702860993727747253.kers'
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 6
[2026-05-22 20:18:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12628216209542583463.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17702860993727747253.kers]
SDD proceeding with computation,4 properties remain. new max is 32
Culled 0 columns in 0 ms.
// Phase 1: matrix 490 rows 255 cols 2527 entries
Finished phase 1 with 245 SingleSign rule and 0 generalized
[2026-05-22 20:18:02] [INFO ] Computed 10 invariants in 3 ms
SDD size :6 after 21
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :21 after 30
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17702860993727747253.kers
Total runtime 6 ms.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :30 after 51
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :51 after 11171
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :11171 after 24061
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :24061 after 127471
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :127471 after 625167
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AutonomousCar-PT-05b-ReachabilityCardinality-2024-01 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 153/255 variables, 10/112 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 153/265 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :625167 after 3.15128e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 490/745 variables, 255/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/745 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 745/745 variables, and 520 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1536 ms.
Refiners :[Domain max(s): 255/255 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 175/255 variables, 10/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 175/265 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 6852ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 255 transition count 460
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 64 place count 225 transition count 456
Reduce places removed 1 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 21 rules applied. Total rules applied 85 place count 224 transition count 436
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 105 place count 204 transition count 436
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 105 place count 204 transition count 426
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 125 place count 194 transition count 426
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 144 place count 175 transition count 407
Iterating global reduction 4 with 19 rules applied. Total rules applied 163 place count 175 transition count 407
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 104 rules applied. Total rules applied 267 place count 175 transition count 303
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 269 place count 173 transition count 303
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 271 place count 171 transition count 297
Iterating global reduction 6 with 2 rules applied. Total rules applied 273 place count 171 transition count 297
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 299 place count 158 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 303 place count 158 transition count 280
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 314 place count 158 transition count 269
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 325 place count 147 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 326 place count 147 transition count 268
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 328 place count 147 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 329 place count 146 transition count 267
Applied a total of 329 rules in 340 ms. Remains 146 /255 variables (removed 109) and now considering 267/490 (removed 223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 146/255 places, 267/490 transitions.
RANDOM walk for 40000 steps (217 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (58 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (64 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (132 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 913215 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :0 out of 3
Probabilistic random walk after 913215 steps, saw 144102 distinct states, run finished after 3007 ms. (steps per millisecond=303 ) 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-9749728126300047360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6492181733647523107.kers'
[2026-05-22 20:18:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9749728126300047360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6492181733647523107.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 146 cols 1449 entries
Finished phase 1 with 136 SingleSign rule and 0 generalized
[2026-05-22 20:18:12] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6492181733647523107.kers
Total runtime 2 ms.
[2026-05-22 20:18:12] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/146 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 267/413 variables, 146/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/413 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 157 constraints, problems are : Problem set: 0 solved, 3 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 146/146 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/1 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/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/146 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AutonomousCar-PT-05b-ReachabilityCardinality-2024-08 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 9/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 267/413 variables, 146/167 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AutonomousCar-PT-05b-ReachabilityCardinality-2024-03 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 5/174 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/174 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/174 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 174 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2673 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 146/146 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 3031ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 26 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 267/267 transitions.
Graph (trivial) has 78 edges and 146 vertex of which 2 / 146 are part of one of the 1 SCC in 12 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 562 edges and 145 vertex of which 144 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 144 transition count 239
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 29 rules applied. Total rules applied 57 place count 118 transition count 236
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 65 place count 117 transition count 229
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 75 place count 110 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 109 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 76 place count 109 transition count 225
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 108 transition count 225
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 86 place count 100 transition count 209
Iterating global reduction 5 with 8 rules applied. Total rules applied 94 place count 100 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 95 place count 100 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 95 place count 100 transition count 207
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 98 place count 98 transition count 207
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 122 place count 86 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 123 place count 86 transition count 194
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 124 place count 85 transition count 188
Iterating global reduction 7 with 1 rules applied. Total rules applied 125 place count 85 transition count 188
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 134 place count 85 transition count 179
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 143 place count 76 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 144 place count 76 transition count 178
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 146 place count 76 transition count 178
Applied a total of 146 rules in 128 ms. Remains 76 /146 variables (removed 70) and now considering 178/267 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 76/146 places, 178/267 transitions.
RANDOM walk for 40000 steps (299 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (187 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1392956 steps, run visited all 1 properties in 1917 ms. (steps per millisecond=726 )
Probabilistic random walk after 1392956 steps, saw 225555 distinct states, run finished after 1923 ms. (steps per millisecond=724 ) properties seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 18256 ms.

BK_STOP 1779481097931

--------------------
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-05b"
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-05b, 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-177946787900078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-05b.tgz
mv AutonomousCar-PT-05b execution
cd execution
if [ "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 ;