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.r109-tall-171624208600459.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 DES-PT-50a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208600459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 97K 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 DES-PT-50a-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-50a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716340390123

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=DES-PT-50a
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-22 01:13:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 01:13:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:13:11] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-22 01:13:11] [INFO ] Transformed 314 places.
[2024-05-22 01:13:11] [INFO ] Transformed 271 transitions.
[2024-05-22 01:13:11] [INFO ] Found NUPN structural information;
[2024-05-22 01:13:11] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-50a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 227 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 13) seen :2
FORMULA DES-PT-50a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 257 rows 314 cols
[2024-05-22 01:13:13] [INFO ] Computed 59 invariants in 33 ms
[2024-05-22 01:13:13] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-22 01:13:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 01:13:13] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 158 ms returned sat
[2024-05-22 01:13:15] [INFO ] After 1577ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2024-05-22 01:13:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:13:18] [INFO ] After 2710ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :8
[2024-05-22 01:13:19] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 6 ms to minimize.
[2024-05-22 01:13:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2024-05-22 01:13:21] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2024-05-22 01:13:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-22 01:13:22] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-22 01:13:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2024-05-22 01:13:22] [INFO ] After 6790ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 1374 ms.
[2024-05-22 01:13:24] [INFO ] After 10578ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
FORMULA DES-PT-50a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 250 ms.
Support contains 48 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 313 transition count 254
Applied a total of 7 rules in 88 ms. Remains 313 /314 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 313/314 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 564039 steps, run timeout after 3006 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 564039 steps, saw 81162 distinct states, run finished after 3007 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 01:13:27] [INFO ] Computed 61 invariants in 18 ms
[2024-05-22 01:13:28] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 01:13:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned sat
[2024-05-22 01:13:28] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 29 ms returned sat
[2024-05-22 01:13:29] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-22 01:13:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 01:13:29] [INFO ] After 394ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-22 01:13:29] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 6 ms to minimize.
[2024-05-22 01:13:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-22 01:13:30] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-22 01:13:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-22 01:13:30] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2024-05-22 01:13:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-05-22 01:13:30] [INFO ] After 1278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 478 ms.
[2024-05-22 01:13:31] [INFO ] After 2761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA DES-PT-50a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 342 ms.
Support contains 43 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 12 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 313/313 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 153 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 796167 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{}
Probabilistic random walk after 796167 steps, saw 113985 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 01:13:34] [INFO ] Invariant cache hit.
[2024-05-22 01:13:34] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:13:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2024-05-22 01:13:35] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 119 ms returned sat
[2024-05-22 01:13:35] [INFO ] After 841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 01:13:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 01:13:37] [INFO ] After 1979ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 01:13:38] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-22 01:13:38] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-22 01:13:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2024-05-22 01:13:38] [INFO ] After 2636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 443 ms.
[2024-05-22 01:13:39] [INFO ] After 4211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA DES-PT-50a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 255 ms.
Support contains 42 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 29 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 313/313 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 156 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1093873 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :{}
Probabilistic random walk after 1093873 steps, saw 153190 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-22 01:13:42] [INFO ] Invariant cache hit.
[2024-05-22 01:13:42] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:13:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:13:42] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 165 ms returned sat
[2024-05-22 01:13:43] [INFO ] After 761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:13:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 01:13:44] [INFO ] After 421ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 01:13:44] [INFO ] After 665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 444 ms.
[2024-05-22 01:13:44] [INFO ] After 2203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 204 ms.
Support contains 42 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 313/313 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 01:13:45] [INFO ] Invariant cache hit.
[2024-05-22 01:13:45] [INFO ] Implicit Places using invariants in 233 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 245 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 312/313 places, 254/254 transitions.
Applied a total of 0 rules in 18 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 274 ms. Remains : 312/313 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1181633 steps, run timeout after 3001 ms. (steps per millisecond=393 ) properties seen :{}
Probabilistic random walk after 1181633 steps, saw 165564 distinct states, run finished after 3001 ms. (steps per millisecond=393 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:13:48] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 01:13:48] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:13:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 01:13:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 80 ms returned sat
[2024-05-22 01:13:49] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:13:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:13:50] [INFO ] After 366ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 01:13:50] [INFO ] After 718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 345 ms.
[2024-05-22 01:13:50] [INFO ] After 1868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 165 ms.
Support contains 42 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 01:13:50] [INFO ] Invariant cache hit.
[2024-05-22 01:13:51] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-22 01:13:51] [INFO ] Invariant cache hit.
[2024-05-22 01:13:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:13:51] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2024-05-22 01:13:51] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-22 01:13:51] [INFO ] Invariant cache hit.
[2024-05-22 01:13:51] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 871 ms. Remains : 312/312 places, 254/254 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 16 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:13:51] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:13:51] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 01:13:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:13:52] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 51 ms returned sat
[2024-05-22 01:13:52] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 01:13:52] [INFO ] After 892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 266 ms.
[2024-05-22 01:13:53] [INFO ] After 1354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-22 01:13:53] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2024-05-22 01:13:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 312 places, 254 transitions and 1250 arcs took 1 ms.
[2024-05-22 01:13:53] [INFO ] Flatten gal took : 116 ms
Total runtime 42129 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-50a
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityCardinality

