About the Execution of 2023-gold for LeafsetExtension-PT-S32C4
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
529.403 | 25329.00 | 40880.00 | 637.50 | TTFFFFFTFFFFTTFF | 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-171649628400239.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 LeafsetExtension-PT-S32C4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628400239
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 17K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716563793016
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=LeafsetExtension-PT-S32C4
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-24 15:16:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 15:16:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:16:34] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2024-05-24 15:16:34] [INFO ] Transformed 5622 places.
[2024-05-24 15:16:34] [INFO ] Transformed 5449 transitions.
[2024-05-24 15:16:34] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 300 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 16) seen :3
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :1
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :1
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 5449 rows 5622 cols
[2024-05-24 15:16:36] [INFO ] Computed 173 invariants in 409 ms
[2024-05-24 15:16:38] [INFO ] After 1905ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-24 15:16:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2024-05-24 15:16:39] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 165 ms returned sat
[2024-05-24 15:16:44] [INFO ] After 3888ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :2
[2024-05-24 15:16:44] [INFO ] After 4658ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :2
Attempting to minimize the solution found.
Minimization took 381 ms.
[2024-05-24 15:16:45] [INFO ] After 6719ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :2
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
TestFail conflict detected : techniques TOPOLOGICAL PARIKH_WALK answered differently (false)on formula LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-00
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
TestFail conflict detected : techniques TOPOLOGICAL PARIKH_WALK answered differently (false)on formula LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-01
Parikh walk visited 0 properties in 13 ms.
Support contains 34 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 698 are kept as prefixes of interest. Removing 4924 places using SCC suffix rule.16 ms
Discarding 4924 places :
Also discarding 2736 output transitions
Drop transitions removed 2736 transitions
Drop transitions removed 1047 transitions
Reduce isomorphic transitions removed 1047 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 1279 rules applied. Total rules applied 1280 place count 698 transition count 1434
Reduce places removed 234 places and 0 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 247 rules applied. Total rules applied 1527 place count 464 transition count 1421
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 1541 place count 451 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1542 place count 450 transition count 1420
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 1542 place count 450 transition count 1404
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 1574 place count 434 transition count 1404
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1589 place count 419 transition count 1389
Iterating global reduction 4 with 15 rules applied. Total rules applied 1604 place count 419 transition count 1389
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 1613 place count 419 transition count 1380
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1622 place count 410 transition count 1380
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 5 with 149 rules applied. Total rules applied 1771 place count 410 transition count 1380
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 5 with 9 rules applied. Total rules applied 1780 place count 401 transition count 1380
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1786 place count 401 transition count 1374
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1792 place count 395 transition count 1374
Applied a total of 1792 rules in 248 ms. Remains 395 /5622 variables (removed 5227) and now considering 1374/5449 (removed 4075) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 395/5622 places, 1374/5449 transitions.
Incomplete random walk after 10000 steps, including 871 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :1
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:16:45] [INFO ] Flow matrix only has 605 transitions (discarded 769 similar events)
// Phase 1: matrix 605 rows 395 cols
[2024-05-24 15:16:45] [INFO ] Computed 3 invariants in 10 ms
[2024-05-24 15:16:45] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:16:45] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 15:16:45] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:16:46] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-24 15:16:46] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 24 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 1374/1374 transitions.
Graph (complete) has 1082 edges and 395 vertex of which 336 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.1 ms
Discarding 59 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 336 transition count 1315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 335 transition count 1315
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 87 place count 335 transition count 1315
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 90 place count 332 transition count 1315
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 332 transition count 1313
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 330 transition count 1313
Applied a total of 94 rules in 76 ms. Remains 330 /395 variables (removed 65) and now considering 1313/1374 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 330/395 places, 1313/1374 transitions.
Incomplete random walk after 10000 steps, including 892 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 177402 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 177402 steps, saw 48404 distinct states, run finished after 3003 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:16:49] [INFO ] Flow matrix only has 493 transitions (discarded 820 similar events)
// Phase 1: matrix 493 rows 330 cols
[2024-05-24 15:16:49] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 15:16:49] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:16:49] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 15:16:49] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:16:49] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-24 15:16:49] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 24 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 1313/1313 transitions.
Applied a total of 0 rules in 16 ms. Remains 330 /330 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 330/330 places, 1313/1313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 1313/1313 transitions.
Applied a total of 0 rules in 14 ms. Remains 330 /330 variables (removed 0) and now considering 1313/1313 (removed 0) transitions.
[2024-05-24 15:16:49] [INFO ] Flow matrix only has 493 transitions (discarded 820 similar events)
[2024-05-24 15:16:49] [INFO ] Invariant cache hit.
[2024-05-24 15:16:50] [INFO ] Implicit Places using invariants in 527 ms returned [26, 180]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 530 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 328/330 places, 1313/1313 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 328 transition count 1312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 327 transition count 1312
Applied a total of 2 rules in 48 ms. Remains 327 /328 variables (removed 1) and now considering 1312/1313 (removed 1) transitions.
[2024-05-24 15:16:50] [INFO ] Flow matrix only has 492 transitions (discarded 820 similar events)
// Phase 1: matrix 492 rows 327 cols
[2024-05-24 15:16:50] [INFO ] Computed 1 invariants in 7 ms
[2024-05-24 15:16:50] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-24 15:16:50] [INFO ] Flow matrix only has 492 transitions (discarded 820 similar events)
[2024-05-24 15:16:50] [INFO ] Invariant cache hit.
[2024-05-24 15:16:51] [INFO ] Implicit Places using invariants and state equation in 832 ms returned [20, 23, 43, 46, 50, 70, 73, 95, 97, 100, 103, 122, 142, 145, 149, 156, 176, 181, 184, 189, 192, 212, 217, 221, 224, 227, 247, 252, 257, 277, 297, 300, 320, 325]
Discarding 34 places :
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Implicit Place search using SMT with State Equation took 1063 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 293/330 places, 1298/1313 transitions.
Graph (complete) has 615 edges and 293 vertex of which 279 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 279 transition count 1296
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 277 transition count 1296
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 153 place count 129 transition count 1148
Iterating global reduction 0 with 148 rules applied. Total rules applied 301 place count 129 transition count 1148
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 0 with 33 rules applied. Total rules applied 334 place count 129 transition count 1115
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 367 place count 96 transition count 1115
Applied a total of 367 rules in 75 ms. Remains 96 /293 variables (removed 197) and now considering 1115/1298 (removed 183) transitions.
[2024-05-24 15:16:51] [INFO ] Flow matrix only has 281 transitions (discarded 834 similar events)
// Phase 1: matrix 281 rows 96 cols
[2024-05-24 15:16:51] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 15:16:51] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-24 15:16:51] [INFO ] Flow matrix only has 281 transitions (discarded 834 similar events)
[2024-05-24 15:16:51] [INFO ] Invariant cache hit.
[2024-05-24 15:16:51] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 96/330 places, 1115/1313 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2107 ms. Remains : 96/330 places, 1115/1313 transitions.
Incomplete random walk after 10000 steps, including 1427 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 661801 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 661801 steps, saw 176747 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 15:16:54] [INFO ] Flow matrix only has 281 transitions (discarded 834 similar events)
[2024-05-24 15:16:54] [INFO ] Invariant cache hit.
[2024-05-24 15:16:55] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:16:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 15:16:55] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:16:55] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-24 15:16:55] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 24 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 1115/1115 transitions.
Applied a total of 0 rules in 17 ms. Remains 96 /96 variables (removed 0) and now considering 1115/1115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 96/96 places, 1115/1115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 1115/1115 transitions.
Applied a total of 0 rules in 13 ms. Remains 96 /96 variables (removed 0) and now considering 1115/1115 (removed 0) transitions.
[2024-05-24 15:16:55] [INFO ] Flow matrix only has 281 transitions (discarded 834 similar events)
[2024-05-24 15:16:55] [INFO ] Invariant cache hit.
[2024-05-24 15:16:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-24 15:16:55] [INFO ] Flow matrix only has 281 transitions (discarded 834 similar events)
[2024-05-24 15:16:55] [INFO ] Invariant cache hit.
[2024-05-24 15:16:55] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-24 15:16:55] [INFO ] Redundant transitions in 101 ms returned []
[2024-05-24 15:16:55] [INFO ] Flow matrix only has 281 transitions (discarded 834 similar events)
[2024-05-24 15:16:55] [INFO ] Invariant cache hit.
[2024-05-24 15:16:55] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 706 ms. Remains : 96/96 places, 1115/1115 transitions.
Drop transitions removed 867 transitions
Reduce isomorphic transitions removed 867 transitions.
Iterating post reduction 0 with 867 rules applied. Total rules applied 867 place count 96 transition count 248
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 876 place count 87 transition count 203
Iterating global reduction 1 with 9 rules applied. Total rules applied 885 place count 87 transition count 203
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 1 with 38 rules applied. Total rules applied 923 place count 87 transition count 165
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 961 place count 49 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 962 place count 48 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 963 place count 48 transition count 158
Applied a total of 963 rules in 10 ms. Remains 48 /96 variables (removed 48) and now considering 158/1115 (removed 957) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 158 rows 48 cols
[2024-05-24 15:16:55] [INFO ] Computed 1 invariants in 2 ms
[2024-05-24 15:16:55] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:16:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 15:16:55] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:16:56] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-24 15:16:56] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-24 15:16:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-24 15:16:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 96 places, 1115 transitions and 4521 arcs took 7 ms.
[2024-05-24 15:16:56] [INFO ] Flatten gal took : 111 ms
Total runtime 21892 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT LeafsetExtension-PT-S32C4
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityCardinality
FORMULA LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1716563818345
--------------------
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: 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 # 7 (type EXCL) for 0 LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 6 (type SRCH) for 0 LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 6 (type SRCH) for LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07
lola: result : true
lola: markings : 9
lola: fired transitions : 8
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 4 (type EQUN) for LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 7 (type EXCL) for LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LeafsetExtension-PT-S32C4-ReachabilityCardinality-2024-07: EF true tandem / insertion
Time elapsed: 0 secs. Pages in use: 2
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S32C4"
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 LeafsetExtension-PT-S32C4, 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-171649628400239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S32C4.tgz
mv LeafsetExtension-PT-S32C4 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 ;