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.r135-tall-171631131500623.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 DoubleLock-PT-p2s2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131500623
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K 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 3.2K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 12 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 813K 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 DoubleLock-PT-p2s2-ReachabilityFireability-2024-00
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-01
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-02
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-03
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-04
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-05
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-06
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-07
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2023-08
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-09
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-10
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-11
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-12
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-13
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-14
FORMULA_NAME DoubleLock-PT-p2s2-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716397370165

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:02:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 17:02:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:02:51] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-22 17:02:51] [INFO ] Transformed 184 places.
[2024-05-22 17:02:51] [INFO ] Transformed 1832 transitions.
[2024-05-22 17:02:51] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (406 resets) in 1741 ms. (22 steps per ms) remains 10/15 properties
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (78 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 436 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (67 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (67 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (58 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (67 resets) in 1421 ms. (28 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (76 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (68 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (75 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (77 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
[2024-05-22 17:02:53] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 148 cols
[2024-05-22 17:02:53] [INFO ] Computed 4 invariants in 31 ms
[2024-05-22 17:02:53] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem DoubleLock-PT-p2s2-ReachabilityFireability-2024-01 is UNSAT
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p2s2-ReachabilityFireability-2024-04 is UNSAT
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p2s2-ReachabilityFireability-2024-06 is UNSAT
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p2s2-ReachabilityFireability-2024-07 is UNSAT
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 46/143 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1225/1369 variables, 144/148 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1369 variables, 116/264 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1369 variables, 0/264 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 4/1373 variables, 4/268 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1373 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1373 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1373/1373 variables, and 268 constraints, problems are : Problem set: 4 solved, 6 unsolved in 1223 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 107/131 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-22 17:02:55] [INFO ] Deduced a trap composed of 60 places in 287 ms of which 12 ms to minimize.
[2024-05-22 17:02:55] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 1 ms to minimize.
[2024-05-22 17:02:55] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 1 ms to minimize.
[2024-05-22 17:02:55] [INFO ] Deduced a trap composed of 72 places in 157 ms of which 1 ms to minimize.
[2024-05-22 17:02:55] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 1 ms to minimize.
[2024-05-22 17:02:55] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 1 ms to minimize.
Problem DoubleLock-PT-p2s2-ReachabilityFireability-2023-08 is UNSAT
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2023-08 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-22 17:02:56] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 1 ms to minimize.
[2024-05-22 17:02:56] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 1 ms to minimize.
[2024-05-22 17:02:56] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 1 ms to minimize.
Problem DoubleLock-PT-p2s2-ReachabilityFireability-2024-11 is UNSAT
FORMULA DoubleLock-PT-p2s2-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 9/12 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/132 variables, 1/13 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1219/1351 variables, 132/145 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1351 variables, 111/256 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1351 variables, 0/256 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 22/1373 variables, 16/272 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1373 variables, 5/277 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1373 variables, 4/281 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-05-22 17:02:57] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1373 variables, 1/282 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1373 variables, 0/282 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1373 variables, 0/282 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1373/1373 variables, and 282 constraints, problems are : Problem set: 6 solved, 4 unsolved in 4673 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 10/10 constraints]
After SMT, in 6344ms problems are : Problem set: 6 solved, 4 unsolved
Parikh walk visited 0 properties in 3862 ms.
Support contains 20 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Graph (complete) has 2955 edges and 148 vertex of which 144 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 144 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 143 transition count 1725
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 143 transition count 1725
Applied a total of 14 rules in 107 ms. Remains 143 /148 variables (removed 5) and now considering 1725/1768 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 143/148 places, 1725/1768 transitions.
RANDOM walk for 40015 steps (400 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (79 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (71 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (73 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (77 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 202643 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 4
Probabilistic random walk after 202643 steps, saw 140425 distinct states, run finished after 3012 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-22 17:03:06] [INFO ] Flow matrix only has 1182 transitions (discarded 543 similar events)
// Phase 1: matrix 1182 rows 143 cols
[2024-05-22 17:03:06] [INFO ] Computed 2 invariants in 14 ms
[2024-05-22 17:03:06] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 47/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1026/1101 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1101 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 224/1325 variables, 68/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 74/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1325 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 261 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1560 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 47/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1026/1101 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1101 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 224/1325 variables, 68/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 74/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1325 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1325 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 265 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 6821ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 553 ms.
Support contains 20 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1725/1725 transitions.
Applied a total of 0 rules in 46 ms. Remains 143 /143 variables (removed 0) and now considering 1725/1725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 143/143 places, 1725/1725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1725/1725 transitions.
Applied a total of 0 rules in 38 ms. Remains 143 /143 variables (removed 0) and now considering 1725/1725 (removed 0) transitions.
[2024-05-22 17:03:14] [INFO ] Flow matrix only has 1182 transitions (discarded 543 similar events)
[2024-05-22 17:03:14] [INFO ] Invariant cache hit.
[2024-05-22 17:03:14] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 17:03:14] [INFO ] Flow matrix only has 1182 transitions (discarded 543 similar events)
[2024-05-22 17:03:14] [INFO ] Invariant cache hit.
[2024-05-22 17:03:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-22 17:03:14] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2024-05-22 17:03:14] [INFO ] Redundant transitions in 85 ms returned []
Running 1723 sub problems to find dead transitions.
[2024-05-22 17:03:14] [INFO ] Flow matrix only has 1182 transitions (discarded 543 similar events)
[2024-05-22 17:03:14] [INFO ] Invariant cache hit.
[2024-05-22 17:03:14] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 3 (OVERLAPS) 1182/1325 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1325 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 261 constraints, problems are : Problem set: 0 solved, 1723 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1723/1723 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 3 (OVERLAPS) 1182/1325 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1325 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1325 variables, 1723/1984 constraints. Problems are: Problem set: 0 solved, 1723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1984 constraints, problems are : Problem set: 0 solved, 1723 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1723/1723 constraints, Known Traps: 0/0 constraints]
After SMT, in 62513ms problems are : Problem set: 0 solved, 1723 unsolved
Search for dead transitions found 0 dead transitions in 62529ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63432 ms. Remains : 143/143 places, 1725/1725 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 543 transitions
Reduce isomorphic transitions removed 543 transitions.
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 143 transition count 1182
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 543 place count 143 transition count 1175
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 557 place count 136 transition count 1175
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 561 place count 134 transition count 1173
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 562 place count 134 transition count 1172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 563 place count 133 transition count 1172
Applied a total of 563 rules in 55 ms. Remains 133 /143 variables (removed 10) and now considering 1172/1725 (removed 553) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1172 rows 133 cols
[2024-05-22 17:04:17] [INFO ] Computed 2 invariants in 12 ms
[2024-05-22 17:04:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 17:04:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-22 17:04:17] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 17:04:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:04:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-22 17:04:18] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 17:04:18] [INFO ] After 781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 17:04:19] [INFO ] After 1129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1568 ms.
[2024-05-22 17:04:19] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-22 17:04:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 143 places, 1725 transitions and 6922 arcs took 13 ms.
[2024-05-22 17:04:19] [INFO ] Flatten gal took : 154 ms
Total runtime 88113 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleLock-PT-p2s2

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 143
TRANSITIONS: 1725
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.035s, Sys 0.004s]


SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 606
MODEL NAME: /home/mcc/execution/403/model
143 places, 1725 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716398040302

--------------------
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="DoubleLock-PT-p2s2"
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 DoubleLock-PT-p2s2, 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 r135-tall-171631131500623"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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