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.r010-oct2-167813599400670.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 marciexred
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 r010-oct2-167813599400670
=====================================================================

--------------------
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 1678703845444

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 10:37:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 10:37:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 10:37:29] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2023-03-13 10:37:29] [INFO ] Transformed 391 places.
[2023-03-13 10:37:29] [INFO ] Transformed 1554 transitions.
[2023-03-13 10:37:29] [INFO ] Found NUPN structural information;
[2023-03-13 10:37:29] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 312 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 80 resets, run finished after 453 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 10000 steps, including 11 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 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 10000 steps, including 12 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 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) 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 54 ms. (steps per millisecond=185 ) 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 10:37:30] [INFO ] Computed 14 place invariants in 36 ms
[2023-03-13 10:37:31] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 10:37:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-13 10:37:33] [INFO ] After 1290ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 10:37:34] [INFO ] Deduced a trap composed of 38 places in 1254 ms of which 10 ms to minimize.
[2023-03-13 10:37:35] [INFO ] Deduced a trap composed of 35 places in 890 ms of which 9 ms to minimize.
[2023-03-13 10:37:36] [INFO ] Deduced a trap composed of 38 places in 1087 ms of which 2 ms to minimize.
[2023-03-13 10:37:37] [INFO ] Deduced a trap composed of 38 places in 1114 ms of which 5 ms to minimize.
[2023-03-13 10:37:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4668 ms
[2023-03-13 10:37:38] [INFO ] Deduced a trap composed of 22 places in 713 ms of which 1 ms to minimize.
[2023-03-13 10:37:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 841 ms
[2023-03-13 10:37:40] [INFO ] Deduced a trap composed of 50 places in 1091 ms of which 1 ms to minimize.
[2023-03-13 10:37:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1245 ms
[2023-03-13 10:37:40] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 1 ms to minimize.
[2023-03-13 10:37:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2023-03-13 10:37:40] [INFO ] After 8961ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 531 ms.
[2023-03-13 10:37:41] [INFO ] After 9898ms 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 229 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 17 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.12 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 1 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 1 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 748 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 748 ms. Remains : 123/391 places, 847/1554 transitions.
Incomplete random walk after 10000 steps, including 295 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 847 rows 123 cols
[2023-03-13 10:37:42] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-13 10:37:42] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 10:37:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 10:37:43] [INFO ] After 480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 10:37:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 10:37:43] [INFO ] After 204ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 10:37:44] [INFO ] Deduced a trap composed of 9 places in 890 ms of which 0 ms to minimize.
[2023-03-13 10:37:45] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 0 ms to minimize.
[2023-03-13 10:37:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1315 ms
[2023-03-13 10:37:45] [INFO ] After 1929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 274 ms.
[2023-03-13 10:37:45] [INFO ] After 2736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 146 ms.
Support contains 29 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 847/847 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 123 transition count 839
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 115 transition count 837
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 113 transition count 837
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 113 transition count 834
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 110 transition count 834
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 108 transition count 824
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 108 transition count 824
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 48 place count 99 transition count 815
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 98 transition count 814
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 98 transition count 814
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 98 transition count 813
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 56 place count 98 transition count 808
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 61 place count 93 transition count 808
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 71 place count 93 transition count 798
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 91 transition count 796
Applied a total of 73 rules in 339 ms. Remains 91 /123 variables (removed 32) and now considering 796/847 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 91/123 places, 796/847 transitions.
Incomplete random walk after 10000 steps, including 430 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 574148 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 574148 steps, saw 80918 distinct states, run finished after 3002 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 796 rows 91 cols
[2023-03-13 10:37:49] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-13 10:37:49] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 10:37:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-13 10:37:49] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 10:37:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 10:37:50] [INFO ] After 189ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 10:37:50] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2023-03-13 10:37:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-13 10:37:50] [INFO ] After 684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-13 10:37:50] [INFO ] After 1397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 115 ms.
Support contains 29 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 796/796 transitions.
Applied a total of 0 rules in 43 ms. Remains 91 /91 variables (removed 0) and now considering 796/796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 91/91 places, 796/796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 796/796 transitions.
Applied a total of 0 rules in 74 ms. Remains 91 /91 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2023-03-13 10:37:51] [INFO ] Invariant cache hit.
[2023-03-13 10:37:51] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-13 10:37:51] [INFO ] Invariant cache hit.
[2023-03-13 10:37:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 10:37:52] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1652 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/91 places, 796/796 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 90 transition count 796
Applied a total of 1 rules in 106 ms. Remains 90 /90 variables (removed 0) and now considering 796/796 (removed 0) transitions.
// Phase 1: matrix 796 rows 90 cols
[2023-03-13 10:37:52] [INFO ] Computed 11 place invariants in 9 ms
[2023-03-13 10:37:53] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-13 10:37:53] [INFO ] Invariant cache hit.
[2023-03-13 10:37:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 10:37:54] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 90/91 places, 796/796 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3991 ms. Remains : 90/91 places, 796/796 transitions.
Incomplete random walk after 10000 steps, including 422 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 10:37:55] [INFO ] Invariant cache hit.
[2023-03-13 10:37:55] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 10:37:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 62 ms returned sat
[2023-03-13 10:37:55] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 10:37:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 10:37:56] [INFO ] After 223ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 10:37:56] [INFO ] After 495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-13 10:37:56] [INFO ] After 1175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 31 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 796/796 transitions.
Graph (complete) has 897 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 89 transition count 779
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 74 transition count 774
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 72 transition count 774
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 41 place count 70 transition count 764
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 70 transition count 764
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 70 transition count 763
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 50 place count 67 transition count 760
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 54 place count 65 transition count 758
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 65 transition count 757
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 62 place count 65 transition count 750
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 87 place count 58 transition count 732
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 58 transition count 731
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 58 transition count 731
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 91 place count 57 transition count 730
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 57 transition count 730
Applied a total of 92 rules in 280 ms. Remains 57 /90 variables (removed 33) and now considering 730/796 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 57/90 places, 730/796 transitions.
Finished random walk after 120 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=40 )
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27490 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: AutonomousCar_PT_09b
(NrP: 391 NrTr: 1554 NrArc: 16243)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.184sec

net check time: 0m 0.001sec

init dd package: 0m 2.966sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9275044 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16100360 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//
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.007sec

1628865 1631943 1632044 1632410 1651860 1652577 1646460 1646831 1645842 1656706 1659799 1672043 1669965 1661497 1662613 1670444 1670305 1662911 1664423 1664100 1665986 1672735 1692752 1692855

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="marciexred"
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 marciexred"
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 r010-oct2-167813599400670"
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 ;