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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 19:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 19:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:22 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 450K 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-d1m18-ReachabilityFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716892725034

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-d1m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 10:38:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 10:38:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:38:47] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2024-05-28 10:38:47] [INFO ] Transformed 1295 places.
[2024-05-28 10:38:47] [INFO ] Transformed 749 transitions.
[2024-05-28 10:38:47] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 16 ms
Reduce places removed 1036 places and 0 transitions.
RANDOM walk for 40000 steps (8867 resets) in 4308 ms. (9 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (406 resets) in 116 ms. (34 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (196 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (146 resets) in 202 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (172 resets) in 170 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (183 resets) in 215 ms. (18 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (200 resets) in 78 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (193 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (195 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (135 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (389 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (171 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (168 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (163 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (175 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (183 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (194 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 249499 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :4 out of 16
Probabilistic random walk after 249499 steps, saw 113420 distinct states, run finished after 3012 ms. (steps per millisecond=82 ) properties seen :4
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 749 rows 259 cols
[2024-05-28 10:38:52] [INFO ] Computed 6 invariants in 56 ms
[2024-05-28 10:38:52] [INFO ] State equation strengthened by 587 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-13 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 86/189 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-01 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-02 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-03 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-05 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-07 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-08 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-11 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-15 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 70/259 variables, 3/6 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 749/1008 variables, 259/265 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1008 variables, 587/852 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 0/852 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1008 variables, 0/852 constraints. Problems are: Problem set: 9 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 852 constraints, problems are : Problem set: 9 solved, 3 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 259/259 constraints, ReadFeed: 587/587 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 111/141 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/148 variables, 1/3 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 111/259 variables, 3/6 constraints. Problems are: Problem set: 9 solved, 3 unsolved
[2024-05-28 10:38:55] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 52 ms to minimize.
[2024-05-28 10:38:55] [INFO ] Deduced a trap composed of 155 places in 303 ms of which 5 ms to minimize.
[2024-05-28 10:38:55] [INFO ] Deduced a trap composed of 128 places in 253 ms of which 4 ms to minimize.
[2024-05-28 10:38:55] [INFO ] Deduced a trap composed of 59 places in 220 ms of which 4 ms to minimize.
[2024-05-28 10:38:56] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 3 ms to minimize.
[2024-05-28 10:38:56] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 6/12 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 749/1008 variables, 259/271 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 587/858 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1008 variables, 3/861 constraints. Problems are: Problem set: 9 solved, 3 unsolved
[2024-05-28 10:38:58] [INFO ] Deduced a trap composed of 143 places in 170 ms of which 3 ms to minimize.
[2024-05-28 10:38:58] [INFO ] Deduced a trap composed of 170 places in 142 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1008 variables, 2/863 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1008 variables, 0/863 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 863 constraints, problems are : Problem set: 9 solved, 3 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 259/259 constraints, ReadFeed: 587/587 constraints, PredecessorRefiner: 3/12 constraints, Known Traps: 8/8 constraints]
After SMT, in 7287ms problems are : Problem set: 9 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 283 place count 201 transition count 434
Iterating global reduction 1 with 40 rules applied. Total rules applied 323 place count 201 transition count 434
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 332 place count 201 transition count 425
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 351 place count 182 transition count 406
Iterating global reduction 2 with 19 rules applied. Total rules applied 370 place count 182 transition count 406
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 378 place count 182 transition count 398
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 386 place count 174 transition count 389
Iterating global reduction 3 with 8 rules applied. Total rules applied 394 place count 174 transition count 389
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 412 place count 174 transition count 371
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 414 place count 172 transition count 367
Iterating global reduction 4 with 2 rules applied. Total rules applied 416 place count 172 transition count 367
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 418 place count 170 transition count 365
Iterating global reduction 4 with 2 rules applied. Total rules applied 420 place count 170 transition count 365
Applied a total of 420 rules in 158 ms. Remains 170 /259 variables (removed 89) and now considering 365/749 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 170/259 places, 365/749 transitions.
RANDOM walk for 40000 steps (8972 resets) in 298 ms. (133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1900 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (4162 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1932 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 512229 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 3
Probabilistic random walk after 512229 steps, saw 238501 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
// Phase 1: matrix 365 rows 170 cols
[2024-05-28 10:39:03] [INFO ] Computed 4 invariants in 18 ms
[2024-05-28 10:39:03] [INFO ] State equation strengthened by 245 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 81/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/124 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 10:39:03] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-28 10:39:03] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 350/474 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 230/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 61/535 variables, 46/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 15/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/535 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 421 constraints, problems are : Problem set: 0 solved, 3 unsolved in 925 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 170/170 constraints, ReadFeed: 245/245 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 81/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/124 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 350/474 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 230/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 61/535 variables, 46/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 15/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 3/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/535 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 424 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1399 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 170/170 constraints, ReadFeed: 245/245 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 2439ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1812 ms.
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 365/365 transitions.
Applied a total of 0 rules in 41 ms. Remains 170 /170 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 170/170 places, 365/365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 365/365 transitions.
Applied a total of 0 rules in 19 ms. Remains 170 /170 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2024-05-28 10:39:07] [INFO ] Invariant cache hit.
[2024-05-28 10:39:07] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-28 10:39:07] [INFO ] Invariant cache hit.
[2024-05-28 10:39:07] [INFO ] State equation strengthened by 245 read => feed constraints.
[2024-05-28 10:39:09] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 1724 ms to find 0 implicit places.
[2024-05-28 10:39:09] [INFO ] Redundant transitions in 27 ms returned []
Running 364 sub problems to find dead transitions.
[2024-05-28 10:39:09] [INFO ] Invariant cache hit.
[2024-05-28 10:39:09] [INFO ] State equation strengthened by 245 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/535 variables, 170/174 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 245/419 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-28 10:39:30] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/535 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 420 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 170/170 constraints, ReadFeed: 245/245 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (OVERLAPS) 365/535 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 245/420 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 364/784 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-28 10:39:55] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:39:56] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 2/786 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 786 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 170/170 constraints, ReadFeed: 245/245 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 3/3 constraints]
After SMT, in 60991ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60998ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62782 ms. Remains : 170/170 places, 365/365 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 170 transition count 360
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 166 transition count 360
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 9 place count 166 transition count 346
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 37 place count 152 transition count 346
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 65 place count 138 transition count 332
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 138 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 137 transition count 331
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 137 transition count 331
Applied a total of 77 rules in 54 ms. Remains 137 /170 variables (removed 33) and now considering 331/365 (removed 34) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 331 rows 137 cols
[2024-05-28 10:40:10] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 10:40:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 10:40:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 10:40:10] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 10:40:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 10:40:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 10:40:10] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 10:40:10] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 10:40:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-28 10:40:11] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 2 ms to minimize.
[2024-05-28 10:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
TRAPS : Iteration 1
[2024-05-28 10:40:11] [INFO ] After 1215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 10:40:11] [INFO ] After 1567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1753 ms.
[2024-05-28 10:40:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-28 10:40:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 365 transitions and 1444 arcs took 11 ms.
[2024-05-28 10:40:12] [INFO ] Flatten gal took : 128 ms
Total runtime 85395 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d1m18

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 629
MODEL NAME: /home/mcc/execution/414/model
170 places, 365 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.
Building monolithic NSF...
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-04 CANNOT_COMPUTE
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-09 CANNOT_COMPUTE
FORMULA SieveSingleMsgMbox-PT-d1m18-ReachabilityFireability-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716893737731

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

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-d1m18"
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-d1m18, 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-171683809600071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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