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.r355-tall-171683759200631.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 ShieldPPPt-PT-020A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759200631
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K 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 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 134K 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 ShieldPPPt-PT-020A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717013638195

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 20:13:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 20:13:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:13:59] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-29 20:13:59] [INFO ] Transformed 503 places.
[2024-05-29 20:13:59] [INFO ] Transformed 363 transitions.
[2024-05-29 20:13:59] [INFO ] Found NUPN structural information;
[2024-05-29 20:13:59] [INFO ] Parsed PT model containing 503 places and 363 transitions and 1446 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 1895 ms. (21 steps per ms) remains 7/16 properties
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 786 ms. (50 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 7/7 properties
// Phase 1: matrix 362 rows 503 cols
[2024-05-29 20:14:01] [INFO ] Computed 221 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 151/337 variables, 147/333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 151/484 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 166/503 variables, 74/558 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 166/724 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/865 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1227 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1089 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem ShieldPPPt-PT-020A-ReachabilityFireability-2024-05 is UNSAT
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 151/337 variables, 147/333 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 151/484 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/484 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 166/503 variables, 74/558 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 166/724 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 6/1233 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/865 variables, 0/1233 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/865 variables, 0/1233 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1233 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2302 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 3523ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 10904 ms.
Support contains 127 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 362/362 transitions.
Partial Free-agglomeration rule applied 48 times.
Drop transitions (Partial Free agglomeration) removed 48 transitions
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 503 transition count 362
Applied a total of 48 rules in 97 ms. Remains 503 /503 variables (removed 0) and now considering 362/362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 503/503 places, 362/362 transitions.
RANDOM walk for 40000 steps (8 resets) in 612 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 261766 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :1 out of 3
Probabilistic random walk after 261766 steps, saw 255858 distinct states, run finished after 3010 ms. (steps per millisecond=86 ) properties seen :1
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 362 rows 503 cols
[2024-05-29 20:14:19] [INFO ] Computed 221 invariants in 10 ms
[2024-05-29 20:14:19] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 122/222 variables, 95/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 122/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 281/503 variables, 126/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 281/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 12/1239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/865 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/865 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 865/865 variables, and 1239 constraints, problems are : Problem set: 0 solved, 2 unsolved in 387 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 122/222 variables, 95/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 122/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 281/503 variables, 126/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 281/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 362/865 variables, 503/1227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 12/1239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/865 variables, 2/1241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/865 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/865 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 865/865 variables, and 1241 constraints, problems are : Problem set: 0 solved, 2 unsolved in 986 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 503/503 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1419ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1565 ms.
Support contains 100 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 362/362 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 361
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 502 transition count 361
Applied a total of 8 rules in 56 ms. Remains 502 /503 variables (removed 1) and now considering 361/362 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 502/503 places, 361/362 transitions.
RANDOM walk for 40000 steps (8 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 252601 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 252601 steps, saw 245128 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
// Phase 1: matrix 361 rows 502 cols
[2024-05-29 20:14:25] [INFO ] Computed 221 invariants in 6 ms
[2024-05-29 20:14:25] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 122/222 variables, 95/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 122/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 280/502 variables, 126/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 280/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 361/863 variables, 502/1225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/863 variables, 18/1243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/863 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/863 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 863/863 variables, and 1243 constraints, problems are : Problem set: 0 solved, 2 unsolved in 378 ms.
Refiners :[Domain max(s): 502/502 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 502/502 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 122/222 variables, 95/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 122/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 280/502 variables, 126/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 280/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 361/863 variables, 502/1225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/863 variables, 18/1243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/863 variables, 2/1245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 20:14:26] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/863 variables, 1/1246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/863 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/863 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 863/863 variables, and 1246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1106 ms.
Refiners :[Domain max(s): 502/502 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 502/502 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1514ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1624 ms.
Support contains 100 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 361/361 transitions.
Applied a total of 0 rules in 19 ms. Remains 502 /502 variables (removed 0) and now considering 361/361 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 502/502 places, 361/361 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 361/361 transitions.
Applied a total of 0 rules in 21 ms. Remains 502 /502 variables (removed 0) and now considering 361/361 (removed 0) transitions.
[2024-05-29 20:14:28] [INFO ] Invariant cache hit.
[2024-05-29 20:14:29] [INFO ] Implicit Places using invariants in 305 ms returned [495]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 313 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 501/502 places, 361/361 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 501 transition count 359
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 499 transition count 359
Applied a total of 4 rules in 27 ms. Remains 499 /501 variables (removed 2) and now considering 359/361 (removed 2) transitions.
// Phase 1: matrix 359 rows 499 cols
[2024-05-29 20:14:29] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 20:14:29] [INFO ] Implicit Places using invariants in 277 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 279 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 497/502 places, 359/361 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 495 transition count 357
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 495 transition count 357
Applied a total of 4 rules in 53 ms. Remains 495 /497 variables (removed 2) and now considering 357/359 (removed 2) transitions.
// Phase 1: matrix 357 rows 495 cols
[2024-05-29 20:14:29] [INFO ] Computed 218 invariants in 3 ms
[2024-05-29 20:14:29] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-29 20:14:29] [INFO ] Invariant cache hit.
[2024-05-29 20:14:29] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 20:14:30] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 495/502 places, 357/361 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1384 ms. Remains : 495/502 places, 357/361 transitions.
RANDOM walk for 40000 steps (8 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 313319 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 313319 steps, saw 303439 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-29 20:14:33] [INFO ] Invariant cache hit.
[2024-05-29 20:14:33] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/222 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 273/495 variables, 123/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 357/852 variables, 495/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 16/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/852 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 729 constraints, problems are : Problem set: 0 solved, 2 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 495/495 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/222 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 273/495 variables, 123/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 357/852 variables, 495/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 16/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 20:14:34] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/852 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 852/852 variables, and 732 constraints, problems are : Problem set: 0 solved, 2 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 495/495 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1302ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 827 ms.
Support contains 59 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 357/357 transitions.
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 495 transition count 357
Applied a total of 9 rules in 36 ms. Remains 495 /495 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 495/495 places, 357/357 transitions.
RANDOM walk for 40000 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 503403 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 503403 steps, saw 484759 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
// Phase 1: matrix 357 rows 495 cols
[2024-05-29 20:14:38] [INFO ] Computed 218 invariants in 5 ms
[2024-05-29 20:14:38] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/149 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 346/495 variables, 156/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 357/852 variables, 495/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 17/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/852 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 730 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 495/495 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/149 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 346/495 variables, 156/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 357/852 variables, 495/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 17/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/852 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 852/852 variables, and 731 constraints, problems are : Problem set: 0 solved, 1 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 495/495 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 772ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 540 ms.
Support contains 59 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 357/357 transitions.
Applied a total of 0 rules in 18 ms. Remains 495 /495 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 495/495 places, 357/357 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 357/357 transitions.
Applied a total of 0 rules in 19 ms. Remains 495 /495 variables (removed 0) and now considering 357/357 (removed 0) transitions.
[2024-05-29 20:14:39] [INFO ] Invariant cache hit.
[2024-05-29 20:14:40] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-29 20:14:40] [INFO ] Invariant cache hit.
[2024-05-29 20:14:40] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-29 20:14:40] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2024-05-29 20:14:40] [INFO ] Redundant transitions in 22 ms returned []
Running 356 sub problems to find dead transitions.
[2024-05-29 20:14:40] [INFO ] Invariant cache hit.
[2024-05-29 20:14:40] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-29 20:14:46] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:14:46] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:14:46] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:14:46] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:14:47] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:14:47] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:14:47] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:14:47] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:14:47] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:14:47] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 10/228 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (OVERLAPS) 357/852 variables, 495/723 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/852 variables, 17/740 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 0/852 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 740 constraints, problems are : Problem set: 0 solved, 356 unsolved in 25235 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 495/495 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 10/228 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (OVERLAPS) 357/852 variables, 495/723 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/852 variables, 17/740 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 356/1096 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-29 20:15:19] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-29 20:15:20] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-05-29 20:15:20] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-29 20:15:20] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-29 20:15:20] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 5/1101 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/852 variables, and 1102 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 495/495 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 16/16 constraints]
After SMT, in 55343ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 55348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56092 ms. Remains : 495/495 places, 357/357 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 495 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 495 transition count 340
Applied a total of 34 rules in 31 ms. Remains 495 /495 variables (removed 0) and now considering 340/357 (removed 17) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 340 rows 495 cols
[2024-05-29 20:15:36] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 20:15:36] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:15:36] [INFO ] [Nat]Absence check using 218 positive place invariants in 27 ms returned sat
[2024-05-29 20:15:36] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-29 20:15:36] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:15:36] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 661 ms.
[2024-05-29 20:15:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-29 20:15:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 495 places, 357 transitions and 1589 arcs took 5 ms.
[2024-05-29 20:15:36] [INFO ] Flatten gal took : 77 ms
Total runtime 97565 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPt-PT-020A

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 673
MODEL NAME: /home/mcc/execution/412/model
495 places, 357 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...

BK_TIME_CONFINEMENT_REACHED

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

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

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="ShieldPPPt-PT-020A"
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 ShieldPPPt-PT-020A, 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 r355-tall-171683759200631"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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