fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r267-smll-171654405700103
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Parking-PT-864

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
977.888 36905.00 71619.00 168.80 TTTTTTTFTTTTTTFT normal

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.r267-smll-171654405700103.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 Parking-PT-864, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405700103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 20:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 19:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 427K 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 Parking-PT-864-ReachabilityFireability-2024-00
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-01
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-02
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-03
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-04
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-05
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-06
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-07
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-08
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-09
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-10
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-11
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-12
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-13
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-14
FORMULA_NAME Parking-PT-864-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716664390429

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 19:13:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 19:13:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:13:12] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2024-05-25 19:13:12] [INFO ] Transformed 1185 places.
[2024-05-25 19:13:12] [INFO ] Transformed 1697 transitions.
[2024-05-25 19:13:12] [INFO ] Found NUPN structural information;
[2024-05-25 19:13:12] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
RANDOM walk for 40000 steps (158 resets) in 3883 ms. (10 steps per ms) remains 9/16 properties
FORMULA Parking-PT-864-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 721 ms. (55 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 879 ms. (45 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 920 ms. (43 steps per ms) remains 8/9 properties
FORMULA Parking-PT-864-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 8/8 properties
// Phase 1: matrix 1009 rows 1185 cols
[2024-05-25 19:13:15] [INFO ] Computed 280 invariants in 50 ms
[2024-05-25 19:13:15] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 611/802 variables, 132/323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/802 variables, 611/934 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/802 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 338/1140 variables, 140/1074 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1140 variables, 338/1412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1140 variables, 0/1412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 45/1185 variables, 8/1420 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1185 variables, 45/1465 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1185 variables, 0/1465 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1009/2194 variables, 1185/2650 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2194 variables, 248/2898 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2194 variables, 0/2898 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/2194 variables, 0/2898 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2194/2194 variables, and 2898 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4121 ms.
Refiners :[Domain max(s): 1185/1185 constraints, Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1185/1185 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 191/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 611/802 variables, 132/323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/802 variables, 611/934 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/802 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 338/1140 variables, 140/1074 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1140 variables, 338/1412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1140 variables, 0/1412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 45/1185 variables, 8/1420 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1185 variables, 45/1465 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-25 19:13:21] [INFO ] Deduced a trap composed of 68 places in 202 ms of which 40 ms to minimize.
[2024-05-25 19:13:21] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-25 19:13:21] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-25 19:13:21] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1185 variables, 4/1469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1185 variables, 0/1469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1009/2194 variables, 1185/2654 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2194 variables, 248/2902 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2194 variables, 8/2910 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-25 19:13:24] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2024-05-25 19:13:24] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2194/2194 variables, and 2912 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5008 ms.
Refiners :[Domain max(s): 1185/1185 constraints, Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1185/1185 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 9401ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 191 out of 1185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1185 transition count 1002
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 1178 transition count 1001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 1177 transition count 1001
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 1177 transition count 994
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 1170 transition count 994
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 35 place count 1165 transition count 989
Iterating global reduction 3 with 5 rules applied. Total rules applied 40 place count 1165 transition count 989
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 74 place count 1148 transition count 972
Free-agglomeration rule applied 126 times.
Iterating global reduction 3 with 126 rules applied. Total rules applied 200 place count 1148 transition count 846
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 3 with 126 rules applied. Total rules applied 326 place count 1022 transition count 846
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 1022 transition count 846
Applied a total of 327 rules in 677 ms. Remains 1022 /1185 variables (removed 163) and now considering 846/1009 (removed 163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 693 ms. Remains : 1022/1185 places, 846/1009 transitions.
RANDOM walk for 40000 steps (236 resets) in 878 ms. (45 steps per ms) remains 7/8 properties
FORMULA Parking-PT-864-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 507 ms. (78 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 350 ms. (113 steps per ms) remains 7/7 properties
// Phase 1: matrix 846 rows 1022 cols
[2024-05-25 19:13:26] [INFO ] Computed 280 invariants in 21 ms
[2024-05-25 19:13:26] [INFO ] State equation strengthened by 395 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 595/778 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/778 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 199/977 variables, 142/272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/977 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 45/1022 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1022 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 846/1868 variables, 1022/1302 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1868 variables, 395/1697 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1868 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1868 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1868/1868 variables, and 1697 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2292 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1022/1022 constraints, ReadFeed: 395/395 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/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 595/778 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/778 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 199/977 variables, 142/272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/977 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 45/1022 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-25 19:13:29] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1022 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-25 19:13:30] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
[2024-05-25 19:13:30] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1022 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1022 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 846/1868 variables, 1022/1305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1868 variables, 395/1700 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1868 variables, 7/1707 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-25 19:13:32] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1868 variables, 1/1708 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-25 19:13:32] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1868 variables, 1/1709 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1868 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1868/1868 variables, and 1709 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6296 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1022/1022 constraints, ReadFeed: 395/395 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 8732ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA Parking-PT-864-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 3439 ms.
Support contains 45 out of 1022 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1022/1022 places, 846/846 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1022 transition count 827
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1003 transition count 827
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 38 place count 1003 transition count 807
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 78 place count 983 transition count 807
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 981 transition count 805
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 981 transition count 805
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 110 place count 967 transition count 791
Free-agglomeration rule applied 48 times.
Iterating global reduction 2 with 48 rules applied. Total rules applied 158 place count 967 transition count 743
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 206 place count 919 transition count 743
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 919 transition count 741
Applied a total of 208 rules in 252 ms. Remains 919 /1022 variables (removed 103) and now considering 741/846 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 919/1022 places, 741/846 transitions.
RANDOM walk for 40000 steps (136 resets) in 573 ms. (69 steps per ms) remains 2/3 properties
FORMULA Parking-PT-864-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
// Phase 1: matrix 741 rows 919 cols
[2024-05-25 19:13:39] [INFO ] Computed 280 invariants in 18 ms
[2024-05-25 19:13:39] [INFO ] State equation strengthened by 477 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 260/303 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 568/871 variables, 230/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 48/919 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/919 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 741/1660 variables, 919/1199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1660 variables, 477/1676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1660 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1660 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1660/1660 variables, and 1676 constraints, problems are : Problem set: 0 solved, 2 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 919/919 constraints, ReadFeed: 477/477 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/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 260/303 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 568/871 variables, 230/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 48/919 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/919 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 741/1660 variables, 919/1199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1660 variables, 477/1676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1660 variables, 2/1678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1660 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1660 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1660/1660 variables, and 1678 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 919/919 constraints, ReadFeed: 477/477 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2317ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA Parking-PT-864-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 260 ms.
Support contains 41 out of 919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 741/741 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 919 transition count 739
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 917 transition count 739
Applied a total of 4 rules in 73 ms. Remains 917 /919 variables (removed 2) and now considering 739/741 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 917/919 places, 739/741 transitions.
RANDOM walk for 40000 steps (131 resets) in 505 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 575 ms. (69 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 229477 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 229477 steps, saw 193445 distinct states, run finished after 3007 ms. (steps per millisecond=76 ) properties seen :0
// Phase 1: matrix 739 rows 917 cols
[2024-05-25 19:13:45] [INFO ] Computed 280 invariants in 10 ms
[2024-05-25 19:13:45] [INFO ] State equation strengthened by 479 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 228/269 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 600/869 variables, 232/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/917 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/917 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 739/1656 variables, 917/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1656 variables, 479/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1656 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1656 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1656/1656 variables, and 1676 constraints, problems are : Problem set: 0 solved, 1 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 917/917 constraints, ReadFeed: 479/479 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 228/269 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 600/869 variables, 232/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/917 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/917 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 739/1656 variables, 917/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1656 variables, 479/1676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1656 variables, 1/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1656 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1656 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1656/1656 variables, and 1677 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 272/272 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 917/917 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1837ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2584 steps, including 30 resets, run visited all 1 properties in 23 ms. (steps per millisecond=112 )
FORMULA Parking-PT-864-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 38 ms.
All properties solved without resorting to model-checking.
Total runtime 35198 ms.
ITS solved all properties within timeout

BK_STOP 1716664427334

--------------------
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="Parking-PT-864"
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 Parking-PT-864, 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 r267-smll-171654405700103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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