FORMULA DES-PT-50a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716340434910
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 16054760 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16054704 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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:711
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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 18 (type EXCL) for 6 DES-PT-50a-ReachabilityCardinality-2024-14
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 6 DES-PT-50a-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 6 DES-PT-50a-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 17 (type SRCH) for 6 DES-PT-50a-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: 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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 12 (type FNDP) for DES-PT-50a-ReachabilityCardinality-2024-14
lola: result : true
lola: fired transitions : 1199
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 17 (type SRCH) for DES-PT-50a-ReachabilityCardinality-2024-14
lola: result : true
lola: markings : 1201
lola: fired transitions : 1200
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type EQUN) for DES-PT-50a-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 18 (type EXCL) for DES-PT-50a-ReachabilityCardinality-2024-14 (obsolete)
lola: LAUNCH task # 26 (type EXCL) for 0 DES-PT-50a-ReachabilityCardinality-2024-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 3 DES-PT-50a-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 3 DES-PT-50a-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type SRCH) for 3 DES-PT-50a-ReachabilityCardinality-2024-12
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: FINISHED task # 10 (type FNDP) for DES-PT-50a-ReachabilityCardinality-2024-12
lola: result : true
lola: fired transitions : 653
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 11 (type EQUN) for DES-PT-50a-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 21 (type SRCH) for DES-PT-50a-ReachabilityCardinality-2024-12 (obsolete)
lola: LAUNCH task # 14 (type FNDP) for 0 DES-PT-50a-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 0 DES-PT-50a-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 0 DES-PT-50a-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/372/ReachabilityCardinality-13.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/372/ReachabilityCardinality-11.sara.
lola: FINISHED task # 25 (type SRCH) for DES-PT-50a-ReachabilityCardinality-2024-07
lola: result : true
lola: markings : 1432
lola: fired transitions : 1431
lola: time used : 0.000000
lola: memory pages used : 1
sara: place or transition ordering is non-deterministic
lola: CANCELED task # 14 (type FNDP) for DES-PT-50a-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 15 (type EQUN) for DES-PT-50a-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 26 (type EXCL) for DES-PT-50a-ReachabilityCardinality-2024-07 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50a-ReachabilityCardinality-2024-07: EF true tandem / insertion
DES-PT-50a-ReachabilityCardinality-2024-12: AG false findpath
DES-PT-50a-ReachabilityCardinality-2024-14: EF true findpath


Time elapsed: 0 secs. Pages in use: 2
sara: try reading problem file /home/mcc/execution/372/ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

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="DES-PT-50a"
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 DES-PT-50a, 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 r109-tall-171624208600459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a 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 ;