fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r011-oct2-167813600400590
Last Updated
May 14, 2023

About the Execution of Smart+red for AutonomousCar-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1209.016 86471.00 99446.00 56.40 FTFFTFTTFFTTTTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:50 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 110K 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-04b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678740243473

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-04b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:44:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:44:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:44:06] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-13 20:44:06] [INFO ] Transformed 221 places.
[2023-03-13 20:44:06] [INFO ] Transformed 368 transitions.
[2023-03-13 20:44:06] [INFO ] Found NUPN structural information;
[2023-03-13 20:44:06] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 245 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-04b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 14) seen :7
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :2
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 368 rows 221 cols
[2023-03-13 20:44:07] [INFO ] Computed 9 place invariants in 10 ms
[2023-03-13 20:44:07] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 20:44:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 27 ms returned sat
[2023-03-13 20:44:07] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-13 20:44:08] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 5 ms to minimize.
[2023-03-13 20:44:08] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 1 ms to minimize.
[2023-03-13 20:44:08] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2023-03-13 20:44:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 611 ms
[2023-03-13 20:44:08] [INFO ] After 854ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-13 20:44:08] [INFO ] After 1024ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 23 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 368/368 transitions.
Graph (trivial) has 173 edges and 221 vertex of which 4 / 221 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 584 edges and 219 vertex of which 214 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 214 transition count 290
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 1 with 91 rules applied. Total rules applied 164 place count 144 transition count 269
Reduce places removed 11 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 18 rules applied. Total rules applied 182 place count 133 transition count 262
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 189 place count 126 transition count 262
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 189 place count 126 transition count 257
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 199 place count 121 transition count 257
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 213 place count 107 transition count 243
Iterating global reduction 4 with 14 rules applied. Total rules applied 227 place count 107 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 227 place count 107 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 106 transition count 242
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 231 place count 104 transition count 233
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 104 transition count 233
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 277 place count 82 transition count 211
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 280 place count 79 transition count 184
Iterating global reduction 4 with 3 rules applied. Total rules applied 283 place count 79 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 285 place count 78 transition count 197
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 4 with 49 rules applied. Total rules applied 334 place count 78 transition count 148
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 343 place count 78 transition count 139
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 352 place count 69 transition count 139
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 358 place count 69 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 359 place count 69 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 360 place count 68 transition count 132
Applied a total of 360 rules in 143 ms. Remains 68 /221 variables (removed 153) and now considering 132/368 (removed 236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 68/221 places, 132/368 transitions.
Incomplete random walk after 10000 steps, including 233 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 157978 steps, run visited all 1 properties in 177 ms. (steps per millisecond=892 )
Probabilistic random walk after 157978 steps, saw 27102 distinct states, run finished after 177 ms. (steps per millisecond=892 ) properties seen :1
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 2972 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 04b
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: 221 places, 368 transitions, 1658 arcs.
Final Score: 5000.849
Took : 28 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( 1 ) <= (tk(P207)) ) | (! ( ( 1 ) <= (tk(P32)) )) ) | ( (! ( ( (! ( ( 1 ) <= (tk(P193)) )) & (! ( (tk(P135)) <= (tk(P178)) )) ) | (! ( ( (! ( ( (tk(P182)) <= ( 0 ) ) | ( (tk(P173)) <= (tk(P81)) ) )) | ( (! ( (tk(P101)) <= ( 0 ) )) & ( ( (tk(P29)) <= (tk(P173)) ) & ( (tk(P82)) <= (tk(P136)) ) ) ) ) | ( (! ( ( ( 1 ) <= (tk(P72)) ) | ( (tk(P104)) <= (tk(P61)) ) )) & ( ( 1 ) <= (tk(P26)) ) ) )) )) & ( ( (tk(P138)) <= (tk(P94)) ) | ( ( 1 ) <= (tk(P158)) ) ) ) )))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-01 (reachable & potential(( ( (tk(P128)) <= (tk(P39)) ) & (! ( ( ( ( (tk(P181)) <= (tk(P119)) ) | ( (tk(P6)) <= ( 1 ) ) ) | (! ( ( ( ( ( (tk(P27)) <= (tk(P148)) ) & ( ( 1 ) <= (tk(P133)) ) ) | ( ( ( 1 ) <= (tk(P26)) ) | ( ( 1 ) <= (tk(P184)) ) ) ) & (! ( (tk(P19)) <= (tk(P80)) )) ) | ( (! ( ( (tk(P195)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P76)) ) )) | ( ( ( (tk(P125)) <= (tk(P213)) ) & ( ( 1 ) <= (tk(P118)) ) ) & ( ( (tk(P111)) <= (tk(P48)) ) | ( ( 1 ) <= (tk(P37)) ) ) ) ) )) ) & ( (tk(P146)) <= ( 0 ) ) )) )))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-02 (reachable &!potential( (! ( ( 1 ) <= (tk(P117)) ))))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-03 (reachable &!potential( (! ( (! ( ( (! ( ( ( ( (tk(P46)) <= (tk(P159)) ) & ( (tk(P192)) <= ( 1 ) ) ) | (! ( ( 1 ) <= (tk(P111)) )) ) | (! ( ( (tk(P31)) <= ( 1 ) ) & ( (tk(P162)) <= ( 1 ) ) )) )) & (! ( (tk(P117)) <= (tk(P193)) )) ) | ( (! ( (! ( (tk(P109)) <= (tk(P115)) )) & ( ( (tk(P180)) <= ( 0 ) ) & ( (tk(P122)) <= (tk(P129)) ) ) )) | (! ( ( (! ( ( 1 ) <= (tk(P90)) )) | ( (tk(P151)) <= ( 1 ) ) ) | ( (! ( (tk(P167)) <= (tk(P216)) )) | ( ( (tk(P38)) <= ( 1 ) ) | ( (tk(P149)) <= ( 0 ) ) ) ) )) ) )) & ( (tk(P24)) <= ( 0 ) ) ))))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-04 (reachable & potential((! ( (tk(P65)) <= (tk(P74)) ))))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-05 (reachable & potential(( ( ( ( ( ( ( (tk(P145)) <= ( 1 ) ) & ( (! ( ( ( 1 ) <= (tk(P137)) ) & ( (tk(P95)) <= ( 1 ) ) )) & ( (! ( (tk(P175)) <= ( 0 ) )) | ( (tk(P217)) <= (tk(P202)) ) ) ) ) | (! ( (tk(P201)) <= (tk(P145)) )) ) | ( (tk(P3)) <= (tk(P90)) ) ) | ( ( (! ( (tk(P59)) <= ( 1 ) )) & (! ( ( ( ( ( 1 ) <= (tk(P17)) ) & ( (tk(P218)) <= ( 0 ) ) ) | ( ( (tk(P128)) <= (tk(P38)) ) | ( (tk(P123)) <= ( 1 ) ) ) ) & (! ( ( 1 ) <= (tk(P115)) )) )) ) | ( (tk(P46)) <= (tk(P127)) ) ) ) & ( (tk(P210)) <= ( 0 ) ) ) & (! ( ( ( (tk(P220)) <= ( 1 ) ) | ( (! ( (! ( ( (tk(P213)) <= (tk(P35)) ) & ( (tk(P178)) <= ( 1 ) ) )) | ( ( (tk(P164)) <= (tk(P79)) ) | ( ( 1 ) <= (tk(P126)) ) ) )) & ( ( ( ( ( 1 ) <= (tk(P12)) ) & ( ( (tk(P35)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P181)) ) ) ) | ( (! ( (tk(P145)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P93)) ) | ( (tk(P140)) <= (tk(P181)) ) ) ) ) | ( (tk(P182)) <= (tk(P155)) ) ) ) ) & ( (! ( ( ( (! ( (tk(P49)) <= ( 1 ) )) & ( (tk(P65)) <= ( 0 ) ) ) | ( ( ( ( 1 ) <= (tk(P86)) ) & ( (tk(P76)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P164)) ) & ( (tk(P31)) <= ( 1 ) ) ) ) ) | (! ( (tk(P145)) <= ( 0 ) )) )) | ( ( ( (! ( ( (tk(P34)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P152)) ) )) | (! ( ( 1 ) <= (tk(P89)) )) ) | ( ( 1 ) <= (tk(P133)) ) ) | ( ( ( ( ( (tk(P62)) <= ( 0 ) ) & ( (tk(P60)) <= (tk(P146)) ) ) & ( (tk(P75)) <= (tk(P87)) ) ) & ( ( ( (tk(P59)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P89)) ) ) & ( ( (tk(P135)) <= (tk(P162)) ) | ( ( 1 ) <= (tk(P134)) ) ) ) ) | ( (! ( ( (tk(P90)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P140)) ) )) | ( (tk(P169)) <= (tk(P35)) ) ) ) ) ) )) )))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-06 (reachable &!potential( ( ( (! ( (tk(P181)) <= ( 0 ) )) | ( ( ( ( ( (! ( ( (tk(P82)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P72)) ) )) | ( ( ( (tk(P196)) <= ( 1 ) ) | ( (tk(P11)) <= ( 0 ) ) ) & ( ( (tk(P207)) <= (tk(P221)) ) & ( (tk(P203)) <= (tk(P200)) ) ) ) ) | ( ( (! ( (tk(P6)) <= (tk(P49)) )) & ( ( (tk(P62)) <= ( 0 ) ) | ( (tk(P58)) <= (tk(P26)) ) ) ) & (! ( (tk(P203)) <= ( 0 ) )) ) ) & (! ( ( (tk(P85)) <= (tk(P109)) ) & ( ( 1 ) <= (tk(P113)) ) )) ) | (! ( ( 1 ) <= (tk(P185)) )) ) | ( ( ( ( (tk(P137)) <= (tk(P40)) ) | ( ( ( ( (tk(P216)) <= ( 0 ) ) & ( (tk(P191)) <= ( 1 ) ) ) & (! ( (tk(P58)) <= (tk(P103)) )) ) | ( ( (tk(P176)) <= ( 0 ) ) & ( ( (tk(P1)) <= (tk(P29)) ) | ( (tk(P128)) <= ( 1 ) ) ) ) ) ) | ( ( ( (tk(P25)) <= (tk(P214)) ) & ( ( ( 1 ) <= (tk(P13)) ) | ( (tk(P201)) <= ( 0 ) ) ) ) | ( (tk(P167)) <= ( 0 ) ) ) ) | ( ( ( ( 1 ) <= (tk(P64)) ) | ( ( ( (tk(P192)) <= ( 1 ) ) & (! ( ( 1 ) <= (tk(P10)) )) ) | ( ( ( (tk(P133)) <= (tk(P6)) ) & ( (tk(P6)) <= (tk(P184)) ) ) & ( ( ( 1 ) <= (tk(P219)) ) & ( (tk(P32)) <= (tk(P129)) ) ) ) ) ) & ( (tk(P189)) <= ( 0 ) ) ) ) ) ) | ( ( ( ( ( ( ( 1 ) <= (tk(P158)) ) & ( (tk(P43)) <= (tk(P168)) ) ) | (! ( ( ( (tk(P161)) <= ( 0 ) ) & ( (tk(P203)) <= ( 1 ) ) ) | ( ( (tk(P82)) <= (tk(P138)) ) & ( (tk(P130)) <= ( 0 ) ) ) )) ) | (! ( ( 1 ) <= (tk(P190)) )) ) | ( (tk(P192)) <= ( 0 ) ) ) & ( (tk(P217)) <= (tk(P156)) ) ) )))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-07 (reachable & potential(( ( ( (tk(P14)) <= ( 1 ) ) | ( ( (tk(P152)) <= (tk(P53)) ) & ( ( (! ( (tk(P101)) <= ( 1 ) )) & (! ( ( ( ( (tk(P65)) <= ( 1 ) ) | ( (tk(P188)) <= (tk(P210)) ) ) & ( ( (tk(P47)) <= (tk(P201)) ) | ( (tk(P151)) <= (tk(P11)) ) ) ) & (! ( ( ( 1 ) <= (tk(P40)) ) | ( ( 1 ) <= (tk(P166)) ) )) )) ) | ( ( (! ( ( 1 ) <= (tk(P160)) )) & ( (! ( (tk(P119)) <= (tk(P93)) )) | ( ( ( (tk(P179)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P124)) ) ) | ( ( (tk(P212)) <= (tk(P67)) ) & ( (tk(P103)) <= (tk(P81)) ) ) ) ) ) & ( ( ( (! ( (tk(P157)) <= ( 1 ) )) & ( (tk(P143)) <= ( 0 ) ) ) | ( ( (tk(P28)) <= (tk(P189)) ) | ( ( (tk(P25)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P64)) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P170)) ) | (! ( (tk(P116)) <= ( 1 ) )) ) & (! ( ( (tk(P63)) <= (tk(P45)) ) & ( (tk(P20)) <= (tk(P54)) ) )) ) ) ) ) ) ) & ( ( 1 ) <= (tk(P215)) ) )))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P98)) <= (tk(P132)) )))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-09 (reachable &!potential( ( ( ( 1 ) <= (tk(P176)) ) | (! ( ( ( (tk(P121)) <= (tk(P195)) ) & ( (! ( ( (! ( (tk(P71)) <= ( 1 ) )) | ( ( (tk(P42)) <= ( 0 ) ) | ( (tk(P200)) <= (tk(P121)) ) ) ) | ( ( 1 ) <= (tk(P63)) ) )) & ( (! ( (tk(P46)) <= ( 0 ) )) | ( ( (tk(P126)) <= (tk(P79)) ) & ( ( 1 ) <= (tk(P11)) ) ) ) ) ) & ( ( ( ( ( 1 ) <= (tk(P4)) ) | ( ( (tk(P148)) <= ( 1 ) ) & ( (tk(P168)) <= ( 0 ) ) ) ) | ( ( 1 ) <= (tk(P8)) ) ) & ( (! ( ( ( (tk(P4)) <= ( 0 ) ) & ( (tk(P187)) <= ( 0 ) ) ) & ( ( (tk(P149)) <= ( 1 ) ) & ( (tk(P116)) <= (tk(P27)) ) ) )) | ( ( ( ( ( (tk(P188)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P157)) ) ) | (! ( ( 1 ) <= (tk(P103)) )) ) & ( (tk(P44)) <= (tk(P3)) ) ) & ( (tk(P84)) <= (tk(P212)) ) ) ) ) )) )))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P63)) <= ( 1 ) )))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-11 (reachable &!potential( ( (tk(P178)) <= ( 1 ) )))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P218)) <= ( 0 ) )))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-13 (reachable & potential(( ( 1 ) <= (tk(P17)) )))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-14 (reachable & potential((! ( ( (tk(P116)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P104)) ) & ( ( ( ( ( (tk(P112)) <= (tk(P61)) ) & (! ( (tk(P89)) <= ( 0 ) )) ) | ( (! ( ( (tk(P48)) <= ( 0 ) ) | ( (tk(P14)) <= (tk(P97)) ) )) & ( (tk(P85)) <= (tk(P20)) ) ) ) & ( ( (! ( (tk(P59)) <= (tk(P23)) )) | ( ( ( ( 1 ) <= (tk(P119)) ) | ( (tk(P169)) <= ( 1 ) ) ) | ( ( ( 1 ) <= (tk(P184)) ) & ( (tk(P76)) <= (tk(P53)) ) ) ) ) | (! ( (tk(P63)) <= (tk(P198)) )) ) ) & ( ( (! ( ( 1 ) <= (tk(P54)) )) & ( (tk(P125)) <= ( 0 ) ) ) & ( (tk(P106)) <= (tk(P74)) ) ) ) ) ))))
PROPERTY: AutonomousCar-PT-04b-ReachabilityCardinality-15 (reachable &!potential( ( ( ( (! ( ( ( (! ( ( (tk(P13)) <= ( 0 ) ) | ( (tk(P1)) <= (tk(P103)) ) )) | ( (tk(P24)) <= ( 1 ) ) ) | ( ( 1 ) <= (tk(P44)) ) ) & (! ( ( (tk(P53)) <= ( 1 ) ) & (! ( (tk(P213)) <= ( 0 ) )) )) )) | ( ( (tk(P180)) <= (tk(P92)) ) | ( (tk(P4)) <= ( 0 ) ) ) ) | ( ( ( ( 1 ) <= (tk(P146)) ) & ( (tk(P35)) <= ( 0 ) ) ) | ( (! ( ( (! ( (tk(P210)) <= (tk(P134)) )) & ( (tk(P83)) <= ( 0 ) ) ) & (! ( ( (tk(P108)) <= ( 1 ) ) | ( (tk(P53)) <= ( 1 ) ) )) )) & ( ( (tk(P173)) <= ( 0 ) ) | ( ( (! ( ( (tk(P60)) <= (tk(P214)) ) & ( ( 1 ) <= (tk(P198)) ) )) | ( ( 1 ) <= (tk(P164)) ) ) & ( (tk(P68)) <= (tk(P143)) ) ) ) ) ) ) & ( ( ( 1 ) <= (tk(P211)) ) | ( (tk(P33)) <= (tk(P56)) ) ) )))
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678740329944

--------------------
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-04b"
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-04b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r011-oct2-167813600400590"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04b.tgz
mv AutonomousCar-PT-04b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;