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.r377-smll-171683809700119.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 SieveSingleMsgMbox-PT-d2m18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809700119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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 SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716916736787

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 17:18:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 17:18:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:19:00] [INFO ] Load time of PNML (sax parser for PT used): 636 ms
[2024-05-28 17:19:00] [INFO ] Transformed 2398 places.
[2024-05-28 17:19:00] [INFO ] Transformed 1954 transitions.
[2024-05-28 17:19:00] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 922 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 33 ms
Reduce places removed 1984 places and 0 transitions.
RANDOM walk for 40000 steps (8780 resets) in 3951 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (183 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (183 resets) in 81 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (184 resets) in 61 ms. (64 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (156 resets) in 136 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (181 resets) in 107 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (184 resets) in 87 ms. (45 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (181 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (182 resets) in 93 ms. (42 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (386 resets) in 71 ms. (55 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (176 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (159 resets) in 84 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (176 resets) in 73 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (168 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (155 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (182 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (171 resets) in 55 ms. (71 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 175847 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :6 out of 16
Probabilistic random walk after 175847 steps, saw 79738 distinct states, run finished after 3008 ms. (steps per millisecond=58 ) properties seen :6
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1954 rows 414 cols
[2024-05-28 17:19:05] [INFO ] Computed 6 invariants in 65 ms
[2024-05-28 17:19:05] [INFO ] State equation strengthened by 1674 read => feed constraints.
Problem SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-10 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 133/220 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 43/263 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-00 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-12 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-13 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m18-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 151/414 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1954/2368 variables, 414/420 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2368 variables, 1674/2094 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2368 variables, 0/2094 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/2368 variables, 0/2094 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2368/2368 variables, and 2094 constraints, problems are : Problem set: 4 solved, 6 unsolved in 4869 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 1674/1674 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 139/209 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 43/252 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 162/414 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-28 17:19:11] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 46 ms to minimize.
[2024-05-28 17:19:12] [INFO ] Deduced a trap composed of 137 places in 381 ms of which 5 ms to minimize.
[2024-05-28 17:19:12] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:19:12] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 6 ms to minimize.
[2024-05-28 17:19:12] [INFO ] Deduced a trap composed of 144 places in 233 ms of which 5 ms to minimize.
[2024-05-28 17:19:13] [INFO ] Deduced a trap composed of 138 places in 235 ms of which 6 ms to minimize.
[2024-05-28 17:19:13] [INFO ] Deduced a trap composed of 43 places in 683 ms of which 7 ms to minimize.
[2024-05-28 17:19:14] [INFO ] Deduced a trap composed of 40 places in 711 ms of which 7 ms to minimize.
[2024-05-28 17:19:15] [INFO ] Deduced a trap composed of 40 places in 657 ms of which 6 ms to minimize.
[2024-05-28 17:19:15] [INFO ] Deduced a trap composed of 40 places in 679 ms of which 6 ms to minimize.
[2024-05-28 17:19:16] [INFO ] Deduced a trap composed of 40 places in 699 ms of which 7 ms to minimize.
SMT process timed out in 11485ms, After SMT, problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.13 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 901 place count 318 transition count 985
Iterating global reduction 1 with 70 rules applied. Total rules applied 971 place count 318 transition count 985
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 980 place count 318 transition count 976
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 1018 place count 280 transition count 938
Iterating global reduction 2 with 38 rules applied. Total rules applied 1056 place count 280 transition count 938
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 1080 place count 280 transition count 914
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1100 place count 260 transition count 892
Iterating global reduction 3 with 20 rules applied. Total rules applied 1120 place count 260 transition count 892
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 1160 place count 260 transition count 852
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1162 place count 258 transition count 850
Iterating global reduction 4 with 2 rules applied. Total rules applied 1164 place count 258 transition count 850
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1166 place count 256 transition count 848
Iterating global reduction 4 with 2 rules applied. Total rules applied 1168 place count 256 transition count 848
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1169 place count 255 transition count 846
Iterating global reduction 4 with 1 rules applied. Total rules applied 1170 place count 255 transition count 846
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1171 place count 254 transition count 845
Iterating global reduction 4 with 1 rules applied. Total rules applied 1172 place count 254 transition count 845
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1173 place count 253 transition count 844
Iterating global reduction 4 with 1 rules applied. Total rules applied 1174 place count 253 transition count 844
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1175 place count 252 transition count 843
Iterating global reduction 4 with 1 rules applied. Total rules applied 1176 place count 252 transition count 843
Applied a total of 1176 rules in 543 ms. Remains 252 /414 variables (removed 162) and now considering 843/1954 (removed 1111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 564 ms. Remains : 252/414 places, 843/1954 transitions.
RANDOM walk for 40000 steps (8966 resets) in 956 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1895 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1876 resets) in 361 ms. (110 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3987 resets) in 345 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1862 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1866 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1858 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 305736 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 6
Probabilistic random walk after 305736 steps, saw 145052 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
// Phase 1: matrix 843 rows 252 cols
[2024-05-28 17:19:21] [INFO ] Computed 4 invariants in 6 ms
[2024-05-28 17:19:21] [INFO ] State equation strengthened by 656 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 78/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 18/180 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 823/1003 variables, 180/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 636/820 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1003 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 92/1095 variables, 72/892 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1095 variables, 20/912 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1095 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1095 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1095/1095 variables, and 912 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 252/252 constraints, ReadFeed: 656/656 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 78/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 18/180 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 823/1003 variables, 180/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 636/820 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1003 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 92/1095 variables, 72/892 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1095 variables, 20/912 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1095 variables, 6/918 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 17:19:32] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-28 17:19:32] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1095 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1095 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1095 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 920 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12606 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 252/252 constraints, ReadFeed: 656/656 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 14901ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 16008 ms.
Support contains 70 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 843/843 transitions.
Applied a total of 0 rules in 74 ms. Remains 252 /252 variables (removed 0) and now considering 843/843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 252/252 places, 843/843 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 843/843 transitions.
Applied a total of 0 rules in 101 ms. Remains 252 /252 variables (removed 0) and now considering 843/843 (removed 0) transitions.
[2024-05-28 17:19:52] [INFO ] Invariant cache hit.
[2024-05-28 17:19:52] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-28 17:19:52] [INFO ] Invariant cache hit.
[2024-05-28 17:19:52] [INFO ] State equation strengthened by 656 read => feed constraints.
[2024-05-28 17:19:55] [INFO ] Implicit Places using invariants and state equation in 2850 ms returned []
Implicit Place search using SMT with State Equation took 3042 ms to find 0 implicit places.
[2024-05-28 17:19:55] [INFO ] Redundant transitions in 93 ms returned []
Running 842 sub problems to find dead transitions.
[2024-05-28 17:19:55] [INFO ] Invariant cache hit.
[2024-05-28 17:19:55] [INFO ] State equation strengthened by 656 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 3 (OVERLAPS) 1/252 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 842 unsolved
[2024-05-28 17:20:21] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 842 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 252/1095 variables, and 5 constraints, problems are : Problem set: 0 solved, 842 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/252 constraints, ReadFeed: 0/656 constraints, PredecessorRefiner: 842/842 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 842 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 3 (OVERLAPS) 1/252 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 6 (OVERLAPS) 843/1095 variables, 252/257 constraints. Problems are: Problem set: 0 solved, 842 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1095 variables, 656/913 constraints. Problems are: Problem set: 0 solved, 842 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1755 constraints, problems are : Problem set: 0 solved, 842 unsolved in 30554 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 252/252 constraints, ReadFeed: 656/656 constraints, PredecessorRefiner: 842/842 constraints, Known Traps: 1/1 constraints]
After SMT, in 63831ms problems are : Problem set: 0 solved, 842 unsolved
Search for dead transitions found 0 dead transitions in 63855ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67115 ms. Remains : 252/252 places, 843/843 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 252 transition count 838
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 248 transition count 838
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 9 place count 248 transition count 826
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 33 place count 236 transition count 826
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 61 place count 222 transition count 812
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 221 transition count 825
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 221 transition count 820
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 221 transition count 816
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 77 place count 217 transition count 815
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 217 transition count 815
Applied a total of 80 rules in 188 ms. Remains 217 /252 variables (removed 35) and now considering 815/843 (removed 28) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 815 rows 217 cols
[2024-05-28 17:20:59] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 17:20:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:20:59] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-28 17:20:59] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-28 17:20:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 17:20:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-28 17:21:01] [INFO ] After 1309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-28 17:21:01] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-05-28 17:21:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-05-28 17:21:02] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 2 ms to minimize.
[2024-05-28 17:21:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
TRAPS : Iteration 1
[2024-05-28 17:21:03] [INFO ] After 4097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-28 17:21:05] [INFO ] After 5603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 6076 ms.
[2024-05-28 17:21:05] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-28 17:21:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 252 places, 843 transitions and 3337 arcs took 17 ms.
[2024-05-28 17:21:05] [INFO ] Flatten gal took : 207 ms
Total runtime 126582 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d2m18

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 252
TRANSITIONS: 843
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.041s, Sys 0.000s]


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


----------------------------------------------------------------------
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: 636
MODEL NAME: /home/mcc/execution/413/model
252 places, 843 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 1716917979293

--------------------
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

Error in allocating array of size 16777216 at unique_table.cc, line 313
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="SieveSingleMsgMbox-PT-d2m18"
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 SieveSingleMsgMbox-PT-d2m18, 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 r377-smll-171683809700119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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