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.r179-tall-171640601300337.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 GPPP-PT-C0001N0000000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601300337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 08:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000010-CTLCardinality-2024-00
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-01
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-02
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-03
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-04
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-05
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-06
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-07
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-08
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-09
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-10
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-11
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2023-12
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2023-13
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2023-14
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716451152179

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000000010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 07:59:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 07:59:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 07:59:13] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-23 07:59:13] [INFO ] Transformed 33 places.
[2024-05-23 07:59:13] [INFO ] Transformed 22 transitions.
[2024-05-23 07:59:13] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 12 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-23 07:59:13] [INFO ] Computed 13 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 1309ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1320ms
[2024-05-23 07:59:14] [INFO ] Invariant cache hit.
[2024-05-23 07:59:14] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-23 07:59:14] [INFO ] Invariant cache hit.
[2024-05-23 07:59:14] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-23 07:59:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 976ms
Finished structural reductions in LTL mode , in 1 iterations and 2426 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2024-05-23 07:59:16] [INFO ] Flatten gal took : 17 ms
[2024-05-23 07:59:16] [INFO ] Flatten gal took : 6 ms
[2024-05-23 07:59:16] [INFO ] Input system was already deterministic with 22 transitions.
RANDOM walk for 40015 steps (8 resets) in 2283 ms. (17 steps per ms) remains 54/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
[2024-05-23 07:59:17] [INFO ] Invariant cache hit.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 21 solved, 33 unsolved
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 2/8 constraints. Problems are: Problem set: 23 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 23 solved, 31 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/33 variables, 5/13 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 51 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 51 solved, 3 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 51 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/7 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/15 variables, 4/11 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 1/12 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/15 variables, 2/14 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 0/14 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 20/35 variables, 5/19 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/35 variables, 1/20 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/38 variables, 3/23 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/38 variables, 1/24 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/38 variables, 0/24 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/40 variables, 2/26 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 15/55 variables, 23/49 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/55 variables, 0/49 constraints. Problems are: Problem set: 51 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/55 variables, 0/49 constraints. Problems are: Problem set: 51 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 49 constraints, problems are : Problem set: 51 solved, 3 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 3/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 51 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 227 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=56 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 9 ms.
Successfully simplified 51 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 07:59:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-23 07:59:17] [INFO ] Flatten gal took : 5 ms
[2024-05-23 07:59:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 07:59:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 07:59:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:59:17] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 18 out of 33 places (down from 23) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2024-05-23 07:59:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 937ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 937ms
Finished structural reductions in LTL mode , in 1 iterations and 939 ms. Remains : 33/33 places, 22/22 transitions.
[2024-05-23 07:59:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:59:18] [INFO ] Flatten gal took : 2 ms
[2024-05-23 07:59:18] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2024-05-23 07:59:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 931ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 932ms
Finished structural reductions in LTL mode , in 1 iterations and 932 ms. Remains : 33/33 places, 22/22 transitions.
[2024-05-23 07:59:19] [INFO ] Flatten gal took : 7 ms
[2024-05-23 07:59:19] [INFO ] Flatten gal took : 2 ms
[2024-05-23 07:59:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2024-05-23 07:59:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 954ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 955ms
Finished structural reductions in LTL mode , in 1 iterations and 956 ms. Remains : 33/33 places, 22/22 transitions.
[2024-05-23 07:59:20] [INFO ] Flatten gal took : 7 ms
[2024-05-23 07:59:20] [INFO ] Flatten gal took : 4 ms
[2024-05-23 07:59:20] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
[2024-05-23 07:59:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 948ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 948ms
Finished structural reductions in LTL mode , in 1 iterations and 956 ms. Remains : 33/33 places, 22/22 transitions.
[2024-05-23 07:59:21] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:59:21] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:59:21] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-23 07:59:21] [INFO ] Flatten gal took : 2 ms
[2024-05-23 07:59:21] [INFO ] Flatten gal took : 1 ms
[2024-05-23 07:59:21] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-23 07:59:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 22 transitions and 83 arcs took 1 ms.
Total runtime 8236 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running GPPP-PT-C0001N0000000010

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: 33
TRANSITIONS: 22
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/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: 581
MODEL NAME: /home/mcc/execution/413/model
33 places, 22 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716451162217

--------------------
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 CTLCardinality -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="GPPP-PT-C0001N0000000010"
export BK_EXAMINATION="CTLCardinality"
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 GPPP-PT-C0001N0000000010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640601300337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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