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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:53 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 1.6M 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-10b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678524650874

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-10b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-11 08:50:53] [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 08:50:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:50:53] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2023-03-11 08:50:53] [INFO ] Transformed 425 places.
[2023-03-11 08:50:54] [INFO ] Transformed 2252 transitions.
[2023-03-11 08:50:54] [INFO ] Found NUPN structural information;
[2023-03-11 08:50:54] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 451 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 76 resets, run finished after 662 ms. (steps per millisecond=15 ) properties (out of 14) seen :8
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 08:50:55] [INFO ] Flatten gal took : 531 ms
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
[2023-03-11 08:50:55] [INFO ] Flatten gal took : 265 ms
Running SMT prover for 5 properties.
// Phase 1: matrix 2252 rows 425 cols
[2023-03-11 08:50:55] [INFO ] Computed 15 place invariants in 31 ms
[2023-03-11 08:50:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5210142936261132580.gal : 125 ms
[2023-03-11 08:50:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13889745454949892152.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/ReachabilityCardinality5210142936261132580.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13889745454949892152.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2023-03-11 08:50:55] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 08:50:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
Loading property file /tmp/ReachabilityCardinality13889745454949892152.prop.
[2023-03-11 08:50:57] [INFO ] After 1123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :6 after 27
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :27 after 61
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :61 after 76
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :76 after 1041
[2023-03-11 08:50:58] [INFO ] Deduced a trap composed of 16 places in 1083 ms of which 8 ms to minimize.
[2023-03-11 08:50:59] [INFO ] Deduced a trap composed of 42 places in 773 ms of which 2 ms to minimize.
[2023-03-11 08:50:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2126 ms
[2023-03-11 08:51:00] [INFO ] Deduced a trap composed of 35 places in 850 ms of which 14 ms to minimize.
[2023-03-11 08:51:01] [INFO ] Deduced a trap composed of 48 places in 751 ms of which 1 ms to minimize.
[2023-03-11 08:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1699 ms
[2023-03-11 08:51:01] [INFO ] After 5749ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 397 ms.
[2023-03-11 08:51:02] [INFO ] After 6330ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 117 ms.
Support contains 49 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 321 edges and 425 vertex of which 2 / 425 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1996 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.19 ms
Discarding 4 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 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 133 rules applied. Total rules applied 135 place count 420 transition count 2114
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 154 rules applied. Total rules applied 289 place count 288 transition count 2092
Reduce places removed 10 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 29 rules applied. Total rules applied 318 place count 278 transition count 2073
Reduce places removed 19 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 3 with 21 rules applied. Total rules applied 339 place count 259 transition count 2071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 340 place count 258 transition count 2071
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 340 place count 258 transition count 2055
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 372 place count 242 transition count 2055
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 398 place count 216 transition count 2029
Iterating global reduction 5 with 26 rules applied. Total rules applied 424 place count 216 transition count 2029
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 426 place count 216 transition count 2027
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 426 place count 216 transition count 2026
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 428 place count 215 transition count 2026
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 435 place count 208 transition count 1886
Iterating global reduction 6 with 7 rules applied. Total rules applied 442 place count 208 transition count 1886
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 444 place count 208 transition count 1884
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 546 place count 157 transition count 1832
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 551 place count 152 transition count 1727
Iterating global reduction 7 with 5 rules applied. Total rules applied 556 place count 152 transition count 1727
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 560 place count 150 transition count 1728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 561 place count 150 transition count 1727
Drop transitions removed 287 transitions
Redundant transition composition rules discarded 287 transitions
Iterating global reduction 8 with 287 rules applied. Total rules applied 848 place count 150 transition count 1440
Free-agglomeration rule applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 865 place count 150 transition count 1423
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 882 place count 133 transition count 1423
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 884 place count 133 transition count 1421
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 885 place count 133 transition count 1421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 886 place count 132 transition count 1420
Applied a total of 886 rules in 949 ms. Remains 132 /425 variables (removed 293) and now considering 1420/2252 (removed 832) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 950 ms. Remains : 132/425 places, 1420/2252 transitions.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 1420 rows 132 cols
[2023-03-11 08:51:03] [INFO ] Computed 15 place invariants in 11 ms
[2023-03-11 08:51:03] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 08:51:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-11 08:51:04] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 08:51:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:51:04] [INFO ] After 144ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 08:51:05] [INFO ] Deduced a trap composed of 13 places in 1007 ms of which 1 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1041 after 2.27195e+07
[2023-03-11 08:51:06] [INFO ] Deduced a trap composed of 11 places in 870 ms of which 1 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2.27195e+07 after 2.27349e+07
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :2.27349e+07 after 2.3119e+07
[2023-03-11 08:51:07] [INFO ] Deduced a trap composed of 12 places in 1137 ms of which 1 ms to minimize.
[2023-03-11 08:51:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3171 ms
[2023-03-11 08:51:07] [INFO ] After 3415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-11 08:51:07] [INFO ] After 3972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 20 ms.
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 1420/1420 transitions.
Graph (trivial) has 103 edges and 132 vertex of which 2 / 132 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1295 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 130 transition count 1388
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 36 rules applied. Total rules applied 68 place count 100 transition count 1382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 98 transition count 1382
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 70 place count 98 transition count 1379
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 95 transition count 1379
SDD proceeding with computation,5 properties remain. new max is 8192
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 91 transition count 1375
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 91 transition count 1375
SDD size :2.3119e+07 after 5.08103e+07
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 115 place count 75 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 75 transition count 1358
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 73 transition count 1346
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 73 transition count 1346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 73 transition count 1345
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 123 place count 72 transition count 1344
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 134 place count 72 transition count 1333
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 165 place count 61 transition count 1313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 60 transition count 1312
Applied a total of 166 rules in 353 ms. Remains 60 /132 variables (removed 72) and now considering 1312/1420 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 60/132 places, 1312/1420 transitions.
Finished random walk after 144 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=48 )
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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 14391 ms.

BK_STOP 1678524668471

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-10b"
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-10b, 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-167813593500686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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