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-171620503900143.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-060, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503900143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 09:48 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 22M 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-060-ReachabilityFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-12
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-13
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-14
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716400530187

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-060
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 17:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:55:31] [INFO ] Load time of PNML (sax parser for PT used): 586 ms
[2024-05-22 17:55:32] [INFO ] Transformed 7924 places.
[2024-05-22 17:55:32] [INFO ] Transformed 21960 transitions.
[2024-05-22 17:55:32] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 774 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (25 resets) in 2841 ms. (14 steps per ms) remains 7/16 properties
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 588 ms. (67 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
// Phase 1: matrix 21960 rows 7924 cols
[2024-05-22 17:55:36] [INFO ] Computed 63 invariants in 2399 ms
[2024-05-22 17:55:36] [INFO ] State equation strengthened by 7140 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7720/7855 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7855 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 64/7919 variables, 32/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7919 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/7921 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7921 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 7783ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 135 out of 7924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Graph (complete) has 29701 edges and 7924 vertex of which 7923 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.36 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 377 transitions
Trivial Post-agglo rules discarded 377 transitions
Performed 377 trivial Post agglomeration. Transition count delta: 377
Iterating post reduction 0 with 377 rules applied. Total rules applied 378 place count 7923 transition count 21583
Reduce places removed 377 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 379 rules applied. Total rules applied 757 place count 7546 transition count 21581
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 759 place count 7544 transition count 21581
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 759 place count 7544 transition count 21570
Deduced a syphon composed of 11 places in 8 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 781 place count 7533 transition count 21570
Performed 3473 Post agglomeration using F-continuation condition.Transition count delta: 3473
Deduced a syphon composed of 3473 places in 9 ms
Reduce places removed 3473 places and 0 transitions.
Iterating global reduction 3 with 6946 rules applied. Total rules applied 7727 place count 4060 transition count 18097
Drop transitions (Redundant composition of simpler transitions.) removed 3367 transitions
Redundant transition composition rules discarded 3367 transitions
Iterating global reduction 3 with 3367 rules applied. Total rules applied 11094 place count 4060 transition count 14730
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 11120 place count 4060 transition count 14704
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 11146 place count 4034 transition count 14704
Partial Free-agglomeration rule applied 3689 times.
Drop transitions (Partial Free agglomeration) removed 3689 transitions
Iterating global reduction 4 with 3689 rules applied. Total rules applied 14835 place count 4034 transition count 14704
Partial Free-agglomeration rule applied 653 times.
Drop transitions (Partial Free agglomeration) removed 653 transitions
Iterating global reduction 4 with 653 rules applied. Total rules applied 15488 place count 4034 transition count 14704
Applied a total of 15488 rules in 8090 ms. Remains 4034 /7924 variables (removed 3890) and now considering 14704/21960 (removed 7256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8102 ms. Remains : 4034/7924 places, 14704/21960 transitions.
RANDOM walk for 40000 steps (134 resets) in 1048 ms. (38 steps per ms) remains 4/7 properties
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
// Phase 1: matrix 14704 rows 4034 cols
[2024-05-22 17:55:50] [INFO ] Computed 62 invariants in 588 ms
[2024-05-22 17:55:50] [INFO ] State equation strengthened by 14060 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3835/3962 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3962 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 68/4030 variables, 34/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4030 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/4032 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4032 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 14704/18736 variables, 4032/4094 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18736 variables, 14060/18154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18736 variables, 0/18154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/18738 variables, 2/18156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18738 variables, 0/18156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/18738 variables, 0/18156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18738/18738 variables, and 18156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 23001 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 4034/4034 constraints, ReadFeed: 14060/14060 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3835/3962 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 17:56:14] [INFO ] Deduced a trap composed of 2 places in 295 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3962 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3962 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 68/4030 variables, 34/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4030 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/4032 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4032 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 14704/18736 variables, 4032/4095 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18736 variables, 14060/18155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/18736 variables, 4/18159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18736 variables, 0/18159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/18738 variables, 2/18161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/18738 variables, 0/18161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/18738 variables, 0/18161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18738/18738 variables, and 18161 constraints, problems are : Problem set: 0 solved, 4 unsolved in 31148 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 4034/4034 constraints, ReadFeed: 14060/14060 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 55039ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 773 ms.
Support contains 127 out of 4034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4034/4034 places, 14704/14704 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 4030 transition count 14700
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 4030 transition count 14700
Applied a total of 10 rules in 2131 ms. Remains 4030 /4034 variables (removed 4) and now considering 14700/14704 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2131 ms. Remains : 4030/4034 places, 14700/14704 transitions.
RANDOM walk for 40000 steps (136 resets) in 1054 ms. (37 steps per ms) remains 3/4 properties
FORMULA CANInsertWithFailure-PT-060-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
// Phase 1: matrix 14700 rows 4030 cols
[2024-05-22 17:56:49] [INFO ] Computed 62 invariants in 549 ms
[2024-05-22 17:56:49] [INFO ] State equation strengthened by 14068 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3843/3948 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3948 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/4026 variables, 39/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4026 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/4028 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4028 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 14700/18728 variables, 4028/4090 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18728 variables, 14068/18158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18728 variables, 0/18158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/18730 variables, 2/18160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18730 variables, 0/18160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/18730 variables, 0/18160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18730/18730 variables, and 18160 constraints, problems are : Problem set: 0 solved, 3 unsolved in 16912 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 4030/4030 constraints, ReadFeed: 14068/14068 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3843/3948 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 17:57:06] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 3 ms to minimize.
[2024-05-22 17:57:07] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3948 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3948 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 78/4026 variables, 39/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4026 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/4028 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4028 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 14700/18728 variables, 4028/4092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18728 variables, 14068/18160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/18728 variables, 3/18163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18728 variables, 0/18163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/18730 variables, 2/18165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/18730 variables, 0/18165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/18730 variables, 0/18165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18730/18730 variables, and 18165 constraints, problems are : Problem set: 0 solved, 3 unsolved in 41957 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 4030/4030 constraints, ReadFeed: 14068/14068 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 59623ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1297 ms.
Support contains 105 out of 4030 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4030/4030 places, 14700/14700 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 4020 transition count 14690
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 29 place count 4020 transition count 14690
Applied a total of 29 rules in 2052 ms. Remains 4020 /4030 variables (removed 10) and now considering 14690/14700 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2054 ms. Remains : 4020/4030 places, 14690/14700 transitions.
RANDOM walk for 40000 steps (137 resets) in 1315 ms. (30 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 64704 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 3
Probabilistic random walk after 64704 steps, saw 41220 distinct states, run finished after 3005 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 14690 rows 4020 cols
[2024-05-22 17:57:55] [INFO ] Computed 62 invariants in 557 ms
[2024-05-22 17:57:55] [INFO ] State equation strengthened by 14268 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3833/3938 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3938 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/4016 variables, 39/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4016 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/4018 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4018 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 14690/18708 variables, 4018/4080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18708 variables, 14268/18348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18708 variables, 0/18348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/18710 variables, 2/18350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18710 variables, 0/18350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/18710 variables, 0/18350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18710/18710 variables, and 18350 constraints, problems are : Problem set: 0 solved, 3 unsolved in 21671 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 4020/4020 constraints, ReadFeed: 14268/14268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3833/3938 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 17:58:18] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3938 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3938 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 78/4016 variables, 39/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4016 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/4018 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4018 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 14690/18708 variables, 4018/4081 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18708 variables, 14268/18349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/18708 variables, 3/18352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/18708 variables, 0/18352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/18710 variables, 2/18354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/18710 variables, 0/18354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/18710 variables, 0/18354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18710/18710 variables, and 18354 constraints, problems are : Problem set: 0 solved, 3 unsolved in 44572 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 4020/4020 constraints, ReadFeed: 14268/14268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 66988ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 915 ms.
Support contains 105 out of 4020 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4020/4020 places, 14690/14690 transitions.
Applied a total of 0 rules in 710 ms. Remains 4020 /4020 variables (removed 0) and now considering 14690/14690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 710 ms. Remains : 4020/4020 places, 14690/14690 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4020/4020 places, 14690/14690 transitions.
Applied a total of 0 rules in 721 ms. Remains 4020 /4020 variables (removed 0) and now considering 14690/14690 (removed 0) transitions.
[2024-05-22 17:59:04] [INFO ] Invariant cache hit.
[2024-05-22 17:59:10] [INFO ] Implicit Places using invariants in 5699 ms returned []
Implicit Place search using SMT only with invariants took 5705 ms to find 0 implicit places.
Running 14630 sub problems to find dead transitions.
[2024-05-22 17:59:10] [INFO ] Invariant cache hit.
[2024-05-22 17:59:10] [INFO ] State equation strengthened by 14268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4019 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 14630 unsolved
SMT process timed out in 58804ms, After SMT, problems are : Problem set: 0 solved, 14630 unsolved
Search for dead transitions found 0 dead transitions in 58945ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65413 ms. Remains : 4020/4020 places, 14690/14690 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 13092 edges and 4020 vertex of which 3208 / 4020 are part of one of the 2 SCC in 8 ms
Free SCC test removed 3206 places
Drop transitions (Empty/Sink Transition effects.) removed 8762 transitions
Ensure Unique test removed 3542 transitions
Reduce isomorphic transitions removed 12304 transitions.
Graph (complete) has 2758 edges and 814 vertex of which 691 are kept as prefixes of interest. Removing 123 places using SCC suffix rule.1 ms
Discarding 123 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Drop transitions (Empty/Sink Transition effects.) removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Iterating post reduction 0 with 480 rules applied. Total rules applied 482 place count 691 transition count 1866
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 482 place count 691 transition count 1860
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 494 place count 685 transition count 1860
Discarding 426 places :
Symmetric choice reduction at 1 with 426 rule applications. Total rules 920 place count 259 transition count 1000
Iterating global reduction 1 with 426 rules applied. Total rules applied 1346 place count 259 transition count 1000
Ensure Unique test removed 387 transitions
Reduce isomorphic transitions removed 387 transitions.
Iterating post reduction 1 with 387 rules applied. Total rules applied 1733 place count 259 transition count 613
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1735 place count 258 transition count 612
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 1762 place count 258 transition count 585
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1763 place count 257 transition count 583
Iterating global reduction 2 with 1 rules applied. Total rules applied 1764 place count 257 transition count 583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1765 place count 257 transition count 582
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1773 place count 257 transition count 574
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1782 place count 249 transition count 573
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 1807 place count 249 transition count 573
Partial Post-agglomeration rule applied 36 times.
Drop transitions (Partial Post agglomeration) removed 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 1843 place count 249 transition count 573
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 1879 place count 213 transition count 537
Iterating global reduction 4 with 36 rules applied. Total rules applied 1915 place count 213 transition count 537
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 1945 place count 213 transition count 507
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1965 place count 213 transition count 487
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1966 place count 212 transition count 486
Applied a total of 1966 rules in 1141 ms. Remains 212 /4020 variables (removed 3808) and now considering 486/14690 (removed 14204) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 486 rows 212 cols
[2024-05-22 18:00:10] [INFO ] Computed 20 invariants in 3 ms
[2024-05-22 18:00:10] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-05-22 18:00:10] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 18:00:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-05-22 18:00:10] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 18:00:10] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 18:00:10] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1799 ms.
[2024-05-22 18:00:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-22 18:00:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4020 places, 14690 transitions and 58513 arcs took 63 ms.
[2024-05-22 18:00:11] [INFO ] Flatten gal took : 662 ms
Total runtime 280699 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANInsertWithFailure-PT-060

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: 4020
TRANSITIONS: 14690
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.287s, Sys 0.028s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.047s, 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: 611
MODEL NAME: /home/mcc/execution/412/model
4020 places, 14690 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716401671725

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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-060"
export BK_EXAMINATION="ReachabilityFireability"
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-060, examination is ReachabilityFireability"
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-171620503900143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-060.tgz
mv CANInsertWithFailure-PT-060 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;