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

About the Execution of LTSMin+red for DiscoveryGPU-PT-09a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
283.060 8403.00 19698.00 38.10 ???F???????????? 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.r488-tall-171631132600410.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 ltsminxred
Input is DiscoveryGPU-PT-09a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132600410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 01:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 01:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 01:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 32K 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 DiscoveryGPU-PT-09a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-09a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717192455947

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:54:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:54:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:54:17] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-31 21:54:17] [INFO ] Transformed 93 places.
[2024-05-31 21:54:17] [INFO ] Transformed 127 transitions.
[2024-05-31 21:54:17] [INFO ] Found NUPN structural information;
[2024-05-31 21:54:17] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 54 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 88 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 88 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 86 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 86 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 23 place count 86 transition count 111
Applied a total of 23 rules in 33 ms. Remains 86 /93 variables (removed 7) and now considering 111/127 (removed 16) transitions.
// Phase 1: matrix 111 rows 86 cols
[2024-05-31 21:54:17] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 21:54:17] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-31 21:54:17] [INFO ] Invariant cache hit.
[2024-05-31 21:54:17] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-31 21:54:17] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-31 21:54:17] [INFO ] Invariant cache hit.
[2024-05-31 21:54:17] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 111/197 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 70/158 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 158 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2509 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 111/197 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 70/158 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 110/268 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 268 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1861 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 4427ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 4445ms
Starting structural reductions in LTL mode, iteration 1 : 86/93 places, 111/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4852 ms. Remains : 86/93 places, 111/127 transitions.
Support contains 54 out of 86 places after structural reductions.
[2024-05-31 21:54:22] [INFO ] Flatten gal took : 30 ms
[2024-05-31 21:54:22] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:54:22] [INFO ] Input system was already deterministic with 111 transitions.
RANDOM walk for 40000 steps (414 resets) in 1522 ms. (26 steps per ms) remains 3/53 properties
BEST_FIRST walk for 40003 steps (48 resets) in 134 ms. (296 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (42 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
[2024-05-31 21:54:23] [INFO ] Invariant cache hit.
[2024-05-31 21:54:23] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/28 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 6 (OVERLAPS) 43/71 variables, 21/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 16/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/109 variables, 14/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 14/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/136 variables, 13/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 9/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/153 variables, 9/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/153 variables, 8/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/153 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 20/173 variables, 7/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 6/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/173 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/181 variables, 4/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/181 variables, 2/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/181 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/185 variables, 2/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/185 variables, 2/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/185 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/189 variables, 2/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/189 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/193 variables, 2/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/193 variables, 2/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/193 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4/197 variables, 2/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/197 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/197 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 158 constraints, problems are : Problem set: 1 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/48 variables, 15/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 14/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Int declared 89/197 variables, and 58 constraints, problems are : Problem set: 2 solved, 0 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/86 constraints, ReadFeed: 19/70 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 111 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 82 transition count 101
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 76 transition count 101
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 21 place count 68 transition count 93
Iterating global reduction 0 with 8 rules applied. Total rules applied 29 place count 68 transition count 93
Applied a total of 29 rules in 21 ms. Remains 68 /86 variables (removed 18) and now considering 93/111 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 68/86 places, 93/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 82 transition count 101
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 76 transition count 101
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 69 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 69 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 68 transition count 93
Applied a total of 29 rules in 12 ms. Remains 68 /86 variables (removed 18) and now considering 93/111 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 68/86 places, 93/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 73 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 71 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 71 transition count 96
Applied a total of 30 rules in 7 ms. Remains 71 /86 variables (removed 15) and now considering 96/111 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 71/86 places, 96/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 83 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 83 transition count 101
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 76 transition count 101
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 69 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 69 transition count 94
Applied a total of 29 rules in 9 ms. Remains 69 /86 variables (removed 17) and now considering 94/111 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 69/86 places, 94/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 94 transitions.
RANDOM walk for 15995 steps (176 resets) in 137 ms. (115 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 82 transition count 102
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 77 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 18 place count 70 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 25 place count 70 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 27 place count 69 transition count 94
Applied a total of 27 rules in 12 ms. Remains 69 /86 variables (removed 17) and now considering 94/111 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 69/86 places, 94/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 71 transition count 96
Applied a total of 30 rules in 6 ms. Remains 71 /86 variables (removed 15) and now considering 96/111 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 71/86 places, 96/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 71 transition count 96
Applied a total of 30 rules in 5 ms. Remains 71 /86 variables (removed 15) and now considering 96/111 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 71/86 places, 96/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 73 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 71 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 71 transition count 96
Applied a total of 30 rules in 4 ms. Remains 71 /86 variables (removed 15) and now considering 96/111 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/86 places, 96/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 74 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 72 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 72 transition count 97
Applied a total of 28 rules in 3 ms. Remains 72 /86 variables (removed 14) and now considering 97/111 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 72/86 places, 97/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 71 transition count 96
Applied a total of 30 rules in 3 ms. Remains 71 /86 variables (removed 15) and now considering 96/111 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 71/86 places, 96/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 82 transition count 100
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 75 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 23 place count 67 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 67 transition count 92
Applied a total of 31 rules in 7 ms. Remains 67 /86 variables (removed 19) and now considering 92/111 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 67/86 places, 92/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 75 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 75 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 72 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 72 transition count 97
Applied a total of 28 rules in 2 ms. Remains 72 /86 variables (removed 14) and now considering 97/111 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 72/86 places, 97/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 247 edges and 86 vertex of which 82 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 82 transition count 100
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 75 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 23 place count 67 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 67 transition count 92
Applied a total of 31 rules in 10 ms. Remains 67 /86 variables (removed 19) and now considering 92/111 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 67/86 places, 92/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 80 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 80 transition count 105
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 76 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 76 transition count 101
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 74 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 74 transition count 99
Applied a total of 24 rules in 2 ms. Remains 74 /86 variables (removed 12) and now considering 99/111 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 74/86 places, 99/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 103
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 72 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 69 transition count 94
Applied a total of 34 rules in 3 ms. Remains 69 /86 variables (removed 17) and now considering 94/111 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 69/86 places, 94/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 111/111 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 78 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 78 transition count 103
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 72 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 69 transition count 94
Applied a total of 34 rules in 2 ms. Remains 69 /86 variables (removed 17) and now considering 94/111 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 69/86 places, 94/111 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:54:23] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:54:23] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-31 21:54:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 111 transitions and 359 arcs took 4 ms.
Total runtime 6736 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2024-00
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2024-01
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2024-02
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2024-04
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2024-05
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2024-06
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2024-07
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2024-08
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2024-09
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2024-10
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2024-11
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2023-12
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2023-13
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2023-14
Could not compute solution for formula : DiscoveryGPU-PT-09a-CTLFireability-2023-15

BK_STOP 1717192464350

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/510/ctl_0_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/510/ctl_1_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/510/ctl_2_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/510/ctl_3_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/510/ctl_4_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/510/ctl_5_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/510/ctl_6_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/510/ctl_7_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/510/ctl_8_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/510/ctl_9_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/510/ctl_10_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/510/ctl_11_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/510/ctl_12_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/510/ctl_13_
ctl formula name DiscoveryGPU-PT-09a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/510/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="DiscoveryGPU-PT-09a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DiscoveryGPU-PT-09a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132600410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09a.tgz
mv DiscoveryGPU-PT-09a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;