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-171620180300214.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-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180300214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 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 517K 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-08b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716315865354

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-08b
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-21 18:24:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 18:24:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:24:28] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2024-05-21 18:24:28] [INFO ] Transformed 357 places.
[2024-05-21 18:24:28] [INFO ] Transformed 1128 transitions.
[2024-05-21 18:24:28] [INFO ] Found NUPN structural information;
[2024-05-21 18:24:28] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 352 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-08b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 90 resets, run finished after 748 ms. (steps per millisecond=13 ) properties (out of 14) seen :9
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1128 rows 357 cols
[2024-05-21 18:24:29] [INFO ] Computed 13 invariants in 33 ms
[2024-05-21 18:24:30] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 18:24:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 96 ms returned sat
[2024-05-21 18:24:31] [INFO ] After 889ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-21 18:24:32] [INFO ] Deduced a trap composed of 29 places in 662 ms of which 17 ms to minimize.
[2024-05-21 18:24:32] [INFO ] Deduced a trap composed of 49 places in 363 ms of which 1 ms to minimize.
[2024-05-21 18:24:32] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 1 ms to minimize.
[2024-05-21 18:24:33] [INFO ] Deduced a trap composed of 31 places in 460 ms of which 1 ms to minimize.
[2024-05-21 18:24:33] [INFO ] Deduced a trap composed of 48 places in 285 ms of which 1 ms to minimize.
[2024-05-21 18:24:34] [INFO ] Deduced a trap composed of 32 places in 446 ms of which 1 ms to minimize.
[2024-05-21 18:24:34] [INFO ] Deduced a trap composed of 49 places in 273 ms of which 1 ms to minimize.
[2024-05-21 18:24:34] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 1 ms to minimize.
[2024-05-21 18:24:35] [INFO ] Deduced a trap composed of 30 places in 451 ms of which 1 ms to minimize.
[2024-05-21 18:24:35] [INFO ] Deduced a trap composed of 54 places in 268 ms of which 0 ms to minimize.
[2024-05-21 18:24:35] [INFO ] Deduced a trap composed of 55 places in 256 ms of which 0 ms to minimize.
[2024-05-21 18:24:36] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 0 ms to minimize.
[2024-05-21 18:24:36] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 0 ms to minimize.
[2024-05-21 18:24:36] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 0 ms to minimize.
[2024-05-21 18:24:36] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 1 ms to minimize.
[2024-05-21 18:24:37] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 1 ms to minimize.
[2024-05-21 18:24:37] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 0 ms to minimize.
[2024-05-21 18:24:37] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6095 ms
[2024-05-21 18:24:37] [INFO ] After 7100ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-21 18:24:37] [INFO ] After 7575ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 9 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 328 edges and 357 vertex of which 4 / 357 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 1428 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.16 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 348 transition count 970
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 188 rules applied. Total rules applied 339 place count 201 transition count 929
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 25 rules applied. Total rules applied 364 place count 178 transition count 927
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 366 place count 176 transition count 927
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 366 place count 176 transition count 921
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 378 place count 170 transition count 921
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 407 place count 141 transition count 892
Iterating global reduction 4 with 29 rules applied. Total rules applied 436 place count 141 transition count 892
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 4 with 256 rules applied. Total rules applied 692 place count 141 transition count 636
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 692 place count 141 transition count 634
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 696 place count 139 transition count 634
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 704 place count 131 transition count 577
Iterating global reduction 5 with 8 rules applied. Total rules applied 712 place count 131 transition count 577
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 12 rules applied. Total rules applied 724 place count 131 transition count 565
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 730 place count 125 transition count 565
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 814 place count 83 transition count 522
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 821 place count 76 transition count 459
Iterating global reduction 7 with 7 rules applied. Total rules applied 828 place count 76 transition count 459
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 829 place count 76 transition count 458
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 840 place count 76 transition count 447
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 851 place count 65 transition count 447
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 853 place count 65 transition count 445
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 854 place count 65 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 855 place count 64 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 856 place count 63 transition count 444
Applied a total of 856 rules in 438 ms. Remains 63 /357 variables (removed 294) and now considering 444/1128 (removed 684) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 438 ms. Remains : 63/357 places, 444/1128 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 444 rows 63 cols
[2024-05-21 18:24:38] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 18:24:38] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 18:24:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 18:24:38] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 18:24:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 18:24:38] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 18:24:38] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-21 18:24:38] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 444/444 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 1 rules applied. Total rules applied 1 place count 63 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 443
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 61 transition count 442
Applied a total of 4 rules in 34 ms. Remains 61 /63 variables (removed 2) and now considering 442/444 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 61/63 places, 442/444 transitions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1454800 steps, run timeout after 3001 ms. (steps per millisecond=484 ) properties seen :{}
Probabilistic random walk after 1454800 steps, saw 205377 distinct states, run finished after 3004 ms. (steps per millisecond=484 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 442 rows 61 cols
[2024-05-21 18:24:41] [INFO ] Computed 12 invariants in 5 ms
[2024-05-21 18:24:41] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 18:24:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 18:24:41] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 18:24:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 18:24:41] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 18:24:42] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-21 18:24:42] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 442/442 transitions.
Applied a total of 0 rules in 19 ms. Remains 61 /61 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 61/61 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 442/442 transitions.
Applied a total of 0 rules in 19 ms. Remains 61 /61 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-05-21 18:24:42] [INFO ] Invariant cache hit.
[2024-05-21 18:24:42] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 18:24:42] [INFO ] Invariant cache hit.
[2024-05-21 18:24:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 18:24:42] [INFO ] Implicit Places using invariants and state equation in 332 ms returned [53, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 555 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/61 places, 442/442 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 441
Applied a total of 2 rules in 23 ms. Remains 58 /59 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 58 cols
[2024-05-21 18:24:42] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 18:24:42] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 18:24:42] [INFO ] Invariant cache hit.
[2024-05-21 18:24:43] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/61 places, 441/442 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1082 ms. Remains : 58/61 places, 441/442 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1657503 steps, run timeout after 3001 ms. (steps per millisecond=552 ) properties seen :{}
Probabilistic random walk after 1657503 steps, saw 235066 distinct states, run finished after 3001 ms. (steps per millisecond=552 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 18:24:46] [INFO ] Invariant cache hit.
[2024-05-21 18:24:46] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 18:24:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 18:24:46] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 18:24:46] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-21 18:24:46] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 441/441 transitions.
Applied a total of 0 rules in 17 ms. Remains 58 /58 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 58/58 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 441/441 transitions.
Applied a total of 0 rules in 18 ms. Remains 58 /58 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-21 18:24:46] [INFO ] Invariant cache hit.
[2024-05-21 18:24:46] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 18:24:46] [INFO ] Invariant cache hit.
[2024-05-21 18:24:47] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2024-05-21 18:24:47] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-21 18:24:47] [INFO ] Invariant cache hit.
[2024-05-21 18:24:47] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 847 ms. Remains : 58/58 places, 441/441 transitions.
Applied a total of 0 rules in 18 ms. Remains 58 /58 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 18:24:47] [INFO ] Invariant cache hit.
[2024-05-21 18:24:47] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 18:24:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 18:24:47] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 18:24:47] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-21 18:24:47] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-21 18:24:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-21 18:24:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 58 places, 441 transitions and 5563 arcs took 9 ms.
[2024-05-21 18:24:48] [INFO ] Flatten gal took : 225 ms
Total runtime 20402 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-08b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
ReachabilityCardinality

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

BK_STOP 1716315889615

--------------------
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/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/ReachabilityCardinality.xml
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 # 8 (type EXCL) for 0 AutonomousCar-PT-08b-ReachabilityCardinality-2024-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 AutonomousCar-PT-08b-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 AutonomousCar-PT-08b-ReachabilityCardinality-2024-14
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 # 7 (type SRCH) for 0 AutonomousCar-PT-08b-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 4 (type FNDP) for AutonomousCar-PT-08b-ReachabilityCardinality-2024-14
lola: result : true
lola: fired transitions : 445
lola: tried executions : 12
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 5 (type EQUN) for AutonomousCar-PT-08b-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 7 (type SRCH) for AutonomousCar-PT-08b-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 8 (type EXCL) for AutonomousCar-PT-08b-ReachabilityCardinality-2024-14 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-08b-ReachabilityCardinality-2024-14: AG false findpath


Time elapsed: 0 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-08b"
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-08b, 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-171620180300214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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