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-167813593300574.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-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593300574
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 75K 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-03b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-03b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678520516293

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-03b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-11 07:41:58] [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:41:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:41:58] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-11 07:41:58] [INFO ] Transformed 190 places.
[2023-03-11 07:41:58] [INFO ] Transformed 273 transitions.
[2023-03-11 07:41:58] [INFO ] Found NUPN structural information;
[2023-03-11 07:41:58] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 07:41:59] [INFO ] Flatten gal took : 150 ms
[2023-03-11 07:41:59] [INFO ] Flatten gal took : 41 ms
[2023-03-11 07:41:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10799509510874570886.gal : 20 ms
[2023-03-11 07:41:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9780366973886173624.prop : 1 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/ReachabilityCardinality10799509510874570886.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9780366973886173624.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete random walk after 10000 steps, including 10 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 14) seen :7
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-00 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 ...329
Loading property file /tmp/ReachabilityCardinality9780366973886173624.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :6 after 23
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :23 after 48
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :48 after 76
Invariant property AutonomousCar-PT-03b-ReachabilityCardinality-10 does not hold.
Reachability property AutonomousCar-PT-03b-ReachabilityCardinality-09 is true.
Reachability property AutonomousCar-PT-03b-ReachabilityCardinality-03 is true.
Invariant property AutonomousCar-PT-03b-ReachabilityCardinality-00 does not hold.
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :76 after 1647
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :1647 after 2141
Invariant property AutonomousCar-PT-03b-ReachabilityCardinality-11 does not hold.
Reachability property AutonomousCar-PT-03b-ReachabilityCardinality-06 is true.
Invariant property AutonomousCar-PT-03b-ReachabilityCardinality-02 does not hold.
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :2141 after 22157
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :22157 after 44197
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :44197 after 256767
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 273 rows 190 cols
[2023-03-11 07:42:00] [INFO ] Computed 8 place invariants in 9 ms
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :256767 after 520528
[2023-03-11 07:42:00] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 07:42:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-11 07:42:00] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-11 07:42:01] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 4 ms to minimize.
[2023-03-11 07:42:01] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2023-03-11 07:42:01] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2023-03-11 07:42:01] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2023-03-11 07:42:01] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-11 07:42:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 488 ms
[2023-03-11 07:42:01] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2023-03-11 07:42:01] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-11 07:42:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :520528 after 1.09907e+06
[2023-03-11 07:42:01] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2023-03-11 07:42:01] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 0 ms to minimize.
[2023-03-11 07:42:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 217 ms
[2023-03-11 07:42:01] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2023-03-11 07:42:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2023-03-11 07:42:01] [INFO ] After 1249ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-11 07:42:02] [INFO ] After 1469ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 46 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 273/273 transitions.
Graph (trivial) has 100 edges and 190 vertex of which 2 / 190 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 438 edges and 189 vertex of which 188 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 188 transition count 228
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 50 rules applied. Total rules applied 95 place count 145 transition count 221
Reduce places removed 4 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 10 rules applied. Total rules applied 105 place count 141 transition count 215
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 111 place count 135 transition count 215
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 111 place count 135 transition count 207
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 127 place count 127 transition count 207
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 136 place count 118 transition count 198
Iterating global reduction 4 with 9 rules applied. Total rules applied 145 place count 118 transition count 198
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 38 rules applied. Total rules applied 183 place count 118 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 184 place count 117 transition count 160
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 210 place count 104 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 214 place count 102 transition count 155
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 218 place count 102 transition count 151
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 223 place count 102 transition count 146
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 228 place count 97 transition count 146
Applied a total of 228 rules in 67 ms. Remains 97 /190 variables (removed 93) and now considering 146/273 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 97/190 places, 146/273 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 146 rows 97 cols
[2023-03-11 07:42:02] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-11 07:42:02] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:42:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-11 07:42:02] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:42:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 07:42:02] [INFO ] After 37ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:42:02] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2023-03-11 07:42:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-11 07:42:02] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2023-03-11 07:42:02] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-11 07:42:02] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2023-03-11 07:42:03] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2023-03-11 07:42:03] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2023-03-11 07:42:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2023-03-11 07:42:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 443 ms
[2023-03-11 07:42:03] [INFO ] After 646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-11 07:42:03] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 45 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 146/146 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 145
Applied a total of 2 rules in 19 ms. Remains 96 /97 variables (removed 1) and now considering 145/146 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 96/97 places, 145/146 transitions.
Incomplete random walk after 10000 steps, including 123 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 96 cols
[2023-03-11 07:42:03] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 07:42:03] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:42:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-11 07:42:03] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:42:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 07:42:03] [INFO ] After 11ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:42:03] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 07:42:03] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 145/145 transitions.
Graph (trivial) has 48 edges and 96 vertex of which 2 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 319 edges and 95 vertex of which 90 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 90 transition count 127
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 79 transition count 125
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 78 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 76 transition count 123
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 32 place count 76 transition count 119
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 40 place count 72 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 42 place count 70 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 70 transition count 117
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 70 place count 57 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 72 place count 55 transition count 96
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 55 transition count 96
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 55 transition count 95
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 78 place count 55 transition count 92
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 84 place count 52 transition count 89
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 85 place count 52 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 86 place count 51 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 50 transition count 88
Applied a total of 87 rules in 28 ms. Remains 50 /96 variables (removed 46) and now considering 88/145 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 50/96 places, 88/145 transitions.
Incomplete random walk after 10000 steps, including 316 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 39553 steps, run visited all 1 properties in 79 ms. (steps per millisecond=500 )
Probabilistic random walk after 39553 steps, saw 9318 distinct states, run finished after 79 ms. (steps per millisecond=500 ) properties seen :1
FORMULA AutonomousCar-PT-03b-ReachabilityCardinality-01 TRUE 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 5179 ms.

BK_STOP 1678520524197

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

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