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

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

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:03:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:03:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:03:59] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-12 17:03:59] [INFO ] Transformed 391 places.
[2023-03-12 17:04:00] [INFO ] Transformed 1554 transitions.
[2023-03-12 17:04:00] [INFO ] Found NUPN structural information;
[2023-03-12 17:04:00] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 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 83 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 14) seen :8
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-14 TRUE 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-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1554 rows 391 cols
[2023-03-12 17:04:01] [INFO ] Computed 14 place invariants in 53 ms
[2023-03-12 17:04:01] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:04:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-12 17:04:03] [INFO ] After 1473ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-12 17:04:04] [INFO ] Deduced a trap composed of 38 places in 755 ms of which 18 ms to minimize.
[2023-03-12 17:04:05] [INFO ] Deduced a trap composed of 35 places in 821 ms of which 2 ms to minimize.
[2023-03-12 17:04:05] [INFO ] Deduced a trap composed of 38 places in 846 ms of which 2 ms to minimize.
[2023-03-12 17:04:06] [INFO ] Deduced a trap composed of 38 places in 621 ms of which 13 ms to minimize.
[2023-03-12 17:04:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3290 ms
[2023-03-12 17:04:07] [INFO ] Deduced a trap composed of 22 places in 584 ms of which 2 ms to minimize.
[2023-03-12 17:04:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 690 ms
[2023-03-12 17:04:08] [INFO ] Deduced a trap composed of 50 places in 670 ms of which 0 ms to minimize.
[2023-03-12 17:04:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 780 ms
[2023-03-12 17:04:08] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 0 ms to minimize.
[2023-03-12 17:04:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2023-03-12 17:04:08] [INFO ] After 6971ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 438 ms.
[2023-03-12 17:04:09] [INFO ] After 7653ms 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 110 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 13 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.11 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 3 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 860 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 885 ms. Remains : 123/391 places, 847/1554 transitions.
Incomplete random walk after 10000 steps, including 298 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 847 rows 123 cols
[2023-03-12 17:04:10] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-12 17:04:10] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 17:04:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-03-12 17:04:11] [INFO ] After 431ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 17:04:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:11] [INFO ] After 235ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 17:04:12] [INFO ] Deduced a trap composed of 9 places in 590 ms of which 1 ms to minimize.
[2023-03-12 17:04:12] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 1 ms to minimize.
[2023-03-12 17:04:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 954 ms
[2023-03-12 17:04:12] [INFO ] After 1418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-12 17:04:13] [INFO ] After 2231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 59 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 1 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 354 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 354 ms. Remains : 91/123 places, 796/847 transitions.
Incomplete random walk after 10000 steps, including 418 resets, run finished after 244 ms. (steps per millisecond=40 ) 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 37 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 41 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 796 rows 91 cols
[2023-03-12 17:04:13] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-12 17:04:13] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:04:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 17:04:14] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:04:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:14] [INFO ] After 111ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 17:04:14] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2023-03-12 17:04:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-12 17:04:15] [INFO ] Deduced a trap composed of 7 places in 535 ms of which 0 ms to minimize.
[2023-03-12 17:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 588 ms
[2023-03-12 17:04:15] [INFO ] After 1090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-12 17:04:15] [INFO ] After 1758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 22 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 796/796 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 91 transition count 793
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 88 transition count 791
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 87 transition count 790
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 12 place count 86 transition count 789
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 15 place count 86 transition count 786
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 18 place count 83 transition count 786
Applied a total of 18 rules in 109 ms. Remains 83 /91 variables (removed 8) and now considering 786/796 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 83/91 places, 786/796 transitions.
Incomplete random walk after 10000 steps, including 424 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 786 rows 83 cols
[2023-03-12 17:04:15] [INFO ] Computed 11 place invariants in 14 ms
[2023-03-12 17:04:15] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:04:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 17:04:16] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:04:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:16] [INFO ] After 145ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:04:17] [INFO ] Deduced a trap composed of 7 places in 676 ms of which 0 ms to minimize.
[2023-03-12 17:04:17] [INFO ] Deduced a trap composed of 6 places in 504 ms of which 1 ms to minimize.
[2023-03-12 17:04:18] [INFO ] Deduced a trap composed of 7 places in 674 ms of which 1 ms to minimize.
[2023-03-12 17:04:19] [INFO ] Deduced a trap composed of 5 places in 1225 ms of which 59 ms to minimize.
[2023-03-12 17:04:20] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 1 ms to minimize.
[2023-03-12 17:04:20] [INFO ] Deduced a trap composed of 14 places in 631 ms of which 0 ms to minimize.
[2023-03-12 17:04:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4327 ms
[2023-03-12 17:04:20] [INFO ] After 4594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-12 17:04:21] [INFO ] After 5092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 20 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 786/786 transitions.
Graph (complete) has 881 edges and 83 vertex of which 82 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 82 transition count 783
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 81 transition count 782
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 7 place count 80 transition count 781
Applied a total of 7 rules in 51 ms. Remains 80 /83 variables (removed 3) and now considering 781/786 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 80/83 places, 781/786 transitions.
Incomplete random walk after 10000 steps, including 437 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1140219 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :{}
Probabilistic random walk after 1140219 steps, saw 163579 distinct states, run finished after 3003 ms. (steps per millisecond=379 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 781 rows 80 cols
[2023-03-12 17:04:24] [INFO ] Computed 12 place invariants in 13 ms
[2023-03-12 17:04:24] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:04:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-12 17:04:24] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:04:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:24] [INFO ] After 156ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:04:25] [INFO ] Deduced a trap composed of 7 places in 974 ms of which 1 ms to minimize.
[2023-03-12 17:04:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1042 ms
[2023-03-12 17:04:25] [INFO ] After 1320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-12 17:04:26] [INFO ] After 1834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 20 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 781/781 transitions.
Applied a total of 0 rules in 58 ms. Remains 80 /80 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 80/80 places, 781/781 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 781/781 transitions.
Applied a total of 0 rules in 48 ms. Remains 80 /80 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-12 17:04:26] [INFO ] Invariant cache hit.
[2023-03-12 17:04:26] [INFO ] Implicit Places using invariants in 633 ms returned []
[2023-03-12 17:04:26] [INFO ] Invariant cache hit.
[2023-03-12 17:04:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:27] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1669 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 79/80 places, 781/781 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 79 transition count 781
Applied a total of 1 rules in 83 ms. Remains 79 /79 variables (removed 0) and now considering 781/781 (removed 0) transitions.
// Phase 1: matrix 781 rows 79 cols
[2023-03-12 17:04:28] [INFO ] Computed 11 place invariants in 8 ms
[2023-03-12 17:04:28] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-12 17:04:28] [INFO ] Invariant cache hit.
[2023-03-12 17:04:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:29] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 79/80 places, 781/781 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3034 ms. Remains : 79/80 places, 781/781 transitions.
Incomplete random walk after 10000 steps, including 400 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1199524 steps, run timeout after 3001 ms. (steps per millisecond=399 ) properties seen :{}
Probabilistic random walk after 1199524 steps, saw 172063 distinct states, run finished after 3013 ms. (steps per millisecond=398 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 17:04:32] [INFO ] Invariant cache hit.
[2023-03-12 17:04:32] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:04:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 17:04:32] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:32] [INFO ] After 134ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:04:33] [INFO ] Deduced a trap composed of 7 places in 575 ms of which 1 ms to minimize.
[2023-03-12 17:04:34] [INFO ] Deduced a trap composed of 6 places in 404 ms of which 0 ms to minimize.
[2023-03-12 17:04:34] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 0 ms to minimize.
[2023-03-12 17:04:34] [INFO ] Deduced a trap composed of 7 places in 437 ms of which 0 ms to minimize.
[2023-03-12 17:04:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1799 ms
[2023-03-12 17:04:34] [INFO ] After 2044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-12 17:04:35] [INFO ] After 2511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 20 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 781/781 transitions.
Applied a total of 0 rules in 53 ms. Remains 79 /79 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 79/79 places, 781/781 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 781/781 transitions.
Applied a total of 0 rules in 35 ms. Remains 79 /79 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-12 17:04:35] [INFO ] Invariant cache hit.
[2023-03-12 17:04:35] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-12 17:04:35] [INFO ] Invariant cache hit.
[2023-03-12 17:04:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 17:04:36] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2023-03-12 17:04:36] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-12 17:04:36] [INFO ] Invariant cache hit.
[2023-03-12 17:04:36] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1830 ms. Remains : 79/79 places, 781/781 transitions.
Applied a total of 0 rules in 41 ms. Remains 79 /79 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-12 17:04:36] [INFO ] Invariant cache hit.
[2023-03-12 17:04:37] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:04:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 17:04:37] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:04:37] [INFO ] After 690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-12 17:04:37] [INFO ] After 861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:04:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-12 17:04:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 781 transitions and 11619 arcs took 19 ms.
[2023-03-12 17:04:38] [INFO ] Flatten gal took : 287 ms
Total runtime 38967 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 --invariant=/tmp/618/inv_0_ --inv-par
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678640866625

--------------------
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
mcc2023
rfs formula name AutonomousCar-PT-09b-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/618/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 79 places, 781 transitions and 11619 arcs
pnml2lts-sym: Petri net AutonomousCar_PT_09b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 781->758 groups
pnml2lts-sym: Regrouping took 0.350 real 0.350 user 0.000 sys
pnml2lts-sym: state vector length is 79; there are 758 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/618/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 187.070 real 747.280 user 0.390 sys
pnml2lts-sym: max token count: 1

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="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-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 r009-oct2-167813598200670"
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 ;