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

About the Execution of GreatSPN+red for HirschbergSinclair-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
437.304 45496.00 96060.00 221.20 TTFTTTFTFFFTFFTF 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.r201-smll-171649586500057.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 HirschbergSinclair-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586500057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 03:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 03:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:48 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 157K 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 HirschbergSinclair-PT-05-CTLCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2023-12
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2023-13
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2023-14
FORMULA_NAME HirschbergSinclair-PT-05-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716574218238

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 18:10:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 18:10:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 18:10:20] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2024-05-24 18:10:20] [INFO ] Transformed 124 places.
[2024-05-24 18:10:20] [INFO ] Transformed 111 transitions.
[2024-05-24 18:10:20] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
Support contains 102 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Applied a total of 0 rules in 21 ms. Remains 124 /124 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 124 cols
[2024-05-24 18:10:20] [INFO ] Computed 13 invariants in 25 ms
[2024-05-24 18:10:21] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-24 18:10:21] [INFO ] Invariant cache hit.
[2024-05-24 18:10:21] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-24 18:10:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 9/123 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 18:10:23] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 22 ms to minimize.
[2024-05-24 18:10:23] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/124 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 111/235 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/235 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 139 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5897 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 9/123 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/124 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 111/235 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 106/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 18:10:30] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 18:10:32] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-24 18:10:32] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 18:10:34] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-24 18:10:34] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 18:10:37] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-24 18:10:37] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-24 18:10:39] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-24 18:10:39] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 15 (OVERLAPS) 0/235 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 254 constraints, problems are : Problem set: 0 solved, 106 unsolved in 19762 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 11/11 constraints]
After SMT, in 25831ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 25945ms
Finished structural reductions in LTL mode , in 1 iterations and 26599 ms. Remains : 124/124 places, 111/111 transitions.
Support contains 102 out of 124 places after structural reductions.
[2024-05-24 18:10:47] [INFO ] Flatten gal took : 50 ms
[2024-05-24 18:10:47] [INFO ] Flatten gal took : 20 ms
[2024-05-24 18:10:47] [INFO ] Input system was already deterministic with 111 transitions.
Support contains 101 out of 124 places (down from 102) after GAL structural reductions.
RANDOM walk for 40000 steps (358 resets) in 2928 ms. (13 steps per ms) remains 22/98 properties
BEST_FIRST walk for 4002 steps (8 resets) in 144 ms. (27 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 102 ms. (38 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 101 ms. (39 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (12 resets) in 108 ms. (36 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
[2024-05-24 18:10:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp95 is UNSAT
At refinement iteration 1 (OVERLAPS) 80/114 variables, 10/10 constraints. Problems are: Problem set: 16 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/10 constraints. Problems are: Problem set: 16 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/122 variables, 3/13 constraints. Problems are: Problem set: 16 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 16 solved, 6 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 5 (OVERLAPS) 111/233 variables, 122/135 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/135 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/235 variables, 2/137 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/137 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/235 variables, 0/137 constraints. Problems are: Problem set: 19 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 137 constraints, problems are : Problem set: 19 solved, 3 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 93/100 variables, 7/7 constraints. Problems are: Problem set: 19 solved, 3 unsolved
[2024-05-24 18:10:49] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/8 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 10/110 variables, 3/11 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/119 variables, 3/14 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 111/230 variables, 119/133 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 2/135 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/135 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/235 variables, 5/140 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 1/141 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/141 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/235 variables, 0/141 constraints. Problems are: Problem set: 19 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 141 constraints, problems are : Problem set: 19 solved, 3 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 3/22 constraints, Known Traps: 1/1 constraints]
After SMT, in 728ms problems are : Problem set: 19 solved, 3 unsolved
Finished Parikh walk after 4553 steps, including 171 resets, run visited all 3 properties in 35 ms. (steps per millisecond=130 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
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 45 ms.
Successfully simplified 19 atomic propositions for a total of 16 simplifications.
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 18:10:49] [INFO ] Flatten gal took : 13 ms
[2024-05-24 18:10:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 18:10:49] [INFO ] Flatten gal took : 13 ms
[2024-05-24 18:10:49] [INFO ] Input system was already deterministic with 111 transitions.
Support contains 73 out of 124 places (down from 81) after GAL structural reductions.
Computed a total of 124 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 124 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 115 transition count 107
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 115 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 112 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 112 transition count 104
Applied a total of 19 rules in 41 ms. Remains 112 /124 variables (removed 12) and now considering 104/111 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 112/124 places, 104/111 transitions.
[2024-05-24 18:10:49] [INFO ] Flatten gal took : 9 ms
[2024-05-24 18:10:49] [INFO ] Flatten gal took : 10 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Graph (complete) has 236 edges and 124 vertex of which 119 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 114 transition count 60
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 68 transition count 60
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 98 place count 63 transition count 55
Iterating global reduction 2 with 5 rules applied. Total rules applied 103 place count 63 transition count 55
Applied a total of 103 rules in 31 ms. Remains 63 /124 variables (removed 61) and now considering 55/111 (removed 56) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 63/124 places, 55/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 5 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 6 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Graph (complete) has 236 edges and 124 vertex of which 119 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 115 transition count 61
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 69 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 67 transition count 59
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 102 place count 62 transition count 54
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 62 transition count 54
Applied a total of 107 rules in 24 ms. Remains 62 /124 variables (removed 62) and now considering 54/111 (removed 57) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 62/124 places, 54/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 5 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 5 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Graph (complete) has 236 edges and 124 vertex of which 119 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 115 transition count 80
Reduce places removed 27 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 31 rules applied. Total rules applied 59 place count 88 transition count 76
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 63 place count 84 transition count 76
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 68 place count 79 transition count 71
Iterating global reduction 3 with 5 rules applied. Total rules applied 73 place count 79 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 78 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 78 transition count 70
Applied a total of 75 rules in 25 ms. Remains 78 /124 variables (removed 46) and now considering 70/111 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 78/124 places, 70/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 5 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 7 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 116 transition count 107
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 116 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 113 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 113 transition count 104
Applied a total of 18 rules in 11 ms. Remains 113 /124 variables (removed 11) and now considering 104/111 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 113/124 places, 104/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 9 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 10 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 114 transition count 106
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 114 transition count 106
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 110 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 110 transition count 102
Applied a total of 23 rules in 11 ms. Remains 110 /124 variables (removed 14) and now considering 102/111 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 110/124 places, 102/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 8 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 9 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 115 transition count 106
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 115 transition count 106
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 110 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 110 transition count 101
Applied a total of 24 rules in 9 ms. Remains 110 /124 variables (removed 14) and now considering 101/111 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 110/124 places, 101/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 8 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 9 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 114 transition count 106
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 114 transition count 106
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 109 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 109 transition count 101
Applied a total of 25 rules in 10 ms. Remains 109 /124 variables (removed 15) and now considering 101/111 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 109/124 places, 101/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 8 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 8 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 116 transition count 107
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 116 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 112 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 112 transition count 103
Applied a total of 20 rules in 9 ms. Remains 112 /124 variables (removed 12) and now considering 103/111 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 112/124 places, 103/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 8 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 9 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 116 transition count 107
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 116 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 112 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 112 transition count 103
Applied a total of 20 rules in 10 ms. Remains 112 /124 variables (removed 12) and now considering 103/111 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 112/124 places, 103/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 8 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 9 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Graph (complete) has 236 edges and 124 vertex of which 119 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 114 transition count 66
Reduce places removed 40 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 74 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 72 transition count 64
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 70 transition count 62
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 70 transition count 62
Applied a total of 89 rules in 14 ms. Remains 70 /124 variables (removed 54) and now considering 62/111 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 70/124 places, 62/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 4 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 6 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Graph (complete) has 236 edges and 124 vertex of which 120 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 116 transition count 72
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 81 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 80 transition count 71
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 77 transition count 68
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 77 transition count 68
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 75 transition count 66
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 75 transition count 66
Applied a total of 83 rules in 18 ms. Remains 75 /124 variables (removed 49) and now considering 66/111 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 75/124 places, 66/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 5 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 6 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 116 transition count 108
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 116 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 113 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 113 transition count 105
Applied a total of 17 rules in 10 ms. Remains 113 /124 variables (removed 11) and now considering 105/111 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 113/124 places, 105/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 7 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 9 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 116 transition count 107
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 116 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 113 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 113 transition count 104
Applied a total of 18 rules in 9 ms. Remains 113 /124 variables (removed 11) and now considering 104/111 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 113/124 places, 104/111 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 8 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 9 ms
[2024-05-24 18:10:50] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 10 ms
[2024-05-24 18:10:50] [INFO ] Flatten gal took : 10 ms
[2024-05-24 18:10:50] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-05-24 18:10:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 111 transitions and 340 arcs took 3 ms.
Total runtime 30599 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HirschbergSinclair-PT-05

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/416/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: 596
MODEL NAME: /home/mcc/execution/416/model
124 places, 111 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 HirschbergSinclair-PT-05-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-05-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716574263734

--------------------
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="HirschbergSinclair-PT-05"
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 HirschbergSinclair-PT-05, 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 r201-smll-171649586500057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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