fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of GreatSPN+red for Anderson-PT-04

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
423.035 71788.00 111719.00 488.10 FFFFTTTFFTTFTFFT 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.r003-smll-171620117400314.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 Anderson-PT-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117400314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 15:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 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 Anderson-PT-04-CTLFireability-2024-00
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-01
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-02
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-03
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-04
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-05
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-06
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-07
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-08
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-09
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-10
FORMULA_NAME Anderson-PT-04-CTLFireability-2024-11
FORMULA_NAME Anderson-PT-04-CTLFireability-2023-12
FORMULA_NAME Anderson-PT-04-CTLFireability-2023-13
FORMULA_NAME Anderson-PT-04-CTLFireability-2023-14
FORMULA_NAME Anderson-PT-04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716427920006

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 01:32:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 01:32:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:32:02] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2024-05-23 01:32:03] [INFO ] Transformed 105 places.
[2024-05-23 01:32:03] [INFO ] Transformed 200 transitions.
[2024-05-23 01:32:03] [INFO ] Found NUPN structural information;
[2024-05-23 01:32:03] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 597 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Support contains 62 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 200/200 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 98 transition count 193
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 98 transition count 193
Applied a total of 14 rules in 38 ms. Remains 98 /105 variables (removed 7) and now considering 193/200 (removed 7) transitions.
// Phase 1: matrix 193 rows 98 cols
[2024-05-23 01:32:03] [INFO ] Computed 11 invariants in 19 ms
[2024-05-23 01:32:03] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-23 01:32:03] [INFO ] Invariant cache hit.
[2024-05-23 01:32:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 01:32:04] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-23 01:32:04] [INFO ] Invariant cache hit.
[2024-05-23 01:32:04] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 01:32:06] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 19 ms to minimize.
[2024-05-23 01:32:06] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-23 01:32:06] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-23 01:32:06] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-05-23 01:32:06] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 3 ms to minimize.
[2024-05-23 01:32:06] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-23 01:32:06] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
[2024-05-23 01:32:07] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 3 ms to minimize.
[2024-05-23 01:32:07] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-23 01:32:07] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2024-05-23 01:32:07] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 3 ms to minimize.
[2024-05-23 01:32:07] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-23 01:32:07] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 3 ms to minimize.
[2024-05-23 01:32:07] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 3 ms to minimize.
[2024-05-23 01:32:07] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:32:08] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-23 01:32:08] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-05-23 01:32:08] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-05-23 01:32:08] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-23 01:32:08] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 01:32:08] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-23 01:32:08] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-23 01:32:08] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-23 01:32:09] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-05-23 01:32:09] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-23 01:32:09] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-05-23 01:32:09] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-23 01:32:09] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-23 01:32:09] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-23 01:32:09] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-23 01:32:09] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:32:09] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-23 01:32:10] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-23 01:32:10] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-23 01:32:10] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 2 ms to minimize.
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 7 ms to minimize.
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2024-05-23 01:32:11] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:32:12] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 2 ms to minimize.
[2024-05-23 01:32:12] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-23 01:32:12] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-05-23 01:32:12] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-05-23 01:32:12] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 3 ms to minimize.
[2024-05-23 01:32:13] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 01:32:13] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-23 01:32:13] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-05-23 01:32:13] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-05-23 01:32:14] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-23 01:32:14] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2024-05-23 01:32:14] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-23 01:32:14] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 1 ms to minimize.
[2024-05-23 01:32:14] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:32:14] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 3 ms to minimize.
[2024-05-23 01:32:14] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-05-23 01:32:15] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 01:32:15] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2024-05-23 01:32:15] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2024-05-23 01:32:15] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2024-05-23 01:32:16] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2024-05-23 01:32:16] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 3 ms to minimize.
[2024-05-23 01:32:16] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 3 ms to minimize.
[2024-05-23 01:32:16] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-23 01:32:16] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 01:32:18] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 01:32:19] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-23 01:32:20] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-05-23 01:32:20] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2024-05-23 01:32:20] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
[2024-05-23 01:32:20] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 01:32:21] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-05-23 01:32:21] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-23 01:32:22] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2024-05-23 01:32:22] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-23 01:32:22] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-23 01:32:22] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
[2024-05-23 01:32:23] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-23 01:32:23] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (OVERLAPS) 193/291 variables, 98/190 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 12/202 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 14 (OVERLAPS) 0/291 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 202 constraints, problems are : Problem set: 0 solved, 189 unsolved in 26962 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 81/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 193/291 variables, 98/190 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 12/202 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 189/391 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 01:32:43] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-05-23 01:32:45] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-23 01:32:46] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-05-23 01:32:46] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-23 01:32:46] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-05-23 01:32:46] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 2 ms to minimize.
[2024-05-23 01:32:47] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-23 01:32:47] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-23 01:32:57] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-23 01:32:57] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-05-23 01:32:58] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-05-23 01:33:00] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
[2024-05-23 01:33:00] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-23 01:33:00] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2024-05-23 01:33:01] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 7/406 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 406 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 96/96 constraints]
After SMT, in 57535ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 57562ms
Starting structural reductions in LTL mode, iteration 1 : 98/105 places, 193/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58559 ms. Remains : 98/105 places, 193/200 transitions.
Support contains 62 out of 98 places after structural reductions.
[2024-05-23 01:33:02] [INFO ] Flatten gal took : 75 ms
[2024-05-23 01:33:02] [INFO ] Flatten gal took : 34 ms
[2024-05-23 01:33:02] [INFO ] Input system was already deterministic with 193 transitions.
Reduction of identical properties reduced properties to check from 76 to 73
RANDOM walk for 40000 steps (8 resets) in 3233 ms. (12 steps per ms) remains 16/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 122 ms. (32 steps per ms) remains 12/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (8 resets) in 112 ms. (35 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 9/9 properties
[2024-05-23 01:33:03] [INFO ] Invariant cache hit.
[2024-05-23 01:33:03] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/95 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 3/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/98 variables, 3/11 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-23 01:33:04] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 193/291 variables, 98/110 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 12/122 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/122 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/122 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 122 constraints, problems are : Problem set: 4 solved, 5 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/94 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/98 variables, 4/11 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/12 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 193/291 variables, 98/110 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 12/122 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/123 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/123 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 0/123 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 123 constraints, problems are : Problem set: 8 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 721ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 98 transition count 182
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 87 transition count 182
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 37 place count 72 transition count 101
Iterating global reduction 0 with 15 rules applied. Total rules applied 52 place count 72 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 71 transition count 100
Applied a total of 54 rules in 42 ms. Remains 71 /98 variables (removed 27) and now considering 100/193 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 71/98 places, 100/193 transitions.
RANDOM walk for 40000 steps (8 resets) in 354 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2245 steps, run visited all 1 properties in 21 ms. (steps per millisecond=106 )
Probabilistic random walk after 2245 steps, saw 1021 distinct states, run finished after 27 ms. (steps per millisecond=83 ) properties seen :1
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2024-05-23 01:33:04] [INFO ] Flatten gal took : 21 ms
[2024-05-23 01:33:04] [INFO ] Flatten gal took : 23 ms
[2024-05-23 01:33:04] [INFO ] Input system was already deterministic with 193 transitions.
Support contains 51 out of 98 places (down from 54) after GAL structural reductions.
FORMULA Anderson-PT-04-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 84 transition count 125
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 84 transition count 125
Applied a total of 28 rules in 9 ms. Remains 84 /98 variables (removed 14) and now considering 125/193 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 84/98 places, 125/193 transitions.
[2024-05-23 01:33:04] [INFO ] Flatten gal took : 12 ms
[2024-05-23 01:33:04] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:33:04] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 87 transition count 140
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 87 transition count 140
Applied a total of 22 rules in 8 ms. Remains 87 /98 variables (removed 11) and now considering 140/193 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 87/98 places, 140/193 transitions.
[2024-05-23 01:33:04] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:33:04] [INFO ] Flatten gal took : 15 ms
[2024-05-23 01:33:04] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 98 transition count 182
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 87 transition count 182
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 35 place count 74 transition count 115
Iterating global reduction 0 with 13 rules applied. Total rules applied 48 place count 74 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 73 transition count 114
Applied a total of 50 rules in 22 ms. Remains 73 /98 variables (removed 25) and now considering 114/193 (removed 79) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 73/98 places, 114/193 transitions.
[2024-05-23 01:33:04] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:33:04] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:33:04] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 83 transition count 118
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 83 transition count 118
Applied a total of 30 rules in 7 ms. Remains 83 /98 variables (removed 15) and now considering 118/193 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 83/98 places, 118/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 82 transition count 105
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 82 transition count 105
Applied a total of 32 rules in 7 ms. Remains 82 /98 variables (removed 16) and now considering 105/193 (removed 88) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 82/98 places, 105/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 98 transition count 181
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 86 transition count 181
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 40 place count 70 transition count 99
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 70 transition count 99
Applied a total of 56 rules in 14 ms. Remains 70 /98 variables (removed 28) and now considering 99/193 (removed 94) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 70/98 places, 99/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 7 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 86 transition count 139
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 86 transition count 139
Applied a total of 24 rules in 3 ms. Remains 86 /98 variables (removed 12) and now considering 139/193 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 86/98 places, 139/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 11 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 14 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 85 transition count 126
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 85 transition count 126
Applied a total of 26 rules in 3 ms. Remains 85 /98 variables (removed 13) and now considering 126/193 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 85/98 places, 126/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 13 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 83 transition count 118
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 83 transition count 118
Applied a total of 30 rules in 3 ms. Remains 83 /98 variables (removed 15) and now considering 118/193 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 83/98 places, 118/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 9 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 10 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 98 transition count 182
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 87 transition count 182
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 36 place count 73 transition count 108
Iterating global reduction 0 with 14 rules applied. Total rules applied 50 place count 73 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 72 transition count 107
Applied a total of 52 rules in 14 ms. Remains 72 /98 variables (removed 26) and now considering 107/193 (removed 86) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 72/98 places, 107/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 7 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 98 transition count 181
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 86 transition count 181
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 38 place count 72 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 52 place count 72 transition count 113
Applied a total of 52 rules in 11 ms. Remains 72 /98 variables (removed 26) and now considering 113/193 (removed 80) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 72/98 places, 113/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 7 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 85 transition count 132
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 85 transition count 132
Applied a total of 26 rules in 3 ms. Remains 85 /98 variables (removed 13) and now considering 132/193 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 85/98 places, 132/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 98 transition count 181
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 86 transition count 181
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 39 place count 71 transition count 106
Iterating global reduction 0 with 15 rules applied. Total rules applied 54 place count 71 transition count 106
Applied a total of 54 rules in 17 ms. Remains 71 /98 variables (removed 27) and now considering 106/193 (removed 87) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 71/98 places, 106/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 6 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 7 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 85 transition count 132
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 85 transition count 132
Applied a total of 26 rules in 3 ms. Remains 85 /98 variables (removed 13) and now considering 132/193 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 85/98 places, 132/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 7 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 193/193 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 85 transition count 132
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 85 transition count 132
Applied a total of 26 rules in 3 ms. Remains 85 /98 variables (removed 13) and now considering 132/193 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 85/98 places, 132/193 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 7 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 8 ms
[2024-05-23 01:33:05] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 12 ms
[2024-05-23 01:33:05] [INFO ] Flatten gal took : 12 ms
[2024-05-23 01:33:05] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-05-23 01:33:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 193 transitions and 738 arcs took 3 ms.
Total runtime 63286 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-04

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 852
MODEL NAME: /home/mcc/execution/414/model
98 places, 193 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Anderson-PT-04-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Anderson-PT-04-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716427991794

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

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="Anderson-PT-04"
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 Anderson-PT-04, 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 r003-smll-171620117400314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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