fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r355-tall-171683759200618
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ShieldPPPt-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11487.327 3600000.00 12106403.00 6093.40 [undef] Time out reached

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-171683759200618.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-010B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759200618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:35 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 12K Apr 11 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 11 14:33 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 185K 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-010B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-010B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717010016068

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:13:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:13:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:13:37] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-29 19:13:37] [INFO ] Transformed 783 places.
[2024-05-29 19:13:37] [INFO ] Transformed 713 transitions.
[2024-05-29 19:13:37] [INFO ] Found NUPN structural information;
[2024-05-29 19:13:37] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 111 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 713/713 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 695 transition count 625
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 695 transition count 625
Applied a total of 176 rules in 129 ms. Remains 695 /783 variables (removed 88) and now considering 625/713 (removed 88) transitions.
// Phase 1: matrix 625 rows 695 cols
[2024-05-29 19:13:37] [INFO ] Computed 111 invariants in 23 ms
[2024-05-29 19:13:38] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-29 19:13:38] [INFO ] Invariant cache hit.
[2024-05-29 19:13:38] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
Running 624 sub problems to find dead transitions.
[2024-05-29 19:13:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/694 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/695 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 19:13:52] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 11 ms to minimize.
[2024-05-29 19:13:52] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-05-29 19:13:52] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:13:52] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:13:52] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:13:52] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:13:52] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:13:52] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:13:52] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:13:53] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 4 ms to minimize.
[2024-05-29 19:13:53] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:13:53] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:13:53] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:13:53] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:13:53] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:13:53] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:13:54] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 6 ms to minimize.
[2024-05-29 19:13:54] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 4 ms to minimize.
[2024-05-29 19:13:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:13:54] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/695 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 19:13:56] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:13:56] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:13:56] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:13:56] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:13:56] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:13:56] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 4 ms to minimize.
[2024-05-29 19:13:56] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:13:57] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:13:57] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:13:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:13:57] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:13:57] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:13:57] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 3 ms to minimize.
[2024-05-29 19:13:58] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:13:58] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:13:58] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:13:58] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:13:58] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:13:58] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:13:58] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 19:14:07] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:14:07] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:14:07] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:14:07] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-29 19:14:07] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:14:08] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:14:08] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:14:08] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:14:08] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:14:08] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:14:08] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-29 19:14:08] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:14:09] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:14:09] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 695/1320 variables, and 165 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/695 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 624 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/694 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/695 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/695 variables, 54/165 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 19:14:18] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:14:19] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 5 ms to minimize.
[2024-05-29 19:14:19] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:14:19] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:14:19] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:14:19] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:14:19] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:14:19] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:14:19] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:14:19] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:14:19] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:14:20] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:14:20] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-29 19:14:20] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:14:20] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:14:20] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:14:20] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:14:20] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:14:20] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:14:21] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 19:14:26] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:14:26] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:14:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:14:26] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:14:26] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:14:26] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:14:26] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:14:27] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:14:27] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:14:27] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:14:27] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:14:27] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:14:27] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:14:27] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 14/199 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 19:14:29] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:14:32] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:14:34] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:14:34] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:14:35] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/1320 variables, and 204 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/695 constraints, PredecessorRefiner: 0/624 constraints, Known Traps: 93/93 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 624 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Starting structural reductions in LTL mode, iteration 1 : 695/783 places, 625/713 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61500 ms. Remains : 695/783 places, 625/713 transitions.
Support contains 111 out of 695 places after structural reductions.
[2024-05-29 19:14:39] [INFO ] Flatten gal took : 70 ms
[2024-05-29 19:14:39] [INFO ] Flatten gal took : 32 ms
[2024-05-29 19:14:39] [INFO ] Input system was already deterministic with 625 transitions.
Support contains 110 out of 695 places (down from 111) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1543 ms. (25 steps per ms) remains 7/75 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
[2024-05-29 19:14:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 185/205 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 490/695 variables, 90/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 625/1320 variables, 695/806 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1320 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1320 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 806 constraints, problems are : Problem set: 0 solved, 6 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 695/695 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 185/205 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:14:41] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 490/695 variables, 90/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:14:41] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:14:41] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-29 19:14:41] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-29 19:14:41] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:14:41] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:14:41] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:14:41] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:14:41] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:14:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:14:41] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 10/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 625/1320 variables, 695/817 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1320 variables, 6/823 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:14:42] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-29 19:14:42] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-29 19:14:42] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-29 19:14:42] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-29 19:14:42] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-29 19:14:42] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-29 19:14:43] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:14:43] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:14:43] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 3 ms to minimize.
[2024-05-29 19:14:43] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:14:43] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1320 variables, 11/834 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:14:43] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:14:43] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:14:43] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:14:44] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 4/838 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1320 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 838 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3401 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 695/695 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 26/26 constraints]
After SMT, in 4046ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 5 properties in 1390 ms.
Support contains 3 out of 695 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 695/695 places, 625/625 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 695 transition count 477
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 150 rules applied. Total rules applied 298 place count 547 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 299 place count 546 transition count 475
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 299 place count 546 transition count 407
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 435 place count 478 transition count 407
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 454 place count 459 transition count 388
Iterating global reduction 3 with 19 rules applied. Total rules applied 473 place count 459 transition count 388
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 473 place count 459 transition count 375
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 499 place count 446 transition count 375
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 163
Deduced a syphon composed of 163 places in 1 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 3 with 326 rules applied. Total rules applied 825 place count 283 transition count 212
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 883 place count 254 transition count 212
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 912 place count 254 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 913 place count 253 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 914 place count 252 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 914 place count 252 transition count 209
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 918 place count 250 transition count 209
Applied a total of 918 rules in 133 ms. Remains 250 /695 variables (removed 445) and now considering 209/625 (removed 416) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 250/695 places, 209/625 transitions.
RANDOM walk for 10181 steps (1 resets) in 423 ms. (24 steps per ms) remains 0/1 properties
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 28 ms
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:14:46] [INFO ] Input system was already deterministic with 625 transitions.
Computed a total of 169 stabilizing places and 169 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 694 transition count 478
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 148 rules applied. Total rules applied 294 place count 548 transition count 476
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 296 place count 547 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 297 place count 546 transition count 475
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 297 place count 546 transition count 405
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 437 place count 476 transition count 405
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 456 place count 457 transition count 386
Iterating global reduction 4 with 19 rules applied. Total rules applied 475 place count 457 transition count 386
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 475 place count 457 transition count 374
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 499 place count 445 transition count 374
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 4 with 300 rules applied. Total rules applied 799 place count 295 transition count 224
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 801 place count 293 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 802 place count 292 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 802 place count 292 transition count 220
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 806 place count 290 transition count 220
Applied a total of 806 rules in 96 ms. Remains 290 /695 variables (removed 405) and now considering 220/625 (removed 405) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 97 ms. Remains : 290/695 places, 220/625 transitions.
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:14:46] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 674 transition count 604
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 674 transition count 604
Applied a total of 42 rules in 47 ms. Remains 674 /695 variables (removed 21) and now considering 604/625 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 674/695 places, 604/625 transitions.
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:14:46] [INFO ] Input system was already deterministic with 604 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 673 transition count 603
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 672 transition count 602
Applied a total of 46 rules in 35 ms. Remains 672 /695 variables (removed 23) and now considering 602/625 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 672/695 places, 602/625 transitions.
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:14:46] [INFO ] Input system was already deterministic with 602 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 672 transition count 602
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 671 transition count 601
Applied a total of 48 rules in 41 ms. Remains 671 /695 variables (removed 24) and now considering 601/625 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 671/695 places, 601/625 transitions.
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:14:46] [INFO ] Input system was already deterministic with 601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 674 transition count 604
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 674 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 673 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 673 transition count 603
Applied a total of 44 rules in 38 ms. Remains 673 /695 variables (removed 22) and now considering 603/625 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 673/695 places, 603/625 transitions.
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:14:46] [INFO ] Input system was already deterministic with 603 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 675 transition count 605
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 675 transition count 605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 674 transition count 604
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 674 transition count 604
Applied a total of 42 rules in 38 ms. Remains 674 /695 variables (removed 21) and now considering 604/625 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 674/695 places, 604/625 transitions.
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:14:46] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:14:46] [INFO ] Input system was already deterministic with 604 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 673 transition count 603
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 672 transition count 602
Applied a total of 46 rules in 34 ms. Remains 672 /695 variables (removed 23) and now considering 602/625 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 672/695 places, 602/625 transitions.
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:14:47] [INFO ] Input system was already deterministic with 602 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 694 transition count 476
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 150 rules applied. Total rules applied 298 place count 546 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 299 place count 545 transition count 474
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 299 place count 545 transition count 406
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 435 place count 477 transition count 406
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 453 place count 459 transition count 388
Iterating global reduction 3 with 18 rules applied. Total rules applied 471 place count 459 transition count 388
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 471 place count 459 transition count 375
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 497 place count 446 transition count 375
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 801 place count 294 transition count 223
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 803 place count 292 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 804 place count 291 transition count 221
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 804 place count 291 transition count 219
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 808 place count 289 transition count 219
Applied a total of 808 rules in 58 ms. Remains 289 /695 variables (removed 406) and now considering 219/625 (removed 406) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 289/695 places, 219/625 transitions.
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:14:47] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 674 transition count 604
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 674 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 673 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 673 transition count 603
Applied a total of 44 rules in 33 ms. Remains 673 /695 variables (removed 22) and now considering 603/625 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 673/695 places, 603/625 transitions.
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:14:47] [INFO ] Input system was already deterministic with 603 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 694 transition count 478
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 148 rules applied. Total rules applied 294 place count 548 transition count 476
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 296 place count 547 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 297 place count 546 transition count 475
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 297 place count 546 transition count 407
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 433 place count 478 transition count 407
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 452 place count 459 transition count 388
Iterating global reduction 4 with 19 rules applied. Total rules applied 471 place count 459 transition count 388
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 471 place count 459 transition count 375
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 497 place count 446 transition count 375
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 4 with 302 rules applied. Total rules applied 799 place count 295 transition count 224
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 801 place count 293 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 802 place count 292 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 802 place count 292 transition count 220
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 806 place count 290 transition count 220
Applied a total of 806 rules in 76 ms. Remains 290 /695 variables (removed 405) and now considering 220/625 (removed 405) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 290/695 places, 220/625 transitions.
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:14:47] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 674 transition count 604
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 674 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 673 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 673 transition count 603
Applied a total of 44 rules in 32 ms. Remains 673 /695 variables (removed 22) and now considering 603/625 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 673/695 places, 603/625 transitions.
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:14:47] [INFO ] Input system was already deterministic with 603 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 673 transition count 603
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 672 transition count 602
Applied a total of 46 rules in 45 ms. Remains 672 /695 variables (removed 23) and now considering 602/625 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 672/695 places, 602/625 transitions.
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:14:47] [INFO ] Input system was already deterministic with 602 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 677 transition count 607
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 677 transition count 607
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 676 transition count 606
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 676 transition count 606
Applied a total of 38 rules in 33 ms. Remains 676 /695 variables (removed 19) and now considering 606/625 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 676/695 places, 606/625 transitions.
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:14:47] [INFO ] Input system was already deterministic with 606 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 672 transition count 602
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 671 transition count 601
Applied a total of 48 rules in 34 ms. Remains 671 /695 variables (removed 24) and now considering 601/625 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 671/695 places, 601/625 transitions.
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:14:47] [INFO ] Input system was already deterministic with 601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 672 transition count 602
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 671 transition count 601
Applied a total of 48 rules in 32 ms. Remains 671 /695 variables (removed 24) and now considering 601/625 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 671/695 places, 601/625 transitions.
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:14:47] [INFO ] Input system was already deterministic with 601 transitions.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 677 transition count 607
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 677 transition count 607
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 676 transition count 606
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 676 transition count 606
Applied a total of 38 rules in 31 ms. Remains 676 /695 variables (removed 19) and now considering 606/625 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 676/695 places, 606/625 transitions.
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:14:47] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:14:47] [INFO ] Input system was already deterministic with 606 transitions.
[2024-05-29 19:14:48] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:14:48] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:14:48] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-29 19:14:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 695 places, 625 transitions and 1610 arcs took 5 ms.
Total runtime 70819 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPt-PT-010B

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 918
MODEL NAME: /home/mcc/execution/413/model
695 places, 625 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.

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 CTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-010B"
export BK_EXAMINATION="CTLFireability"
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-010B, examination is CTLFireability"
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-171683759200618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;