fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r137-smll-167819417900282
Last Updated
May 14, 2023

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
252.159 18948.00 60582.00 449.50 FTFFTTFFFTFFTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r137-smll-167819417900282.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DiscoveryGPU-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819417900282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 13:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 13:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 13:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 22K Mar 5 18:22 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-06a-CTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678772300544

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-06a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 05:38:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 05:38:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 05:38:24] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-14 05:38:24] [INFO ] Transformed 63 places.
[2023-03-14 05:38:24] [INFO ] Transformed 85 transitions.
[2023-03-14 05:38:24] [INFO ] Found NUPN structural information;
[2023-03-14 05:38:24] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-06a-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 84
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 62 transition count 78
Applied a total of 8 rules in 27 ms. Remains 62 /63 variables (removed 1) and now considering 78/85 (removed 7) transitions.
// Phase 1: matrix 78 rows 62 cols
[2023-03-14 05:38:24] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-14 05:38:24] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-14 05:38:24] [INFO ] Invariant cache hit.
[2023-03-14 05:38:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-14 05:38:24] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2023-03-14 05:38:24] [INFO ] Invariant cache hit.
[2023-03-14 05:38:25] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 78/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 62/63 places, 78/85 transitions.
Support contains 54 out of 62 places after structural reductions.
[2023-03-14 05:38:25] [INFO ] Flatten gal took : 57 ms
[2023-03-14 05:38:25] [INFO ] Flatten gal took : 24 ms
[2023-03-14 05:38:25] [INFO ] Input system was already deterministic with 78 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 67) seen :66
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 05:38:26] [INFO ] Invariant cache hit.
[2023-03-14 05:38:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 05:38:26] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 9 ms
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 9 ms
[2023-03-14 05:38:26] [INFO ] Input system was already deterministic with 78 transitions.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 15 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 48/62 places, 64/78 transitions.
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 17 ms
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 6 ms
[2023-03-14 05:38:26] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 49 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 49 transition count 65
Applied a total of 26 rules in 16 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 49/62 places, 65/78 transitions.
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 5 ms
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 6 ms
[2023-03-14 05:38:26] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 51 transition count 67
Applied a total of 22 rules in 7 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 51/62 places, 67/78 transitions.
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 5 ms
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 5 ms
[2023-03-14 05:38:26] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 59 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 62 edges and 56 vertex of which 48 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Graph (trivial) has 48 edges and 48 vertex of which 24 / 48 are part of one of the 12 SCC in 3 ms
Free SCC test removed 12 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 36 transition count 60
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 29 place count 30 transition count 48
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 27 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 27 transition count 42
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 25 transition count 38
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 25 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 23 transition count 34
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 23 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 21 transition count 32
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 21 transition count 32
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 21 transition count 30
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 21 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 20 transition count 29
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 16 transition count 25
Applied a total of 55 rules in 38 ms. Remains 16 /62 variables (removed 46) and now considering 25/78 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 16/62 places, 25/78 transitions.
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 2 ms
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 2 ms
[2023-03-14 05:38:26] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 52 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 52 transition count 68
Applied a total of 20 rules in 15 ms. Remains 52 /62 variables (removed 10) and now considering 68/78 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 52/62 places, 68/78 transitions.
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 5 ms
[2023-03-14 05:38:26] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 55 transition count 71
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 55 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 52 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 52 transition count 68
Applied a total of 20 rules in 6 ms. Remains 52 /62 variables (removed 10) and now considering 68/78 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 52/62 places, 68/78 transitions.
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 5 ms
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 5 ms
[2023-03-14 05:38:26] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 54 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 51 transition count 67
Applied a total of 22 rules in 7 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 51/62 places, 67/78 transitions.
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 5 ms
[2023-03-14 05:38:26] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 57 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 53 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 49 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 49 transition count 65
Applied a total of 17 rules in 13 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 49/62 places, 65/78 transitions.
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 3 ms
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 8 ms
[2023-03-14 05:38:26] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 49 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 49 transition count 65
Applied a total of 26 rules in 6 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 49/62 places, 65/78 transitions.
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:26] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:27] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 9 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 48/62 places, 64/78 transitions.
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:27] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 75
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 57 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 55 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 55 transition count 71
Applied a total of 14 rules in 9 ms. Remains 55 /62 variables (removed 7) and now considering 71/78 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 55/62 places, 71/78 transitions.
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:27] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 55 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 55 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 53 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 53 transition count 69
Applied a total of 18 rules in 6 ms. Remains 53 /62 variables (removed 9) and now considering 69/78 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 53/62 places, 69/78 transitions.
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:27] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 7 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 48/62 places, 64/78 transitions.
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 3 ms
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 16 ms
[2023-03-14 05:38:27] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 55 transition count 71
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 55 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 53 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 53 transition count 69
Applied a total of 18 rules in 4 ms. Remains 53 /62 variables (removed 9) and now considering 69/78 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 53/62 places, 69/78 transitions.
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 16 ms
[2023-03-14 05:38:27] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 57 transition count 67
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 51 transition count 67
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 46 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 46 transition count 62
Applied a total of 23 rules in 21 ms. Remains 46 /62 variables (removed 16) and now considering 62/78 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 46/62 places, 62/78 transitions.
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 4 ms
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 12 ms
[2023-03-14 05:38:27] [INFO ] Input system was already deterministic with 62 transitions.
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 5 ms
[2023-03-14 05:38:27] [INFO ] Flatten gal took : 5 ms
[2023-03-14 05:38:27] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-14 05:38:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 78 transitions and 248 arcs took 1 ms.
Total runtime 3134 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/457/ctl_0_ --ctl=/tmp/457/ctl_1_ --ctl=/tmp/457/ctl_2_ --ctl=/tmp/457/ctl_3_ --ctl=/tmp/457/ctl_4_ --ctl=/tmp/457/ctl_5_ --ctl=/tmp/457/ctl_6_ --ctl=/tmp/457/ctl_7_ --ctl=/tmp/457/ctl_8_ --ctl=/tmp/457/ctl_9_ --ctl=/tmp/457/ctl_10_ --ctl=/tmp/457/ctl_11_ --ctl=/tmp/457/ctl_12_ --ctl=/tmp/457/ctl_13_ --ctl=/tmp/457/ctl_14_ --mu-par --mu-opt
FORMULA DiscoveryGPU-PT-06a-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-06a-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678772319492

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-00
ctl formula formula --ctl=/tmp/457/ctl_0_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-01
ctl formula formula --ctl=/tmp/457/ctl_1_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-02
ctl formula formula --ctl=/tmp/457/ctl_2_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-03
ctl formula formula --ctl=/tmp/457/ctl_3_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-04
ctl formula formula --ctl=/tmp/457/ctl_4_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-05
ctl formula formula --ctl=/tmp/457/ctl_5_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-06
ctl formula formula --ctl=/tmp/457/ctl_6_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-07
ctl formula formula --ctl=/tmp/457/ctl_7_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-08
ctl formula formula --ctl=/tmp/457/ctl_8_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-09
ctl formula formula --ctl=/tmp/457/ctl_9_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-10
ctl formula formula --ctl=/tmp/457/ctl_10_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-11
ctl formula formula --ctl=/tmp/457/ctl_11_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-12
ctl formula formula --ctl=/tmp/457/ctl_12_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-13
ctl formula formula --ctl=/tmp/457/ctl_13_
ctl formula name DiscoveryGPU-PT-06a-CTLFireability-14
ctl formula formula --ctl=/tmp/457/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 62 places, 78 transitions and 248 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 78->55 groups
pnml2lts-sym: Regrouping took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 62; there are 55 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 481 group checks and 0 next state calls
pnml2lts-sym: reachability took 5.350 real 14.500 user 6.820 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 1756921 states, 299 nodes
pnml2lts-sym: Formula /tmp/457/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_14_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_9_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/457/ctl_11_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_12_ holds for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_7_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/457/ctl_6_ does not hold for the initial state
pnml2lts-sym: group_next: 551 nodes total
pnml2lts-sym: group_explored: 397 nodes, 279 short vectors total
pnml2lts-sym: max token count: 2
free(): invalid pointer

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-06a"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DiscoveryGPU-PT-06a, 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 r137-smll-167819417900282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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