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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
773.268 18374.00 52922.00 90.80 TTTFFTFFFTTFFTTF 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-177946788000110.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-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 7.8K Mar 5 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 5 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 5 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 5 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 5 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 5 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 5 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:21 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 334K 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-07b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779493244044

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-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 23:40:46] [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 23:40:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:40:47] [INFO ] Load time of PNML (sax parser for PT used): 296 ms
[2026-05-22 23:40:47] [INFO ] Transformed 323 places.
[2026-05-22 23:40:47] [INFO ] Transformed 846 transitions.
[2026-05-22 23:40:47] [INFO ] Found NUPN structural information;
[2026-05-22 23:40:47] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 542 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (273 resets) in 2210 ms. (18 steps per ms) remains 4/13 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (42 resets) in 1267 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (65 resets) in 216 ms. (184 steps per ms) remains 2/4 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-22 23:40:48] [INFO ] Flatten gal took : 723 ms
BEST_FIRST walk for 40002 steps (56 resets) in 1145 ms. (34 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11326372648972588039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12826990673367262642.kers'
[2026-05-22 23:40:48] [INFO ] Flatten gal took : 175 ms
[2026-05-22 23:40:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11326372648972588039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12826990673367262642.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 846 rows 323 cols 5865 entries
Finished phase 1 with 311 SingleSign rule and 0 generalized
[2026-05-22 23:40:48] [INFO ] Computed 12 invariants in 10 ms
Computed 12 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-12826990673367262642.kers
Total runtime 19 ms.
[2026-05-22 23:40:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8862181172407581174.gal : 95 ms
[2026-05-22 23:40:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10364704929489321421.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8862181172407581174.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10364704929489321421.prop' '--nowitness' '--gen-order' 'FOLLOW'

Excessive predecessor constraint size, skipping predecessor.
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
Loading property file /tmp/ReachabilityCardinality10364704929489321421.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 252/323 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 252/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6 after 24
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :24 after 49
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :49 after 109
At refinement iteration 5 (OVERLAPS) 846/1169 variables, 323/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1169 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1169 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :109 after 355243
After SMT solving in domain Real declared 1169/1169 variables, and 658 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1322 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :355243 after 357798
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 252/323 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 252/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :357798 after 428242
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :428242 after 2.23929e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.23929e+06 after 1.0764e+08
SMT process timed out in 6820ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Graph (trivial) has 189 edges and 323 vertex of which 4 / 323 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 1181 edges and 321 vertex of which 314 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.20 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 314 transition count 775
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 69 rules applied. Total rules applied 133 place count 252 transition count 768
Reduce places removed 4 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 26 rules applied. Total rules applied 159 place count 248 transition count 746
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 181 place count 226 transition count 746
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 181 place count 226 transition count 733
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 207 place count 213 transition count 733
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 227 place count 193 transition count 713
Iterating global reduction 4 with 20 rules applied. Total rules applied 247 place count 193 transition count 713
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 4 with 197 rules applied. Total rules applied 444 place count 193 transition count 516
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 446 place count 191 transition count 502
Iterating global reduction 5 with 2 rules applied. Total rules applied 448 place count 191 transition count 502
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 500 place count 165 transition count 476
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 502 place count 163 transition count 460
Iterating global reduction 5 with 2 rules applied. Total rules applied 504 place count 163 transition count 460
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 508 place count 161 transition count 460
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 509 place count 161 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 520 place count 161 transition count 448
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 531 place count 161 transition count 437
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 542 place count 150 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 544 place count 150 transition count 435
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 546 place count 150 transition count 435
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 548 place count 148 transition count 419
Iterating global reduction 7 with 2 rules applied. Total rules applied 550 place count 148 transition count 419
Applied a total of 550 rules in 391 ms. Remains 148 /323 variables (removed 175) and now considering 419/846 (removed 427) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 148/323 places, 419/846 transitions.
RANDOM walk for 40000 steps (766 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (124 resets) in 276 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (105 resets) in 293 ms. (136 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.0764e+08 after 5.89265e+08
Interrupted probabilistic random walk after 796854 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :0 out of 2
Probabilistic random walk after 796854 steps, saw 114346 distinct states, run finished after 3011 ms. (steps per millisecond=264 ) 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-16594026417496231851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3786858491069022754.kers'
[2026-05-22 23:40:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16594026417496231851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3786858491069022754.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 419 rows 148 cols 3269 entries
Finished phase 1 with 138 SingleSign rule and 0 generalized
[2026-05-22 23:40:59] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3786858491069022754.kers
Total runtime 4 ms.
[2026-05-22 23:40:59] [INFO ] State equation strengthened by 156 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/139 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 419/558 variables, 139/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 156/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/567 variables, 9/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/567 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 314 constraints, problems are : Problem set: 0 solved, 2 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 148/148 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/139 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 419/558 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 156/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AutonomousCar-PT-07b-ReachabilityCardinality-2024-13 is UNSAT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 9/567 variables, 9/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/567 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 322 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 148/148 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 2909ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 1669 steps, including 70 resets, run visited all 1 properties in 17 ms. (steps per millisecond=98 )
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 28 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 15811 ms.

BK_STOP 1779493262418

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

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