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.r009-oct2-167813598300687.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 ltsminxred
Input is AutonomousCar-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598300687
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678642902340

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:41:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:41:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:41:45] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2023-03-12 17:41:45] [INFO ] Transformed 425 places.
[2023-03-12 17:41:45] [INFO ] Transformed 2252 transitions.
[2023-03-12 17:41:45] [INFO ] Found NUPN structural information;
[2023-03-12 17:41:45] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 76 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 16) seen :3
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2252 rows 425 cols
[2023-03-12 17:41:47] [INFO ] Computed 15 place invariants in 53 ms
[2023-03-12 17:41:48] [INFO ] After 552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 17:41:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 90 ms returned sat
[2023-03-12 17:41:50] [INFO ] After 1484ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2023-03-12 17:41:52] [INFO ] Deduced a trap composed of 38 places in 976 ms of which 37 ms to minimize.
[2023-03-12 17:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1178 ms
[2023-03-12 17:41:53] [INFO ] Deduced a trap composed of 35 places in 889 ms of which 10 ms to minimize.
[2023-03-12 17:41:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 929 ms
[2023-03-12 17:41:54] [INFO ] Deduced a trap composed of 35 places in 1365 ms of which 3 ms to minimize.
[2023-03-12 17:41:55] [INFO ] Deduced a trap composed of 35 places in 1141 ms of which 1 ms to minimize.
[2023-03-12 17:41:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2729 ms
[2023-03-12 17:41:57] [INFO ] Deduced a trap composed of 16 places in 1194 ms of which 0 ms to minimize.
[2023-03-12 17:41:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1334 ms
[2023-03-12 17:41:57] [INFO ] After 8164ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :5
Attempting to minimize the solution found.
Minimization took 414 ms.
[2023-03-12 17:41:57] [INFO ] After 9099ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :5
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 170 ms.
Support contains 45 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 311 edges and 425 vertex of which 4 / 425 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1994 edges and 423 vertex of which 416 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.17 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 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 154 rules applied. Total rules applied 156 place count 416 transition count 2089
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 199 rules applied. Total rules applied 355 place count 264 transition count 2042
Reduce places removed 27 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 34 rules applied. Total rules applied 389 place count 237 transition count 2035
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 11 rules applied. Total rules applied 400 place count 230 transition count 2031
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 402 place count 228 transition count 2031
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 30 Pre rules applied. Total rules applied 402 place count 228 transition count 2001
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 462 place count 198 transition count 2001
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 499 place count 161 transition count 1964
Iterating global reduction 5 with 37 rules applied. Total rules applied 536 place count 161 transition count 1964
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 401 transitions.
Iterating post reduction 5 with 401 rules applied. Total rules applied 937 place count 161 transition count 1563
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 944 place count 154 transition count 1502
Iterating global reduction 6 with 7 rules applied. Total rules applied 951 place count 154 transition count 1502
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 6 with 11 rules applied. Total rules applied 962 place count 154 transition count 1491
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 967 place count 149 transition count 1491
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 1025 place count 120 transition count 1462
Free-agglomeration rule applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1043 place count 120 transition count 1444
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 1061 place count 102 transition count 1444
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1062 place count 102 transition count 1443
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 1072 place count 102 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1073 place count 101 transition count 1432
Iterating global reduction 9 with 1 rules applied. Total rules applied 1074 place count 101 transition count 1432
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1075 place count 100 transition count 1431
Applied a total of 1075 rules in 688 ms. Remains 100 /425 variables (removed 325) and now considering 1431/2252 (removed 821) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 689 ms. Remains : 100/425 places, 1431/2252 transitions.
Incomplete random walk after 10000 steps, including 256 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 5) seen :2
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1431 rows 100 cols
[2023-03-12 17:41:59] [INFO ] Computed 15 place invariants in 13 ms
[2023-03-12 17:41:59] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:41:59] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:41:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-12 17:41:59] [INFO ] After 618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:41:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:00] [INFO ] After 81ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:42:00] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-12 17:42:00] [INFO ] After 1072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 31 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 1431/1431 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 1428
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 97 transition count 1427
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 96 transition count 1426
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 11 place count 94 transition count 1415
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 94 transition count 1415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 94 transition count 1414
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 16 place count 93 transition count 1413
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 21 place count 93 transition count 1408
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 36 place count 88 transition count 1398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 37 place count 87 transition count 1397
Applied a total of 37 rules in 283 ms. Remains 87 /100 variables (removed 13) and now considering 1397/1431 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 87/100 places, 1397/1431 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 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 18 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 584397 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 584397 steps, saw 79826 distinct states, run finished after 3006 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1397 rows 87 cols
[2023-03-12 17:42:03] [INFO ] Computed 15 place invariants in 11 ms
[2023-03-12 17:42:04] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-12 17:42:04] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:42:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 17:42:04] [INFO ] After 412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:42:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:04] [INFO ] After 119ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:42:04] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-12 17:42:04] [INFO ] After 816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 31 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1397/1397 transitions.
Applied a total of 0 rules in 80 ms. Remains 87 /87 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 87/87 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1397/1397 transitions.
Applied a total of 0 rules in 58 ms. Remains 87 /87 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-12 17:42:05] [INFO ] Invariant cache hit.
[2023-03-12 17:42:05] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 17:42:05] [INFO ] Invariant cache hit.
[2023-03-12 17:42:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:42:05] [INFO ] Implicit Places using invariants and state equation in 419 ms returned [82, 86]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 465 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/87 places, 1396/1397 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 1395
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 84 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 1394
Applied a total of 4 rules in 130 ms. Remains 83 /85 variables (removed 2) and now considering 1394/1396 (removed 2) transitions.
// Phase 1: matrix 1394 rows 83 cols
[2023-03-12 17:42:05] [INFO ] Computed 13 place invariants in 24 ms
[2023-03-12 17:42:05] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-12 17:42:05] [INFO ] Invariant cache hit.
[2023-03-12 17:42:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:42:06] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 83/87 places, 1394/1397 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1254 ms. Remains : 83/87 places, 1394/1397 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 602669 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602669 steps, saw 82687 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 17:42:09] [INFO ] Invariant cache hit.
[2023-03-12 17:42:09] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 17:42:09] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:42:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 17:42:10] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:42:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:42:10] [INFO ] After 63ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:42:10] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-12 17:42:10] [INFO ] After 864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 33 ms.
Support contains 31 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1394/1394 transitions.
Applied a total of 0 rules in 73 ms. Remains 83 /83 variables (removed 0) and now considering 1394/1394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 83/83 places, 1394/1394 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1394/1394 transitions.
Applied a total of 0 rules in 57 ms. Remains 83 /83 variables (removed 0) and now considering 1394/1394 (removed 0) transitions.
[2023-03-12 17:42:10] [INFO ] Invariant cache hit.
[2023-03-12 17:42:11] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-12 17:42:11] [INFO ] Invariant cache hit.
[2023-03-12 17:42:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:42:11] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-12 17:42:11] [INFO ] Redundant transitions in 163 ms returned []
[2023-03-12 17:42:11] [INFO ] Invariant cache hit.
[2023-03-12 17:42:12] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1661 ms. Remains : 83/83 places, 1394/1394 transitions.
Graph (complete) has 1090 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 1393
Applied a total of 2 rules in 75 ms. Remains 82 /83 variables (removed 1) and now considering 1393/1394 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1393 rows 82 cols
[2023-03-12 17:42:12] [INFO ] Computed 13 place invariants in 9 ms
[2023-03-12 17:42:12] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 17:42:12] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:42:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 17:42:13] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:42:13] [INFO ] After 523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-12 17:42:13] [INFO ] After 688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:42:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-12 17:42:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 83 places, 1394 transitions and 25147 arcs took 20 ms.
[2023-03-12 17:42:14] [INFO ] Flatten gal took : 443 ms
Total runtime 29367 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/551/inv_0_ --invariant=/tmp/551/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 15047168 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16094528 kB

BK_TIME_CONFINEMENT_REACHED

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

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="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-10b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598300687"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;