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.r069-tall-171620503900158.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 greatspnxred
Input is CANInsertWithFailure-PT-080, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503900158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 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 39M 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 CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2023-04
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-13
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2023-14
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716405622284

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 19:20:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 19:20:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:20:24] [INFO ] Load time of PNML (sax parser for PT used): 1253 ms
[2024-05-22 19:20:24] [INFO ] Transformed 13764 places.
[2024-05-22 19:20:25] [INFO ] Transformed 38880 transitions.
[2024-05-22 19:20:25] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1648 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (20 resets) in 4619 ms. (8 steps per ms) remains 11/16 properties
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1339 ms. (29 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 11/11 properties
// Phase 1: matrix 38880 rows 13764 cols
[2024-05-22 19:20:37] [INFO ] Computed 83 invariants in 9548 ms
[2024-05-22 19:20:38] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13408/13633 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13633 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 126/13759 variables, 63/80 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13759/52644 variables, and 80 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5047 ms.
Refiners :[Positive P Invariants (semi-flows): 80/81 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13764 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13408/13633 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 19:20:46] [INFO ] Deduced a trap composed of 5 places in 779 ms of which 50 ms to minimize.
[2024-05-22 19:20:46] [INFO ] Deduced a trap composed of 5 places in 670 ms of which 5 ms to minimize.
[2024-05-22 19:20:47] [INFO ] Deduced a trap composed of 5 places in 702 ms of which 5 ms to minimize.
[2024-05-22 19:20:48] [INFO ] Deduced a trap composed of 5 places in 698 ms of which 5 ms to minimize.
SMT process timed out in 20522ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 225 out of 13764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Graph (complete) has 52401 edges and 13764 vertex of which 13763 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.56 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 522 transitions
Trivial Post-agglo rules discarded 522 transitions
Performed 522 trivial Post agglomeration. Transition count delta: 522
Iterating post reduction 0 with 522 rules applied. Total rules applied 523 place count 13763 transition count 38358
Reduce places removed 522 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 534 rules applied. Total rules applied 1057 place count 13241 transition count 38346
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1069 place count 13229 transition count 38346
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1069 place count 13229 transition count 38341
Deduced a syphon composed of 5 places in 20 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1079 place count 13224 transition count 38341
Performed 6116 Post agglomeration using F-continuation condition.Transition count delta: 6116
Deduced a syphon composed of 6116 places in 42 ms
Reduce places removed 6116 places and 0 transitions.
Iterating global reduction 3 with 12232 rules applied. Total rules applied 13311 place count 7108 transition count 32225
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 13319 place count 7108 transition count 32217
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 13327 place count 7100 transition count 32217
Partial Free-agglomeration rule applied 6634 times.
Drop transitions (Partial Free agglomeration) removed 6634 transitions
Iterating global reduction 4 with 6634 rules applied. Total rules applied 19961 place count 7100 transition count 32217
Partial Free-agglomeration rule applied 482 times.
Drop transitions (Partial Free agglomeration) removed 482 transitions
Iterating global reduction 4 with 482 rules applied. Total rules applied 20443 place count 7100 transition count 32217
Applied a total of 20443 rules in 20913 ms. Remains 7100 /13764 variables (removed 6664) and now considering 32217/38880 (removed 6663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20941 ms. Remains : 7100/13764 places, 32217/38880 transitions.
RANDOM walk for 40000 steps (75 resets) in 3841 ms. (10 steps per ms) remains 8/11 properties
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
[2024-05-22 19:21:11] [INFO ] Flow matrix only has 32140 transitions (discarded 77 similar events)
// Phase 1: matrix 32140 rows 7100 cols
[2024-05-22 19:21:13] [INFO ] Computed 82 invariants in 2573 ms
[2024-05-22 19:21:14] [INFO ] State equation strengthened by 30801 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6780/6968 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6968 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 128/7096 variables, 64/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7096 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/7098 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7098 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 32140/39238 variables, 7098/7180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39238 variables, 30801/37981 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39238 variables, 0/37981 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 39240/39240 variables, and 37983 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45057 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 7100/7100 constraints, ReadFeed: 30801/30801 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6780/6968 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 19:22:00] [INFO ] Deduced a trap composed of 2 places in 330 ms of which 2 ms to minimize.
[2024-05-22 19:22:01] [INFO ] Deduced a trap composed of 2 places in 320 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6968 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6968 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 128/7096 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7096 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/7098 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 19:22:21] [INFO ] Deduced a trap composed of 89 places in 14125 ms of which 48 ms to minimize.
[2024-05-22 19:22:35] [INFO ] Deduced a trap composed of 88 places in 14369 ms of which 45 ms to minimize.
[2024-05-22 19:22:50] [INFO ] Deduced a trap composed of 104 places in 14904 ms of which 46 ms to minimize.
SMT process timed out in 99408ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 188 out of 7100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7100/7100 places, 32217/32217 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7100 transition count 32216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7099 transition count 32216
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 13 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 46 place count 7077 transition count 32194
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 59 place count 7077 transition count 32194
Applied a total of 59 rules in 7480 ms. Remains 7077 /7100 variables (removed 23) and now considering 32194/32217 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7481 ms. Remains : 7077/7100 places, 32194/32217 transitions.
RANDOM walk for 40000 steps (77 resets) in 2276 ms. (17 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 84453 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 8
Probabilistic random walk after 84453 steps, saw 81183 distinct states, run finished after 3011 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-22 19:23:02] [INFO ] Flow matrix only has 32129 transitions (discarded 65 similar events)
// Phase 1: matrix 32129 rows 7077 cols
[2024-05-22 19:23:04] [INFO ] Computed 82 invariants in 2108 ms
[2024-05-22 19:23:04] [INFO ] State equation strengthened by 30865 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6757/6945 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6945 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 128/7073 variables, 64/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7073 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/7075 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7075 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 32129/39204 variables, 7075/7157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39204 variables, 30865/38022 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39204 variables, 0/38022 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/39206 variables, 2/38024 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 39206/39206 variables, and 38024 constraints, problems are : Problem set: 0 solved, 8 unsolved in 75112 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 7077/7077 constraints, ReadFeed: 30865/30865 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 6757/6945 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 19:24:21] [INFO ] Deduced a trap composed of 2 places in 308 ms of which 3 ms to minimize.
[2024-05-22 19:24:21] [INFO ] Deduced a trap composed of 2 places in 310 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6945 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6945 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 128/7073 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7073 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/7075 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-22 19:24:43] [INFO ] Deduced a trap composed of 147 places in 16369 ms of which 46 ms to minimize.
[2024-05-22 19:24:59] [INFO ] Deduced a trap composed of 93 places in 15833 ms of which 44 ms to minimize.
[2024-05-22 19:25:15] [INFO ] Deduced a trap composed of 93 places in 15362 ms of which 44 ms to minimize.
[2024-05-22 19:25:29] [INFO ] Deduced a trap composed of 126 places in 13880 ms of which 44 ms to minimize.
[2024-05-22 19:25:44] [INFO ] Deduced a trap composed of 116 places in 14857 ms of which 40 ms to minimize.
SMT process timed out in 161929ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 188 out of 7077 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7077/7077 places, 32194/32194 transitions.
Applied a total of 0 rules in 2392 ms. Remains 7077 /7077 variables (removed 0) and now considering 32194/32194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2392 ms. Remains : 7077/7077 places, 32194/32194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7077/7077 places, 32194/32194 transitions.
Applied a total of 0 rules in 2463 ms. Remains 7077 /7077 variables (removed 0) and now considering 32194/32194 (removed 0) transitions.
[2024-05-22 19:25:49] [INFO ] Flow matrix only has 32129 transitions (discarded 65 similar events)
[2024-05-22 19:25:49] [INFO ] Invariant cache hit.
[2024-05-22 19:26:06] [INFO ] Implicit Places using invariants in 17138 ms returned []
Implicit Place search using SMT only with invariants took 17149 ms to find 0 implicit places.
Running 32114 sub problems to find dead transitions.
[2024-05-22 19:26:06] [INFO ] Flow matrix only has 32129 transitions (discarded 65 similar events)
[2024-05-22 19:26:06] [INFO ] Invariant cache hit.
[2024-05-22 19:26:06] [INFO ] State equation strengthened by 30865 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7076 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 32114 unsolved
SMT process timed out in 159818ms, After SMT, problems are : Problem set: 0 solved, 32114 unsolved
Search for dead transitions found 0 dead transitions in 160114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179819 ms. Remains : 7077/7077 places, 32194/32194 transitions.
[2024-05-22 19:28:46] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-22 19:28:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7077 places, 32194 transitions and 127530 arcs took 101 ms.
[2024-05-22 19:28:47] [INFO ] Flatten gal took : 898 ms
Total runtime 504195 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANInsertWithFailure-PT-080

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 7077
TRANSITIONS: 32194
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.650s, Sys 0.051s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.113s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 642
MODEL NAME: /home/mcc/execution/412/model
7077 places, 32194 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CANInsertWithFailure-PT-080"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CANInsertWithFailure-PT-080, 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 r069-tall-171620503900158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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