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-171640603600498.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-12a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603600498
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 22:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 11 22:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 22:39 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 20K 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-12a-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2023-12
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2023-13
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2023-14
FORMULA_NAME GPUForwardProgress-PT-12a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717197664170

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-12a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:21:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:21:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:21:05] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-31 23:21:05] [INFO ] Transformed 56 places.
[2024-05-31 23:21:05] [INFO ] Transformed 69 transitions.
[2024-05-31 23:21:05] [INFO ] Found NUPN structural information;
[2024-05-31 23:21:05] [INFO ] Parsed PT model containing 56 places and 69 transitions and 261 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 36 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 55/55 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 55
Applied a total of 1 rules in 16 ms. Remains 55 /56 variables (removed 1) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 55 cols
[2024-05-31 23:21:05] [INFO ] Computed 13 invariants in 10 ms
[2024-05-31 23:21:05] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-31 23:21:05] [INFO ] Invariant cache hit.
[2024-05-31 23:21:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-31 23:21:05] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-05-31 23:21:05] [INFO ] Invariant cache hit.
[2024-05-31 23:21:05] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/110 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 136 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1779 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 54/187 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 1/110 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 190 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1968 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 3829ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3863ms
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 55/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4225 ms. Remains : 55/56 places, 55/55 transitions.
Support contains 36 out of 55 places after structural reductions.
[2024-05-31 23:21:10] [INFO ] Flatten gal took : 21 ms
[2024-05-31 23:21:10] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:21:10] [INFO ] Input system was already deterministic with 55 transitions.
Reduction of identical properties reduced properties to check from 55 to 52
RANDOM walk for 40000 steps (206 resets) in 1312 ms. (30 steps per ms) remains 2/52 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
[2024-05-31 23:21:10] [INFO ] Invariant cache hit.
[2024-05-31 23:21:10] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 43/54 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 43/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/109 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 1/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/110 variables, 1/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/110 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 136 constraints, problems are : Problem set: 1 solved, 1 unsolved in 146 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 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, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 49/54 variables, 13/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 49/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/108 variables, 54/121 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 12/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/109 variables, 1/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 1/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/110 variables, 1/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/110 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 137 constraints, problems are : Problem set: 1 solved, 1 unsolved in 118 ms.
Refiners :[Domain max(s): 55/55 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 271ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 11 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA GPUForwardProgress-PT-12a-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 55 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 172 edges and 55 vertex of which 42 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 55/55 places, 55/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 5 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Graph (complete) has 172 edges and 55 vertex of which 42 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 42 transition count 45
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 33 transition count 45
Applied a total of 19 rules in 15 ms. Remains 33 /55 variables (removed 22) and now considering 45/55 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 33/55 places, 45/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 55/55 places, 55/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 55/55 places, 55/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 29 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Graph (complete) has 172 edges and 55 vertex of which 42 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 42 transition count 46
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 34 transition count 46
Applied a total of 17 rules in 4 ms. Remains 34 /55 variables (removed 21) and now considering 46/55 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 34/55 places, 46/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 9 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Graph (complete) has 172 edges and 55 vertex of which 42 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.15 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 41 transition count 42
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 30 transition count 42
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 25 place count 29 transition count 41
Applied a total of 25 rules in 22 ms. Remains 29 /55 variables (removed 26) and now considering 41/55 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 29/55 places, 41/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 55/55 places, 55/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 55/55 places, 55/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 55/55 places, 55/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Graph (complete) has 172 edges and 55 vertex of which 42 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 1 place count 41 transition count 41
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 29 transition count 41
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 27 place count 28 transition count 40
Applied a total of 27 rules in 16 ms. Remains 28 /55 variables (removed 27) and now considering 40/55 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 28/55 places, 40/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 2 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 2 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Graph (complete) has 172 edges and 55 vertex of which 42 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 42 transition count 45
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 33 transition count 45
Applied a total of 19 rules in 6 ms. Remains 33 /55 variables (removed 22) and now considering 45/55 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 33/55 places, 45/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Graph (complete) has 172 edges and 55 vertex of which 42 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 42 transition count 46
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 34 transition count 46
Applied a total of 17 rules in 7 ms. Remains 34 /55 variables (removed 21) and now considering 46/55 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 34/55 places, 46/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Graph (complete) has 172 edges and 55 vertex of which 42 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 42 transition count 43
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 31 transition count 43
Applied a total of 23 rules in 4 ms. Remains 31 /55 variables (removed 24) and now considering 43/55 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 31/55 places, 43/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 2 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 2 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 55/55 places, 55/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 55/55 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 55/55 places, 55/55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:21:11] [INFO ] Flatten gal took : 3 ms
[2024-05-31 23:21:11] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-31 23:21:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 55 places, 55 transitions and 231 arcs took 3 ms.
Total runtime 6198 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-12a-CTLFireability-2024-00
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2024-01
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2024-02
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2024-03
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2024-04
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2024-05
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2024-06
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2024-07
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2024-08
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2024-09
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2024-10
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2023-12
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2023-13
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2023-14
Could not compute solution for formula : GPUForwardProgress-PT-12a-CTLFireability-2023-15

BK_STOP 1717197671928

--------------------
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-12a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/508/ctl_0_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/508/ctl_1_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/508/ctl_2_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/508/ctl_3_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/508/ctl_4_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/508/ctl_5_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/508/ctl_6_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/508/ctl_7_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/508/ctl_8_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/508/ctl_9_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/508/ctl_10_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/508/ctl_11_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/508/ctl_12_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/508/ctl_13_
ctl formula name GPUForwardProgress-PT-12a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/508/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-12a"
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-12a, 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-171640603600498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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