About the Execution of 2023-gold for LamportFastMutEx-COL-6
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
656.136 | 26333.00 | 65137.00 | 372.30 | TTTFFFFFFFFTFTFT | normal |
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.r241-tall-171649628200149.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 LamportFastMutEx-COL-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628200149
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.7K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 07:41 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.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 07:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 07:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K 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 LamportFastMutEx-COL-6-ReachabilityCardinality-2024-00
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-01
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-02
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-03
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-04
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-05
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-06
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-07
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-08
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-09
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-11
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-12
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-13
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-14
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716553639045
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=LamportFastMutEx-COL-6
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-24 12:27:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 12:27:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:27:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 12:27:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 12:27:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 660 ms
[2024-05-24 12:27:21] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 12:27:21] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 12:27:21] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
[2024-05-24 12:27:21] [INFO ] Flatten gal took : 14 ms
[2024-05-24 12:27:21] [INFO ] Flatten gal took : 3 ms
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
Domain [pid(7), pid(7)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 12:27:21] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 24 ms.
[2024-05-24 12:27:21] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 66 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 15) seen :2
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-24 12:27:22] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2024-05-24 12:27:22] [INFO ] Computed 50 invariants in 12 ms
[2024-05-24 12:27:24] [INFO ] After 934ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2024-05-24 12:27:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2024-05-24 12:27:24] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :1
[2024-05-24 12:27:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 12:27:24] [INFO ] After 56ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :12 sat :1
[2024-05-24 12:27:24] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 5 ms to minimize.
[2024-05-24 12:27:24] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-24 12:27:24] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-24 12:27:24] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 2 ms to minimize.
[2024-05-24 12:27:24] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-24 12:27:24] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-24 12:27:24] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 12:27:24] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-24 12:27:24] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-24 12:27:25] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-24 12:27:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 674 ms
[2024-05-24 12:27:25] [INFO ] After 776ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-24 12:27:25] [INFO ] After 1067ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :1
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 54 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 176 transition count 348
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 38 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 170/176 places, 348/354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 1208210 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :{}
Probabilistic random walk after 1208210 steps, saw 395282 distinct states, run finished after 3002 ms. (steps per millisecond=402 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:27:28] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2024-05-24 12:27:28] [INFO ] Computed 50 invariants in 10 ms
[2024-05-24 12:27:28] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:27:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-24 12:27:28] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:27:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 12:27:28] [INFO ] After 44ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 12:27:28] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-24 12:27:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-24 12:27:28] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-05-24 12:27:28] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2024-05-24 12:27:28] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-24 12:27:28] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 12:27:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 476 ms
[2024-05-24 12:27:28] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-24 12:27:28] [INFO ] After 723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 54 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 348/348 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 170/170 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 348/348 transitions.
Applied a total of 0 rules in 26 ms. Remains 170 /170 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-05-24 12:27:29] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 12:27:29] [INFO ] Invariant cache hit.
[2024-05-24 12:27:29] [INFO ] Implicit Places using invariants in 135 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 138 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/170 places, 348/348 transitions.
Applied a total of 0 rules in 10 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 174 ms. Remains : 164/170 places, 348/348 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1146233 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :{}
Probabilistic random walk after 1146233 steps, saw 380621 distinct states, run finished after 3001 ms. (steps per millisecond=381 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:27:32] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2024-05-24 12:27:32] [INFO ] Computed 44 invariants in 6 ms
[2024-05-24 12:27:32] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:27:32] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-05-24 12:27:32] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:27:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:27:32] [INFO ] After 43ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 12:27:32] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-24 12:27:32] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-24 12:27:32] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-24 12:27:32] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-24 12:27:32] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-24 12:27:32] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-24 12:27:33] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-24 12:27:33] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-24 12:27:33] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-05-24 12:27:33] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-05-24 12:27:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 701 ms
[2024-05-24 12:27:33] [INFO ] After 787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-24 12:27:33] [INFO ] After 991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 54 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 13 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 164/164 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 17 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-05-24 12:27:33] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 12:27:33] [INFO ] Invariant cache hit.
[2024-05-24 12:27:33] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-24 12:27:33] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 12:27:33] [INFO ] Invariant cache hit.
[2024-05-24 12:27:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:27:33] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-24 12:27:33] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 12:27:33] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 12:27:33] [INFO ] Invariant cache hit.
[2024-05-24 12:27:33] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 164/164 places, 348/348 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 164 transition count 258
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 158 transition count 288
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 158 transition count 282
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 114 place count 152 transition count 282
Applied a total of 114 rules in 25 ms. Remains 152 /164 variables (removed 12) and now considering 282/348 (removed 66) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 282 rows 152 cols
[2024-05-24 12:27:33] [INFO ] Computed 44 invariants in 2 ms
[2024-05-24 12:27:33] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:27:33] [INFO ] [Nat]Absence check using 44 positive place invariants in 5 ms returned sat
[2024-05-24 12:27:33] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:27:33] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-24 12:27:34] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-24 12:27:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2024-05-24 12:27:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 164 places, 348 transitions and 1620 arcs took 4 ms.
[2024-05-24 12:27:34] [INFO ] Flatten gal took : 33 ms
Total runtime 13666 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT LamportFastMutEx-COL-6
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityCardinality
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1716553665378
--------------------
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/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/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 # 5 (type SKEL/FNDP) for 0 LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 6 (type SKEL/EQUN) for 0 LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type SKEL/SRCH) for 0 LamportFastMutEx-COL-6-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: LAUNCH task # 9 (type SKEL/SRCH) for 0 LamportFastMutEx-COL-6-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
sara: lola: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-6.sara.
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 # 6 (type SKEL/EQUN) for LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
lola: result : true
lola: CANCELED task # 5 (type FNDP) for LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 8 (type SRCH) for LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 9 (type SRCH) for LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 (obsolete)
lola: LAUNCH task # 16 (type EXCL) for 0 LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 0 LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 0 LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 0 LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 5 (type SKEL/FNDP) for LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
lola: result : unknown
lola: fired transitions : 86245
lola: tried executions : 1237
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10: AG 0 1 4 0 2 0 0 3
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 EF FNDP 5/1800 0/5 LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 894126 t fired, 1 attempts, .
13 EF STEQ 5/3600 0/5 LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 sara is running.
15 EF SRCH 5/3600 3/5 LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 696782 m, 139356 m/sec, 1029616 t fired, .
16 EF EXCL 5/3600 1/32 LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 210229 m, 42045 m/sec, 658700 t fired, .
Time elapsed: 5 secs. Pages in use: 4
# running tasks: 4 of 4 Visible: 1
lola: FINISHED task # 12 (type FNDP) for LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10
lola: result : true
lola: fired transitions : 1459823
lola: tried executions : 2
lola: time used : 10.000000
lola: memory pages used : 0
lola: CANCELED task # 13 (type EQUN) for LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 15 (type SRCH) for LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 16 (type EXCL) for LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-6-ReachabilityCardinality-2024-10: AG false findpath
Time elapsed: 10 secs. Pages in use: 7
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="LamportFastMutEx-COL-6"
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 LamportFastMutEx-COL-6, 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 r241-tall-171649628200149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-6.tgz
mv LamportFastMutEx-COL-6 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 '
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 ;