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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 865K 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-09b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678741451888

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-09b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 21:04:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:04:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:04:15] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-13 21:04:15] [INFO ] Transformed 391 places.
[2023-03-13 21:04:15] [INFO ] Transformed 1554 transitions.
[2023-03-13 21:04:15] [INFO ] Found NUPN structural information;
[2023-03-13 21:04:15] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 339 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-09b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 14) seen :7
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 1554 rows 391 cols
[2023-03-13 21:04:16] [INFO ] Computed 14 place invariants in 20 ms
[2023-03-13 21:04:16] [INFO ] After 560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 21:04:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-13 21:04:18] [INFO ] After 1075ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 21:04:19] [INFO ] Deduced a trap composed of 38 places in 1010 ms of which 22 ms to minimize.
[2023-03-13 21:04:20] [INFO ] Deduced a trap composed of 35 places in 999 ms of which 1 ms to minimize.
[2023-03-13 21:04:21] [INFO ] Deduced a trap composed of 38 places in 936 ms of which 1 ms to minimize.
[2023-03-13 21:04:22] [INFO ] Deduced a trap composed of 38 places in 927 ms of which 2 ms to minimize.
[2023-03-13 21:04:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4143 ms
[2023-03-13 21:04:23] [INFO ] Deduced a trap composed of 22 places in 934 ms of which 16 ms to minimize.
[2023-03-13 21:04:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1061 ms
[2023-03-13 21:04:24] [INFO ] Deduced a trap composed of 50 places in 657 ms of which 1 ms to minimize.
[2023-03-13 21:04:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 763 ms
[2023-03-13 21:04:24] [INFO ] Deduced a trap composed of 36 places in 290 ms of which 1 ms to minimize.
[2023-03-13 21:04:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 407 ms
[2023-03-13 21:04:24] [INFO ] After 7955ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 463 ms.
[2023-03-13 21:04:25] [INFO ] After 8607ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 138 ms.
Support contains 47 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 298 edges and 391 vertex of which 4 / 391 are part of one of the 2 SCC in 11 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1699 edges and 389 vertex of which 385 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.44 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 385 transition count 1425
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 143 rules applied. Total rules applied 268 place count 262 transition count 1405
Reduce places removed 9 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 23 rules applied. Total rules applied 291 place count 253 transition count 1391
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 305 place count 239 transition count 1391
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 305 place count 239 transition count 1373
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 341 place count 221 transition count 1373
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 367 place count 195 transition count 1347
Iterating global reduction 4 with 26 rules applied. Total rules applied 393 place count 195 transition count 1347
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 4 with 324 rules applied. Total rules applied 717 place count 195 transition count 1023
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 717 place count 195 transition count 1021
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 721 place count 193 transition count 1021
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 724 place count 190 transition count 994
Iterating global reduction 5 with 3 rules applied. Total rules applied 727 place count 190 transition count 994
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 807 place count 150 transition count 954
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 814 place count 143 transition count 884
Iterating global reduction 5 with 7 rules applied. Total rules applied 821 place count 143 transition count 884
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 827 place count 140 transition count 884
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 829 place count 140 transition count 882
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 838 place count 140 transition count 873
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 853 place count 140 transition count 858
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 868 place count 125 transition count 858
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 878 place count 125 transition count 848
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 880 place count 125 transition count 848
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 881 place count 124 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 882 place count 123 transition count 847
Applied a total of 882 rules in 812 ms. Remains 123 /391 variables (removed 268) and now considering 847/1554 (removed 707) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 814 ms. Remains : 123/391 places, 847/1554 transitions.
Incomplete random walk after 10000 steps, including 300 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 439708 steps, run timeout after 3002 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 439708 steps, saw 70026 distinct states, run finished after 3007 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 847 rows 123 cols
[2023-03-13 21:04:29] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-13 21:04:29] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 21:04:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 21:04:30] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 21:04:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 21:04:30] [INFO ] After 235ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 21:04:31] [INFO ] Deduced a trap composed of 7 places in 347 ms of which 14 ms to minimize.
[2023-03-13 21:04:31] [INFO ] Deduced a trap composed of 5 places in 551 ms of which 0 ms to minimize.
[2023-03-13 21:04:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1018 ms
[2023-03-13 21:04:32] [INFO ] Deduced a trap composed of 6 places in 320 ms of which 0 ms to minimize.
[2023-03-13 21:04:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2023-03-13 21:04:32] [INFO ] After 1941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 335 ms.
[2023-03-13 21:04:32] [INFO ] After 2968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 56 ms.
Support contains 47 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 847/847 transitions.
Applied a total of 0 rules in 41 ms. Remains 123 /123 variables (removed 0) and now considering 847/847 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 123/123 places, 847/847 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 847/847 transitions.
Applied a total of 0 rules in 88 ms. Remains 123 /123 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2023-03-13 21:04:33] [INFO ] Invariant cache hit.
[2023-03-13 21:04:33] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-13 21:04:33] [INFO ] Invariant cache hit.
[2023-03-13 21:04:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 21:04:34] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1451 ms to find 0 implicit places.
[2023-03-13 21:04:34] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-13 21:04:34] [INFO ] Invariant cache hit.
[2023-03-13 21:04:35] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2190 ms. Remains : 123/123 places, 847/847 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 123 transition count 847
Applied a total of 1 rules in 132 ms. Remains 123 /123 variables (removed 0) and now considering 847/847 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 847 rows 123 cols
[2023-03-13 21:04:35] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-13 21:04:35] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 21:04:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 21:04:36] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 21:04:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 21:04:36] [INFO ] After 383ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 21:04:37] [INFO ] Deduced a trap composed of 14 places in 1166 ms of which 1 ms to minimize.
[2023-03-13 21:04:38] [INFO ] Deduced a trap composed of 5 places in 718 ms of which 1 ms to minimize.
[2023-03-13 21:04:38] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 1 ms to minimize.
[2023-03-13 21:04:39] [INFO ] Deduced a trap composed of 4 places in 574 ms of which 0 ms to minimize.
[2023-03-13 21:04:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2906 ms
[2023-03-13 21:04:39] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-13 21:04:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-13 21:04:40] [INFO ] Deduced a trap composed of 15 places in 729 ms of which 1 ms to minimize.
[2023-03-13 21:04:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 800 ms
[2023-03-13 21:04:40] [INFO ] After 4725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-13 21:04:41] [INFO ] After 5501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-13 21:04:41] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-13 21:04:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 123 places, 847 transitions and 11839 arcs took 17 ms.
[2023-03-13 21:04:41] [INFO ] Flatten gal took : 293 ms
Total runtime 26919 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutonomousCar (PT), instance 09b
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: 123 places, 847 transitions, 11839 arcs.
Final Score: 9481.282
Took : 47 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: AutonomousCar-PT-09b-ReachabilityCardinality-07 (reachable & potential(( ( ( ( (tk(P44)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P44)) ) ) & ( ( (tk(P94)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P94)) ) ) ) & ( ( ( ( (tk(P106)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P106)) ) ) | ( ( ( ( (tk(P13)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P13)) ) ) & ( ( (tk(P103)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P103)) ) ) ) & ( ( ( (tk(P29)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P29)) ) ) & ( ( (tk(P111)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P111)) ) ) ) ) ) & ( ( ( (tk(P69)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P69)) ) ) | ( ( ( ( (tk(P119)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P119)) ) ) & ( ( ( (tk(P97)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P97)) ) ) & ( ( (tk(P86)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P86)) ) ) ) ) & ( ( ( (tk(P16)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P16)) ) ) & ( ( ( ( (tk(P91)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P91)) ) ) | ( ( (tk(P85)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P85)) ) ) ) & ( ( ( (tk(P122)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P122)) ) ) | ( ( ( (tk(P74)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P74)) ) ) | ( ( ( (tk(P2)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2)) ) ) & ( ( ( (tk(P40)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P40)) ) ) | ( ( (tk(P56)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P56)) ) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: AutonomousCar-PT-09b-ReachabilityCardinality-09 (reachable &!potential( ( ( ( (tk(P117)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P117)) ) ) | ( ( (tk(P63)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P63)) ) ) )))
PROPERTY: AutonomousCar-PT-09b-ReachabilityCardinality-10 (reachable &!potential( ( ( ( ( ( (tk(P25)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P25)) ) ) | ( ( (tk(P65)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P65)) ) ) ) | ( ( ( (tk(P75)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P75)) ) ) | ( ( (tk(P35)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P35)) ) ) ) ) | ( ( ( ( (tk(P61)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P61)) ) ) | ( ( ( (tk(P59)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P59)) ) ) & ( ( ( ( (tk(P114)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P114)) ) ) & ( ( (tk(P119)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P119)) ) ) ) | ( ( ( ( (tk(P89)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P89)) ) ) & ( ( (tk(P71)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P71)) ) ) ) | ( ( ( (tk(P84)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P84)) ) ) & ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) ) ) ) ) ) | ( ( ( ( (tk(P76)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P76)) ) ) & ( ( ( ( (tk(P3)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P3)) ) ) | ( ( (tk(P21)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P21)) ) ) ) & ( ( ( (tk(P87)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P87)) ) ) | ( ( (tk(P107)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P107)) ) ) ) ) ) | ( ( ( (tk(P28)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P28)) ) ) & ( ( ( (tk(P54)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P54)) ) ) & ( ( (tk(P10)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P10)) ) ) ) ) ) ) )))
PROPERTY: AutonomousCar-PT-09b-ReachabilityCardinality-12 (reachable & potential(( ( ( ( (tk(P8)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P8)) ) ) & ( ( (tk(P34)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P34)) ) ) ) & ( ( ( (tk(P42)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P42)) ) ) & ( ( ( ( (tk(P20)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P20)) ) ) | ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) ) & ( ( ( (tk(P77)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P77)) ) ) | ( ( (tk(P48)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P48)) ) ) ) ) ) )))
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678741561514

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

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