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

About the Execution of LTSMin+red for GPUForwardProgress-PT-24a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
357.111 17621.00 28762.00 78.30 ??????????T????? 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.r496-tall-171640603700546.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 GPUForwardProgress-PT-24a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603700546
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 23:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 11 23:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 23:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 23:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 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 38K 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 GPUForwardProgress-PT-24a-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2023-12
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2023-13
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2023-14
FORMULA_NAME GPUForwardProgress-PT-24a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717198107144

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-24a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:28:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:28:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:28:28] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-31 23:28:28] [INFO ] Transformed 104 places.
[2024-05-31 23:28:28] [INFO ] Transformed 129 transitions.
[2024-05-31 23:28:28] [INFO ] Found NUPN structural information;
[2024-05-31 23:28:28] [INFO ] Parsed PT model containing 104 places and 129 transitions and 501 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Support contains 83 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Applied a total of 0 rules in 10 ms. Remains 104 /104 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 104 cols
[2024-05-31 23:28:28] [INFO ] Computed 26 invariants in 7 ms
[2024-05-31 23:28:28] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-31 23:28:28] [INFO ] Invariant cache hit.
[2024-05-31 23:28:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 23:28:28] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-31 23:28:28] [INFO ] Invariant cache hit.
[2024-05-31 23:28:28] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 26/129 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/205 variables, 103/232 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 24/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/207 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/207 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 259 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6677 ms.
Refiners :[Domain max(s): 104/104 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 104/104 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 26/129 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/205 variables, 103/232 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 24/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 102/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/207 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 361 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6774 ms.
Refiners :[Domain max(s): 104/104 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 104/104 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 13587ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 13599ms
Finished structural reductions in LTL mode , in 1 iterations and 13985 ms. Remains : 104/104 places, 103/103 transitions.
Support contains 83 out of 104 places after structural reductions.
[2024-05-31 23:28:42] [INFO ] Flatten gal took : 27 ms
[2024-05-31 23:28:42] [INFO ] Flatten gal took : 13 ms
[2024-05-31 23:28:42] [INFO ] Input system was already deterministic with 103 transitions.
Reduction of identical properties reduced properties to check from 69 to 67
RANDOM walk for 40000 steps (84 resets) in 1708 ms. (23 steps per ms) remains 3/67 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (313 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
[2024-05-31 23:28:43] [INFO ] Invariant cache hit.
[2024-05-31 23:28:43] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 71/103 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 71/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 102/205 variables, 103/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 24/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/257 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/258 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/258 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/207 variables, 1/259 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 259 constraints, problems are : Problem set: 2 solved, 1 unsolved in 158 ms.
Refiners :[Domain max(s): 104/104 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 104/104 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/101 variables, 24/51 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 75/126 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/126 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/103 variables, 1/127 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 2/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 102/205 variables, 103/232 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 24/256 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 1/257 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/257 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/206 variables, 1/258 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 1/259 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/207 variables, 1/260 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/207 variables, 0/260 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/207 variables, 0/260 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 260 constraints, problems are : Problem set: 2 solved, 1 unsolved in 148 ms.
Refiners :[Domain max(s): 104/104 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 104/104 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 320ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 283 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=70 )
Parikh walk visited 1 properties in 9 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA GPUForwardProgress-PT-24a-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 23:28:43] [INFO ] Flatten gal took : 8 ms
[2024-05-31 23:28:43] [INFO ] Flatten gal took : 9 ms
[2024-05-31 23:28:43] [INFO ] Input system was already deterministic with 103 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 330 edges and 104 vertex of which 78 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 8 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 103/104 places, 103/103 transitions.
[2024-05-31 23:28:43] [INFO ] Flatten gal took : 7 ms
[2024-05-31 23:28:43] [INFO ] Flatten gal took : 7 ms
[2024-05-31 23:28:43] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 103/104 places, 103/103 transitions.
[2024-05-31 23:28:43] [INFO ] Flatten gal took : 7 ms
[2024-05-31 23:28:43] [INFO ] Flatten gal took : 7 ms
[2024-05-31 23:28:43] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Graph (complete) has 330 edges and 104 vertex of which 78 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 1 place count 78 transition count 82
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 41 place count 58 transition count 82
Applied a total of 41 rules in 18 ms. Remains 58 /104 variables (removed 46) and now considering 82/103 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 58/104 places, 82/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 103/104 places, 103/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 103/104 places, 103/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 103/104 places, 103/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 104/104 places, 103/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 103/104 places, 103/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 103/104 places, 103/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Graph (complete) has 330 edges and 104 vertex of which 78 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 1 place count 78 transition count 85
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 35 place count 61 transition count 85
Applied a total of 35 rules in 7 ms. Remains 61 /104 variables (removed 43) and now considering 85/103 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 61/104 places, 85/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Graph (complete) has 330 edges and 104 vertex of which 78 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 23 Pre rules applied. Total rules applied 1 place count 78 transition count 79
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 55 transition count 79
Applied a total of 47 rules in 6 ms. Remains 55 /104 variables (removed 49) and now considering 79/103 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 55/104 places, 79/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 103/104 places, 103/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 103/104 places, 103/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 103
Applied a total of 1 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 103/104 places, 103/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 104/104 places, 103/103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:28:44] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:28:44] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:28:44] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-31 23:28:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 103 transitions and 449 arcs took 4 ms.
Total runtime 16078 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 : GPUForwardProgress-PT-24a-CTLFireability-2024-00
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2024-01
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2024-02
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2024-03
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2024-04
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2024-05
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2024-06
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2024-07
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2024-08
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2024-09
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2024-11
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2023-12
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2023-13
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2023-14
Could not compute solution for formula : GPUForwardProgress-PT-24a-CTLFireability-2023-15

BK_STOP 1717198124765

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 GPUForwardProgress-PT-24a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/510/ctl_0_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/510/ctl_1_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/510/ctl_2_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/510/ctl_3_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/510/ctl_4_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/510/ctl_5_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/510/ctl_6_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/510/ctl_7_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/510/ctl_8_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/510/ctl_9_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/510/ctl_10_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/510/ctl_11_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/510/ctl_12_
ctl formula name GPUForwardProgress-PT-24a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/510/ctl_13_
ctl formula name GPUForwardProgress-PT-24a-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="GPUForwardProgress-PT-24a"
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 GPUForwardProgress-PT-24a, 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 r496-tall-171640603700546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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