Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593400606.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r005-oct2-167813593400606
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K Mar 5 18:22 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-05b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678520996093

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-11 07:49: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]
[2023-03-11 07:49:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:49:59] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-11 07:49:59] [INFO ] Transformed 255 places.
[2023-03-11 07:49:59] [INFO ] Transformed 490 transitions.
[2023-03-11 07:49:59] [INFO ] Found NUPN structural information;
[2023-03-11 07:49:59] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 07:49:59] [INFO ] Flatten gal took : 101 ms
[2023-03-11 07:49:59] [INFO ] Flatten gal took : 39 ms
[2023-03-11 07:49:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10808575127326278290.gal : 43 ms
[2023-03-11 07:49:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14045888797909734626.prop : 2 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10808575127326278290.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14045888797909734626.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete random walk after 10000 steps, including 18 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 12) seen :7
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Loading property file /tmp/ReachabilityCardinality14045888797909734626.prop.
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :6 after 21
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :21 after 30
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :30 after 51
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :51 after 11171
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :11171 after 24061
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 490 rows 255 cols
[2023-03-11 07:50:00] [INFO ] Computed 10 place invariants in 28 ms
Invariant property AutonomousCar-PT-05b-ReachabilityCardinality-06 does not hold.
Invariant property AutonomousCar-PT-05b-ReachabilityCardinality-04 does not hold.
Invariant property AutonomousCar-PT-05b-ReachabilityCardinality-02 does not hold.
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :24061 after 127471
[2023-03-11 07:50:00] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :127471 after 521315
[2023-03-11 07:50:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-11 07:50:01] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-11 07:50:01] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 12 ms to minimize.
[2023-03-11 07:50:01] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2023-03-11 07:50:01] [INFO ] Deduced a trap composed of 35 places in 341 ms of which 1 ms to minimize.
[2023-03-11 07:50:02] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :521315 after 1.00899e+06
[2023-03-11 07:50:02] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 8 ms to minimize.
[2023-03-11 07:50:02] [INFO ] Deduced a trap composed of 30 places in 300 ms of which 1 ms to minimize.
[2023-03-11 07:50:02] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 1 ms to minimize.
[2023-03-11 07:50:02] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2023-03-11 07:50:03] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 0 ms to minimize.
[2023-03-11 07:50:03] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 0 ms to minimize.
[2023-03-11 07:50:03] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2023-03-11 07:50:03] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2023-03-11 07:50:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2031 ms
[2023-03-11 07:50:03] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2023-03-11 07:50:03] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2023-03-11 07:50:03] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2023-03-11 07:50:03] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2023-03-11 07:50:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 326 ms
[2023-03-11 07:50:03] [INFO ] After 2742ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-11 07:50:03] [INFO ] After 2982ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 49 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Graph (trivial) has 154 edges and 255 vertex of which 4 / 255 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 759 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 248 transition count 424
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 67 rules applied. Total rules applied 128 place count 190 transition count 415
Reduce places removed 5 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 18 rules applied. Total rules applied 146 place count 185 transition count 402
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 159 place count 172 transition count 402
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 159 place count 172 transition count 389
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 185 place count 159 transition count 389
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 200 place count 144 transition count 374
Iterating global reduction 4 with 15 rules applied. Total rules applied 215 place count 144 transition count 374
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 316 place count 144 transition count 273
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 316 place count 144 transition count 271
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 320 place count 142 transition count 271
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 322 place count 140 transition count 261
Iterating global reduction 5 with 2 rules applied. Total rules applied 324 place count 140 transition count 261
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 360 place count 122 transition count 243
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 361 place count 121 transition count 237
Iterating global reduction 5 with 1 rules applied. Total rules applied 362 place count 121 transition count 237
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 366 place count 119 transition count 237
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 369 place count 119 transition count 234
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 375 place count 119 transition count 228
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 381 place count 113 transition count 228
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 384 place count 113 transition count 225
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 386 place count 113 transition count 225
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 387 place count 112 transition count 219
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 112 transition count 219
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 389 place count 112 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 390 place count 111 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 391 place count 110 transition count 218
Applied a total of 391 rules in 139 ms. Remains 110 /255 variables (removed 145) and now considering 218/490 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 110/255 places, 218/490 transitions.
Incomplete random walk after 10000 steps, including 216 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Invariant property AutonomousCar-PT-05b-ReachabilityCardinality-07 does not hold.
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1.00899e+06 after 5.34499e+06
Interrupted probabilistic random walk after 2416605 steps, run timeout after 3001 ms. (steps per millisecond=805 ) properties seen :{1=1}
Probabilistic random walk after 2416605 steps, saw 355173 distinct states, run finished after 3003 ms. (steps per millisecond=804 ) properties seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 218 rows 110 cols
[2023-03-11 07:50:07] [INFO ] Computed 8 place invariants in 44 ms
[2023-03-11 07:50:07] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:50:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-11 07:50:07] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:50:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:50:07] [INFO ] After 57ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:50:07] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2023-03-11 07:50:07] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-03-11 07:50:07] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 0 ms to minimize.
[2023-03-11 07:50:08] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2023-03-11 07:50:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 598 ms
[2023-03-11 07:50:08] [INFO ] After 675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-11 07:50:08] [INFO ] After 800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 18 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 218/218 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 110 transition count 203
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 34 place count 95 transition count 199
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 93 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 92 transition count 197
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 39 place count 92 transition count 191
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 51 place count 86 transition count 191
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 53 place count 84 transition count 185
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 84 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 84 transition count 184
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 76 place count 74 transition count 174
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 78 place count 72 transition count 167
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 72 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 72 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 72 transition count 165
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 92 place count 72 transition count 155
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 102 place count 62 transition count 155
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 104 place count 62 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 105 place count 61 transition count 152
Applied a total of 105 rules in 57 ms. Remains 61 /110 variables (removed 49) and now considering 152/218 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 61/110 places, 152/218 transitions.
Incomplete random walk after 10000 steps, including 301 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 72162 steps, run visited all 1 properties in 82 ms. (steps per millisecond=880 )
Probabilistic random walk after 72162 steps, saw 13650 distinct states, run finished after 83 ms. (steps per millisecond=869 ) properties seen :1
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 9180 ms.

BK_STOP 1678521011286

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-5348"
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 r005-oct2-167813593400606"
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.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 ;