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.r011-oct2-167813600500622.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 smartxred
Input is AutonomousCar-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600500622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.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:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:52 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 228K 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-06b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678740502807

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:48:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:48:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:48:25] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-13 20:48:25] [INFO ] Transformed 289 places.
[2023-03-13 20:48:25] [INFO ] Transformed 644 transitions.
[2023-03-13 20:48:25] [INFO ] Found NUPN structural information;
[2023-03-13 20:48:25] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 95 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 11) seen :6
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 644 rows 289 cols
[2023-03-13 20:48:25] [INFO ] Computed 11 place invariants in 15 ms
[2023-03-13 20:48:26] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 20:48:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-13 20:48:26] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-13 20:48:27] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 12 ms to minimize.
[2023-03-13 20:48:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-13 20:48:27] [INFO ] After 969ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-13 20:48:27] [INFO ] After 1294ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 36 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 644/644 transitions.
Graph (trivial) has 208 edges and 289 vertex of which 4 / 289 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 958 edges and 287 vertex of which 280 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 280 transition count 551
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 94 rules applied. Total rules applied 180 place count 198 transition count 539
Reduce places removed 5 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 20 rules applied. Total rules applied 200 place count 193 transition count 524
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 20 rules applied. Total rules applied 220 place count 178 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 222 place count 176 transition count 519
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 222 place count 176 transition count 507
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 246 place count 164 transition count 507
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 266 place count 144 transition count 487
Iterating global reduction 5 with 20 rules applied. Total rules applied 286 place count 144 transition count 487
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Iterating post reduction 5 with 146 rules applied. Total rules applied 432 place count 144 transition count 341
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 432 place count 144 transition count 340
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 434 place count 143 transition count 340
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 438 place count 139 transition count 316
Iterating global reduction 6 with 4 rules applied. Total rules applied 442 place count 139 transition count 316
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 502 place count 109 transition count 286
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 505 place count 106 transition count 265
Iterating global reduction 6 with 3 rules applied. Total rules applied 508 place count 106 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 510 place count 105 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 511 place count 105 transition count 264
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 515 place count 105 transition count 260
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 522 place count 105 transition count 253
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 529 place count 98 transition count 253
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 530 place count 98 transition count 252
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 531 place count 98 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 532 place count 97 transition count 251
Applied a total of 532 rules in 216 ms. Remains 97 /289 variables (removed 192) and now considering 251/644 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 97/289 places, 251/644 transitions.
Incomplete random walk after 10000 steps, including 312 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1116985 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :{}
Probabilistic random walk after 1116985 steps, saw 173458 distinct states, run finished after 3004 ms. (steps per millisecond=371 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 251 rows 97 cols
[2023-03-13 20:48:30] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-13 20:48:30] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:48:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 20:48:31] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:48:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:48:31] [INFO ] After 61ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 20:48:31] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-13 20:48:31] [INFO ] After 404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 36 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 251/251 transitions.
Applied a total of 0 rules in 19 ms. Remains 97 /97 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 97/97 places, 251/251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 251/251 transitions.
Applied a total of 0 rules in 15 ms. Remains 97 /97 variables (removed 0) and now considering 251/251 (removed 0) transitions.
[2023-03-13 20:48:31] [INFO ] Invariant cache hit.
[2023-03-13 20:48:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-13 20:48:31] [INFO ] Invariant cache hit.
[2023-03-13 20:48:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 20:48:31] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-13 20:48:31] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-13 20:48:31] [INFO ] Invariant cache hit.
[2023-03-13 20:48:31] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 97/97 places, 251/251 transitions.
Applied a total of 0 rules in 11 ms. Remains 97 /97 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-13 20:48:31] [INFO ] Invariant cache hit.
[2023-03-13 20:48:32] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:48:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 20:48:32] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:48:32] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-13 20:48:32] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 14 ms to minimize.
[2023-03-13 20:48:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-03-13 20:48:32] [INFO ] After 606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-13 20:48:32] [INFO ] After 766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 20:48:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 20 ms.
[2023-03-13 20:48:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 251 transitions and 1917 arcs took 5 ms.
[2023-03-13 20:48:33] [INFO ] Flatten gal took : 80 ms
Total runtime 8287 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 06b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 97 places, 251 transitions, 1917 arcs.
Final Score: 2120.41
Took : 33 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-06b-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( (tk(P94)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P94)) ) ) | ( ( ( (tk(P81)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P81)) ) ) | ( ( (tk(P18)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P18)) ) ) ) ) | ( ( ( ( (tk(P71)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P71)) ) ) | ( ( ( (tk(P79)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P79)) ) ) & ( ( (tk(P68)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P68)) ) ) ) ) | ( ( ( ( (tk(P37)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P37)) ) ) & ( ( ( (tk(P27)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P27)) ) ) & ( ( (tk(P33)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P33)) ) ) ) ) | ( ( ( (tk(P55)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P55)) ) ) & ( ( ( (tk(P86)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P86)) ) ) & ( ( ( (tk(P58)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P58)) ) ) | ( ( (tk(P57)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P57)) ) ) ) ) ) ) ) )))
PROPERTY: AutonomousCar-PT-06b-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( ( (tk(P62)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P62)) ) ) | ( ( (tk(P36)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P36)) ) ) ) | ( ( ( (tk(P48)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P48)) ) ) | ( ( ( (tk(P77)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P77)) ) ) | ( ( (tk(P52)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P52)) ) ) ) ) ) | ( ( ( ( ( (tk(P74)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P74)) ) ) & ( ( (tk(P38)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P38)) ) ) ) | ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) & ( ( (tk(P75)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P75)) ) ) ) ) | ( ( ( ( ( (tk(P91)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P91)) ) ) | ( ( (tk(P95)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P95)) ) ) ) & ( ( ( ( (tk(P16)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P16)) ) ) | ( ( ( (tk(P24)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P24)) ) ) | ( ( (tk(P50)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P50)) ) ) ) ) | ( ( ( (tk(P65)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P65)) ) ) | ( ( ( (tk(P32)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P32)) ) ) | ( ( (tk(P84)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P84)) ) ) ) ) ) ) | ( ( ( ( ( (tk(P4)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P4)) ) ) | ( ( (tk(P45)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P45)) ) ) ) & ( ( ( (tk(P27)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P27)) ) ) | ( ( ( (tk(P13)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P13)) ) ) | ( ( (tk(P23)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P23)) ) ) ) ) ) | ( ( ( (tk(P66)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P66)) ) ) & ( ( (tk(P49)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P49)) ) ) ) ) ) ) )))
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678740559947

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-06b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is AutonomousCar-PT-06b, 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 r011-oct2-167813600500622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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