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.r153-tall-171631151000059.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 Dekker-PT-015, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151000059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 20:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 20:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 11 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 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 141K 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 Dekker-PT-015-ReachabilityCardinality-2024-00
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-01
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-02
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-03
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-04
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-05
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-06
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-07
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-08
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-09
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-10
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-11
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-12
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-13
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-14
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716414058563

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=Dekker-PT-015
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-22 21:40:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 21:40:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:41:00] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-22 21:41:00] [INFO ] Transformed 75 places.
[2024-05-22 21:41:00] [INFO ] Transformed 255 transitions.
[2024-05-22 21:41:00] [INFO ] Found NUPN structural information;
[2024-05-22 21:41:00] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1450784 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :{}
Probabilistic random walk after 1450784 steps, saw 106767 distinct states, run finished after 3002 ms. (steps per millisecond=483 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-22 21:41:03] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2024-05-22 21:41:03] [INFO ] Computed 45 invariants in 9 ms
[2024-05-22 21:41:03] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 21:41:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2024-05-22 21:41:04] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-22 21:41:04] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-22 21:41:04] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 21:41:04] [INFO ] After 50ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 220 ms
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 136 ms
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 119 ms
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 21:41:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 89 ms
[2024-05-22 21:41:04] [INFO ] After 652ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-22 21:41:04] [INFO ] After 832ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 27 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 23 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 75/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1971680 steps, run timeout after 3001 ms. (steps per millisecond=657 ) properties seen :{}
Probabilistic random walk after 1971680 steps, saw 138076 distinct states, run finished after 3001 ms. (steps per millisecond=657 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 21:41:07] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 21:41:07] [INFO ] Invariant cache hit.
[2024-05-22 21:41:07] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:41:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 3 ms returned sat
[2024-05-22 21:41:08] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-22 21:41:08] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 21:41:08] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 21:41:08] [INFO ] After 20ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 160 ms
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 21:41:08] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 276 ms
[2024-05-22 21:41:08] [INFO ] After 475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-22 21:41:08] [INFO ] After 573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 27 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 23 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 75/75 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 11 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 21:41:08] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 21:41:08] [INFO ] Invariant cache hit.
[2024-05-22 21:41:08] [INFO ] Implicit Places using invariants in 95 ms returned [33, 39, 48, 51, 54, 57, 60, 63, 66, 69, 72]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 97 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/75 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 64 /64 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 115 ms. Remains : 64/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1721216 steps, run timeout after 3001 ms. (steps per millisecond=573 ) properties seen :{}
Probabilistic random walk after 1721216 steps, saw 126231 distinct states, run finished after 3001 ms. (steps per millisecond=573 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 21:41:11] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 64 cols
[2024-05-22 21:41:11] [INFO ] Computed 34 invariants in 6 ms
[2024-05-22 21:41:11] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:41:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 3 ms returned sat
[2024-05-22 21:41:11] [INFO ] [Nat]Absence check using 30 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-22 21:41:11] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 21:41:11] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 21:41:11] [INFO ] After 17ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 108 ms
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-22 21:41:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 219 ms
[2024-05-22 21:41:12] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 21:41:12] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 27 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 64 /64 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 64/64 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 64 /64 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 21:41:12] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 21:41:12] [INFO ] Invariant cache hit.
[2024-05-22 21:41:12] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 21:41:12] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 21:41:12] [INFO ] Invariant cache hit.
[2024-05-22 21:41:12] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 21:41:12] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-22 21:41:12] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-22 21:41:12] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 21:41:12] [INFO ] Invariant cache hit.
[2024-05-22 21:41:12] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 64/64 places, 255/255 transitions.
Graph (complete) has 110 edges and 64 vertex of which 60 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Ensure Unique test removed 2 places
Ensure Unique test removed 182 transitions
Reduce isomorphic transitions removed 182 transitions.
Iterating post reduction 0 with 184 rules applied. Total rules applied 185 place count 58 transition count 56
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 194 place count 52 transition count 53
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 197 place count 52 transition count 50
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 200 place count 52 transition count 47
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 209 place count 46 transition count 44
Applied a total of 209 rules in 21 ms. Remains 46 /64 variables (removed 18) and now considering 44/255 (removed 211) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 46 cols
[2024-05-22 21:41:12] [INFO ] Computed 24 invariants in 2 ms
[2024-05-22 21:41:12] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:41:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 2 ms returned sat
[2024-05-22 21:41:12] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 21:41:12] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 21:41:12] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-22 21:41:12] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 21:41:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-22 21:41:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 64 places, 255 transitions and 1654 arcs took 4 ms.
[2024-05-22 21:41:12] [INFO ] Flatten gal took : 48 ms
Total runtime 13037 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Dekker-PT-015
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityCardinality

FORMULA Dekker-PT-015-ReachabilityCardinality-2024-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-ReachabilityCardinality-2024-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716414079085

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 3 Dekker-PT-015-ReachabilityCardinality-2024-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 Dekker-PT-015-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 Dekker-PT-015-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type SRCH) for 3 Dekker-PT-015-ReachabilityCardinality-2024-10
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: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: FINISHED task # 7 (type FNDP) for Dekker-PT-015-ReachabilityCardinality-2024-10
lola: result : true
lola: fired transitions : 13323
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 8 (type EQUN) for Dekker-PT-015-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 10 (type SRCH) for Dekker-PT-015-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 11 (type EXCL) for Dekker-PT-015-ReachabilityCardinality-2024-10 (obsolete)
lola: LAUNCH task # 18 (type EXCL) for 0 Dekker-PT-015-ReachabilityCardinality-2024-08
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 14 (type FNDP) for 0 Dekker-PT-015-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 0 Dekker-PT-015-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type SRCH) for 0 Dekker-PT-015-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 17 (type SRCH) for Dekker-PT-015-ReachabilityCardinality-2024-08
lola: result : true
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 14 (type FNDP) for Dekker-PT-015-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 15 (type EQUN) for Dekker-PT-015-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 18 (type EXCL) for Dekker-PT-015-ReachabilityCardinality-2024-08 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Dekker-PT-015-ReachabilityCardinality-2024-08: AG false tandem / insertion
Dekker-PT-015-ReachabilityCardinality-2024-10: AG false findpath


Time elapsed: 1 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="Dekker-PT-015"
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 Dekker-PT-015, 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 r153-tall-171631151000059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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