fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r026-smll-171620167400278
Last Updated
July 7, 2024

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
386.840 13085.00 39336.00 150.90 TTTFTFFTTFFTFFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r026-smll-171620167400278.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is AutonomousCar-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167400278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716323906979

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 20:38:29] [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]
[2024-05-21 20:38:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:38:29] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-05-21 20:38:30] [INFO ] Transformed 221 places.
[2024-05-21 20:38:30] [INFO ] Transformed 368 transitions.
[2024-05-21 20:38:30] [INFO ] Found NUPN structural information;
[2024-05-21 20:38:30] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 481 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:38:31] [INFO ] Flatten gal took : 282 ms
RANDOM walk for 40000 steps (64 resets) in 2904 ms. (13 steps per ms) remains 4/15 properties
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 20:38:31] [INFO ] Flatten gal took : 153 ms
[2024-05-21 20:38:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12456987152708425195.gal : 72 ms
BEST_FIRST walk for 40002 steps (26 resets) in 705 ms. (56 steps per ms) remains 4/4 properties
[2024-05-21 20:38:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3015761849522878684.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12456987152708425195.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3015761849522878684.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (79 resets) in 444 ms. (89 steps per ms) remains 4/4 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3015761849522878684.prop.
BEST_FIRST walk for 40000 steps (50 resets) in 361 ms. (110 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :6 after 22
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :22 after 56
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :56 after 1426
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1426 after 7086
BEST_FIRST walk for 40001 steps (64 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
// Phase 1: matrix 368 rows 221 cols
[2024-05-21 20:38:31] [INFO ] Computed 9 invariants in 40 ms
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :7086 after 73013
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 169/221 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 169/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 368/589 variables, 221/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/589 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 451 constraints, problems are : Problem set: 0 solved, 4 unsolved in 968 ms.
Refiners :[Domain max(s): 221/221 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AutonomousCar-PT-04b-ReachabilityCardinality-2024-00 is UNSAT
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 169/221 variables, 9/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 169/230 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 20:38:33] [INFO ] Deduced a trap composed of 35 places in 364 ms of which 58 ms to minimize.
[2024-05-21 20:38:34] [INFO ] Deduced a trap composed of 35 places in 322 ms of which 4 ms to minimize.
[2024-05-21 20:38:34] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 3 ms to minimize.
[2024-05-21 20:38:34] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 3 ms to minimize.
[2024-05-21 20:38:34] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 3 ms to minimize.
[2024-05-21 20:38:34] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :73013 after 677053
[2024-05-21 20:38:35] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 4 ms to minimize.
[2024-05-21 20:38:35] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 3 ms to minimize.
[2024-05-21 20:38:35] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 3 ms to minimize.
[2024-05-21 20:38:35] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 3 ms to minimize.
[2024-05-21 20:38:36] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 11/241 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 20:38:36] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 3 ms to minimize.
[2024-05-21 20:38:36] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 2 ms to minimize.
[2024-05-21 20:38:36] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:38:36] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:38:36] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 5/246 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 20:38:37] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 1/247 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-21 20:38:37] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/248 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AutonomousCar-PT-04b-ReachabilityCardinality-2024-11 is UNSAT
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 368/589 variables, 221/469 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 2/471 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 0/471 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/589 variables, 0/471 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/589 variables, and 471 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4606 ms.
Refiners :[Domain max(s): 221/221 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 5804ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 981 ms.
Support contains 20 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 368/368 transitions.
Graph (trivial) has 171 edges and 221 vertex of which 2 / 221 are part of one of the 1 SCC in 5 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 586 edges and 220 vertex of which 216 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 216 transition count 290
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 84 rules applied. Total rules applied 159 place count 144 transition count 278
Reduce places removed 6 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 13 rules applied. Total rules applied 172 place count 138 transition count 271
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 179 place count 131 transition count 271
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 179 place count 131 transition count 261
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 199 place count 121 transition count 261
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 214 place count 106 transition count 246
Iterating global reduction 4 with 15 rules applied. Total rules applied 229 place count 106 transition count 246
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 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 4 with 66 rules applied. Total rules applied 295 place count 106 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 296 place count 105 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 296 place count 105 transition count 179
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 298 place count 104 transition count 179
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 302 place count 100 transition count 166
Iterating global reduction 6 with 4 rules applied. Total rules applied 306 place count 100 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 307 place count 100 transition count 165
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 351 place count 78 transition count 143
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 353 place count 76 transition count 133
Iterating global reduction 7 with 2 rules applied. Total rules applied 355 place count 76 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 359 place count 74 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 360 place count 74 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 363 place count 74 transition count 142
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 368 place count 74 transition count 137
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 373 place count 69 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 375 place count 69 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 376 place count 68 transition count 134
Applied a total of 376 rules in 253 ms. Remains 68 /221 variables (removed 153) and now considering 134/368 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 68/221 places, 134/368 transitions.
RANDOM walk for 40000 steps (124 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (132 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (342 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 357428 steps, run visited all 2 properties in 841 ms. (steps per millisecond=425 )
Probabilistic random walk after 357428 steps, saw 66872 distinct states, run finished after 847 ms. (steps per millisecond=421 ) properties seen :2
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-2024-02 TRUE 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 10516 ms.

BK_STOP 1716323920064

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-04b"
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-5568"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-04b, 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 r026-smll-171620167400278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04b.tgz
mv AutonomousCar-PT-04b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;