Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180300204.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutonomousCar-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180300204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 334K May 18 16:42 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-07b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716312056595

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-21 17:20:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 17:20:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 17:20:59] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-05-21 17:20:59] [INFO ] Transformed 323 places.
[2024-05-21 17:20:59] [INFO ] Transformed 846 transitions.
[2024-05-21 17:20:59] [INFO ] Found NUPN structural information;
[2024-05-21 17:20:59] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 21 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 12) seen :2
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 10) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 846 rows 323 cols
[2024-05-21 17:21:01] [INFO ] Computed 12 invariants in 62 ms
[2024-05-21 17:21:02] [INFO ] After 630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-21 17:21:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 17:21:03] [INFO ] After 1293ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2024-05-21 17:21:04] [INFO ] Deduced a trap composed of 15 places in 461 ms of which 10 ms to minimize.
[2024-05-21 17:21:05] [INFO ] Deduced a trap composed of 14 places in 881 ms of which 1 ms to minimize.
[2024-05-21 17:21:05] [INFO ] Deduced a trap composed of 35 places in 359 ms of which 2 ms to minimize.
[2024-05-21 17:21:05] [INFO ] Deduced a trap composed of 35 places in 290 ms of which 3 ms to minimize.
[2024-05-21 17:21:06] [INFO ] Deduced a trap composed of 16 places in 286 ms of which 0 ms to minimize.
[2024-05-21 17:21:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2460 ms
[2024-05-21 17:21:06] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 0 ms to minimize.
[2024-05-21 17:21:06] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 1 ms to minimize.
[2024-05-21 17:21:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 509 ms
[2024-05-21 17:21:07] [INFO ] Deduced a trap composed of 12 places in 580 ms of which 1 ms to minimize.
[2024-05-21 17:21:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 651 ms
[2024-05-21 17:21:07] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 1 ms to minimize.
[2024-05-21 17:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 321 ms
[2024-05-21 17:21:08] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 1 ms to minimize.
[2024-05-21 17:21:08] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 1 ms to minimize.
[2024-05-21 17:21:08] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 0 ms to minimize.
[2024-05-21 17:21:08] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 0 ms to minimize.
[2024-05-21 17:21:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1186 ms
[2024-05-21 17:21:09] [INFO ] After 6729ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 182 ms.
[2024-05-21 17:21:09] [INFO ] After 7300ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 29 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Graph (trivial) has 259 edges and 323 vertex of which 4 / 323 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1181 edges and 321 vertex of which 317 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.10 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 317 transition count 729
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 132 rules applied. Total rules applied 245 place count 206 transition count 708
Reduce places removed 12 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 24 rules applied. Total rules applied 269 place count 194 transition count 696
Reduce places removed 12 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 16 rules applied. Total rules applied 285 place count 182 transition count 692
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 287 place count 180 transition count 692
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 287 place count 180 transition count 686
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 299 place count 174 transition count 686
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 325 place count 148 transition count 660
Iterating global reduction 5 with 26 rules applied. Total rules applied 351 place count 148 transition count 660
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 354 place count 148 transition count 657
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 354 place count 148 transition count 653
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 362 place count 144 transition count 653
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 369 place count 137 transition count 568
Iterating global reduction 6 with 7 rules applied. Total rules applied 376 place count 137 transition count 568
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 with 6 rules applied. Total rules applied 382 place count 137 transition count 562
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 384 place count 135 transition count 562
Performed 33 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 8 with 66 rules applied. Total rules applied 450 place count 102 transition count 528
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 455 place count 97 transition count 453
Iterating global reduction 8 with 5 rules applied. Total rules applied 460 place count 97 transition count 453
Drop transitions removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 8 with 120 rules applied. Total rules applied 580 place count 97 transition count 333
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 589 place count 97 transition count 324
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 598 place count 88 transition count 324
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 599 place count 88 transition count 323
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 602 place count 88 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 603 place count 87 transition count 322
Applied a total of 603 rules in 407 ms. Remains 87 /323 variables (removed 236) and now considering 322/846 (removed 524) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 407 ms. Remains : 87/323 places, 322/846 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 4) seen :2
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 322 rows 87 cols
[2024-05-21 17:21:10] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 17:21:10] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 17:21:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 17:21:10] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 17:21:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:21:10] [INFO ] After 55ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 17:21:10] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2024-05-21 17:21:10] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 13 ms to minimize.
[2024-05-21 17:21:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2024-05-21 17:21:10] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2024-05-21 17:21:11] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 0 ms to minimize.
[2024-05-21 17:21:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2024-05-21 17:21:11] [INFO ] After 630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-21 17:21:11] [INFO ] After 904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 27 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 86 transition count 321
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 85 transition count 320
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 85 transition count 318
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 83 transition count 318
Applied a total of 8 rules in 50 ms. Remains 83 /87 variables (removed 4) and now considering 318/322 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 83/87 places, 318/322 transitions.
Incomplete random walk after 10000 steps, including 329 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 840129 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :{}
Probabilistic random walk after 840129 steps, saw 117535 distinct states, run finished after 3004 ms. (steps per millisecond=279 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 318 rows 83 cols
[2024-05-21 17:21:14] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 17:21:14] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 17:21:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 17:21:14] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 17:21:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:21:14] [INFO ] After 62ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 17:21:15] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 1 ms to minimize.
[2024-05-21 17:21:15] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2024-05-21 17:21:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2024-05-21 17:21:15] [INFO ] After 473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-21 17:21:15] [INFO ] After 855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 27 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 318/318 transitions.
Applied a total of 0 rules in 15 ms. Remains 83 /83 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 83/83 places, 318/318 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 318/318 transitions.
Applied a total of 0 rules in 11 ms. Remains 83 /83 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2024-05-21 17:21:15] [INFO ] Invariant cache hit.
[2024-05-21 17:21:15] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 17:21:15] [INFO ] Invariant cache hit.
[2024-05-21 17:21:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:21:15] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 448 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 318/318 transitions.
Applied a total of 0 rules in 12 ms. Remains 82 /82 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 472 ms. Remains : 82/83 places, 318/318 transitions.
Incomplete random walk after 10000 steps, including 357 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 923771 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 923771 steps, saw 131269 distinct states, run finished after 3003 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 318 rows 82 cols
[2024-05-21 17:21:19] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 17:21:19] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 17:21:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 17:21:19] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 17:21:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:21:19] [INFO ] After 55ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 17:21:19] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 0 ms to minimize.
[2024-05-21 17:21:19] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2024-05-21 17:21:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2024-05-21 17:21:19] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-21 17:21:20] [INFO ] After 796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 27 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 318/318 transitions.
Applied a total of 0 rules in 20 ms. Remains 82 /82 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 82/82 places, 318/318 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 318/318 transitions.
Applied a total of 0 rules in 21 ms. Remains 82 /82 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2024-05-21 17:21:20] [INFO ] Invariant cache hit.
[2024-05-21 17:21:20] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-21 17:21:20] [INFO ] Invariant cache hit.
[2024-05-21 17:21:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:21:20] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2024-05-21 17:21:20] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-21 17:21:20] [INFO ] Invariant cache hit.
[2024-05-21 17:21:21] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1001 ms. Remains : 82/82 places, 318/318 transitions.
Applied a total of 0 rules in 12 ms. Remains 82 /82 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 17:21:21] [INFO ] Invariant cache hit.
[2024-05-21 17:21:21] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 17:21:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 17:21:21] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 17:21:21] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2024-05-21 17:21:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-05-21 17:21:21] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 1 ms to minimize.
[2024-05-21 17:21:22] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2024-05-21 17:21:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
[2024-05-21 17:21:22] [INFO ] After 788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-21 17:21:22] [INFO ] After 946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-21 17:21:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-21 17:21:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 318 transitions and 3170 arcs took 6 ms.
[2024-05-21 17:21:22] [INFO ] Flatten gal took : 159 ms
Total runtime 23431 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-07b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityCardinality

FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716312085382

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 0 AutonomousCar-PT-07b-ReachabilityCardinality-2024-03
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 0 AutonomousCar-PT-07b-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 0 AutonomousCar-PT-07b-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 10 (type SRCH) for 0 AutonomousCar-PT-07b-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 10 (type SRCH) for AutonomousCar-PT-07b-ReachabilityCardinality-2024-03
lola: result : true
lola: markings : 76
lola: fired transitions : 75
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 7 (type FNDP) for AutonomousCar-PT-07b-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 8 (type EQUN) for AutonomousCar-PT-07b-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 11 (type EXCL) for AutonomousCar-PT-07b-ReachabilityCardinality-2024-03 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 3 AutonomousCar-PT-07b-ReachabilityCardinality-2024-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 AutonomousCar-PT-07b-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 AutonomousCar-PT-07b-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 3 AutonomousCar-PT-07b-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 7 (type FNDP) for AutonomousCar-PT-07b-ReachabilityCardinality-2024-03
lola: result : true
lola: fired transitions : 74
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-14.sara.
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 13 (type FNDP) for AutonomousCar-PT-07b-ReachabilityCardinality-2024-07
lola: result : true
lola: fired transitions : 41814
lola: tried executions : 1335
lola: time used : 2.000000
lola: memory pages used : 0
lola: CANCELED task # 14 (type EQUN) for AutonomousCar-PT-07b-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 16 (type SRCH) for AutonomousCar-PT-07b-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 17 (type EXCL) for AutonomousCar-PT-07b-ReachabilityCardinality-2024-07 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-07b-ReachabilityCardinality-2024-03: AG false tandem / insertion
AutonomousCar-PT-07b-ReachabilityCardinality-2024-07: EF true findpath


Time elapsed: 2 secs. Pages in use: 2

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-07b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is AutonomousCar-PT-07b, 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 r043-smll-171620180300204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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