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

About the Execution of LTSMin+red for RefineWMG-PT-025026

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16015.396 3579701.00 14281627.00 392.40 F??F???T???T??TT 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.r329-tall-167889202300617.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 RefineWMG-PT-025026, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202300617
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 56K Mar 5 18:23 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 RefineWMG-PT-025026-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-025026-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679154956056

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-025026
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 15:55:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 15:55:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 15:55:57] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-18 15:55:57] [INFO ] Transformed 129 places.
[2023-03-18 15:55:57] [INFO ] Transformed 103 transitions.
[2023-03-18 15:55:57] [INFO ] Parsed PT model containing 129 places and 103 transitions and 308 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 92 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 181 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2023-03-18 15:55:58] [INFO ] Computed 52 place invariants in 10 ms
[2023-03-18 15:55:58] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
[2023-03-18 15:55:58] [INFO ] Invariant cache hit.
[2023-03-18 15:55:58] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-18 15:55:58] [INFO ] Invariant cache hit.
[2023-03-18 15:55:58] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-18 15:55:58] [INFO ] Invariant cache hit.
[2023-03-18 15:55:58] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 753 ms. Remains : 129/129 places, 103/103 transitions.
Support contains 92 out of 129 places after structural reductions.
[2023-03-18 15:55:58] [INFO ] Flatten gal took : 31 ms
[2023-03-18 15:55:58] [INFO ] Flatten gal took : 13 ms
[2023-03-18 15:55:58] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 91 out of 129 places (down from 92) after GAL structural reductions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 91) seen :37
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) seen :0
Running SMT prover for 54 properties.
[2023-03-18 15:55:59] [INFO ] Invariant cache hit.
[2023-03-18 15:55:59] [INFO ] [Real]Absence check using 52 positive place invariants in 11 ms returned sat
[2023-03-18 15:55:59] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:54
[2023-03-18 15:55:59] [INFO ] [Nat]Absence check using 52 positive place invariants in 7 ms returned sat
[2023-03-18 15:56:00] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :42
[2023-03-18 15:56:00] [INFO ] After 1069ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :42
Attempting to minimize the solution found.
Minimization took 349 ms.
[2023-03-18 15:56:01] [INFO ] After 1741ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :42
Fused 54 Parikh solutions to 42 different solutions.
Finished Parikh walk after 1590 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=227 )
Parikh walk visited 42 properties in 1034 ms.
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
[2023-03-18 15:56:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 10 ms
[2023-03-18 15:56:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RefineWMG-PT-025026-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 7 ms
[2023-03-18 15:56:02] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 63 out of 129 places (down from 78) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-18 15:56:02] [INFO ] Invariant cache hit.
[2023-03-18 15:56:02] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 129/129 places, 103/103 transitions.
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 7 ms
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 6 ms
[2023-03-18 15:56:02] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-18 15:56:02] [INFO ] Invariant cache hit.
[2023-03-18 15:56:02] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 129/129 places, 103/103 transitions.
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 6 ms
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 6 ms
[2023-03-18 15:56:02] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 3 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 92 place count 37 transition count 35
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 16 rules applied. Total rules applied 108 place count 37 transition count 19
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 124 place count 21 transition count 19
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 124 place count 21 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 132 place count 17 transition count 15
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 3 with 2 rules applied. Total rules applied 134 place count 16 transition count 14
Applied a total of 134 rules in 20 ms. Remains 16 /129 variables (removed 113) and now considering 14/103 (removed 89) transitions.
// Phase 1: matrix 14 rows 16 cols
[2023-03-18 15:56:02] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 15:56:02] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 16/129 places, 14/103 transitions.
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 2 ms
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 2 ms
[2023-03-18 15:56:02] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2023-03-18 15:56:02] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-18 15:56:02] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 129/129 places, 103/103 transitions.
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 7 ms
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:02] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-18 15:56:02] [INFO ] Invariant cache hit.
[2023-03-18 15:56:02] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 129/129 places, 103/103 transitions.
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 6 ms
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:02] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-18 15:56:02] [INFO ] Invariant cache hit.
[2023-03-18 15:56:02] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 129/129 places, 103/103 transitions.
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:02] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 63 edges and 129 vertex of which 42 / 129 are part of one of the 21 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 87 transition count 62
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 1 with 63 rules applied. Total rules applied 84 place count 45 transition count 41
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 8 rules applied. Total rules applied 92 place count 45 transition count 33
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 101 place count 37 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 36 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 102 place count 36 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 110 place count 32 transition count 28
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 4 with 2 rules applied. Total rules applied 112 place count 31 transition count 27
Applied a total of 112 rules in 8 ms. Remains 31 /129 variables (removed 98) and now considering 27/103 (removed 76) transitions.
// Phase 1: matrix 27 rows 31 cols
[2023-03-18 15:56:02] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-18 15:56:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 31/129 places, 27/103 transitions.
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 2 ms
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 2 ms
[2023-03-18 15:56:02] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 92 place count 37 transition count 35
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 13 rules applied. Total rules applied 105 place count 37 transition count 22
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 119 place count 24 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 23 transition count 21
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 120 place count 23 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 128 place count 19 transition count 17
Applied a total of 128 rules in 7 ms. Remains 19 /129 variables (removed 110) and now considering 17/103 (removed 86) transitions.
// Phase 1: matrix 17 rows 19 cols
[2023-03-18 15:56:02] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 15:56:02] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 19/129 places, 17/103 transitions.
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 1 ms
[2023-03-18 15:56:02] [INFO ] Flatten gal took : 1 ms
[2023-03-18 15:56:02] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2023-03-18 15:56:02] [INFO ] Computed 52 place invariants in 10 ms
[2023-03-18 15:56:03] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 129/129 places, 103/103 transitions.
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 4 ms
[2023-03-18 15:56:03] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 98 place count 33 transition count 33
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 21 rules applied. Total rules applied 119 place count 33 transition count 12
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 140 place count 12 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 140 place count 12 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 11 transition count 11
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 3 with 2 rules applied. Total rules applied 144 place count 10 transition count 10
Applied a total of 144 rules in 5 ms. Remains 10 /129 variables (removed 119) and now considering 10/103 (removed 93) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-18 15:56:03] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-18 15:56:03] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 10/129 places, 10/103 transitions.
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 0 ms
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 0 ms
[2023-03-18 15:56:03] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2023-03-18 15:56:03] [INFO ] Computed 52 place invariants in 0 ms
[2023-03-18 15:56:03] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 129/129 places, 103/103 transitions.
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:03] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-18 15:56:03] [INFO ] Invariant cache hit.
[2023-03-18 15:56:03] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 129/129 places, 103/103 transitions.
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:03] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-18 15:56:03] [INFO ] Invariant cache hit.
[2023-03-18 15:56:03] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 129/129 places, 103/103 transitions.
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:03] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 74 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 97 place count 31 transition count 30
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 116 place count 31 transition count 11
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 136 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 11 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 137 place count 11 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 9 transition count 8
Applied a total of 141 rules in 4 ms. Remains 9 /129 variables (removed 120) and now considering 8/103 (removed 95) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-18 15:56:03] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 15:56:03] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 9/129 places, 8/103 transitions.
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 1 ms
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 1 ms
[2023-03-18 15:56:03] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished Best-First random walk after 7898 steps, including 2 resets, run visited all 1 properties in 9 ms. (steps per millisecond=877 )
FORMULA RefineWMG-PT-025026-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:03] [INFO ] Flatten gal took : 5 ms
[2023-03-18 15:56:03] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-18 15:56:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 103 transitions and 308 arcs took 2 ms.
Total runtime 5821 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/530/ctl_0_ --ctl=/tmp/530/ctl_1_ --ctl=/tmp/530/ctl_2_ --ctl=/tmp/530/ctl_3_ --ctl=/tmp/530/ctl_4_ --ctl=/tmp/530/ctl_5_ --ctl=/tmp/530/ctl_6_ --ctl=/tmp/530/ctl_7_ --ctl=/tmp/530/ctl_8_ --ctl=/tmp/530/ctl_9_ --ctl=/tmp/530/ctl_10_ --ctl=/tmp/530/ctl_11_ --ctl=/tmp/530/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 176772 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16131304 kB
FORMULA RefineWMG-PT-025026-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : RefineWMG-PT-025026-CTLCardinality-01
Could not compute solution for formula : RefineWMG-PT-025026-CTLCardinality-02
FORMULA RefineWMG-PT-025026-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : RefineWMG-PT-025026-CTLCardinality-04
Could not compute solution for formula : RefineWMG-PT-025026-CTLCardinality-05
Could not compute solution for formula : RefineWMG-PT-025026-CTLCardinality-06
Could not compute solution for formula : RefineWMG-PT-025026-CTLCardinality-08
Could not compute solution for formula : RefineWMG-PT-025026-CTLCardinality-09
Could not compute solution for formula : RefineWMG-PT-025026-CTLCardinality-10
Could not compute solution for formula : RefineWMG-PT-025026-CTLCardinality-12
Could not compute solution for formula : RefineWMG-PT-025026-CTLCardinality-13
FORMULA RefineWMG-PT-025026-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679158535757

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name RefineWMG-PT-025026-CTLCardinality-00
ctl formula formula --ctl=/tmp/530/ctl_0_
ctl formula name RefineWMG-PT-025026-CTLCardinality-01
ctl formula formula --ctl=/tmp/530/ctl_1_
ctl formula name RefineWMG-PT-025026-CTLCardinality-02
ctl formula formula --ctl=/tmp/530/ctl_2_
ctl formula name RefineWMG-PT-025026-CTLCardinality-03
ctl formula formula --ctl=/tmp/530/ctl_3_
ctl formula name RefineWMG-PT-025026-CTLCardinality-04
ctl formula formula --ctl=/tmp/530/ctl_4_
ctl formula name RefineWMG-PT-025026-CTLCardinality-05
ctl formula formula --ctl=/tmp/530/ctl_5_
ctl formula name RefineWMG-PT-025026-CTLCardinality-06
ctl formula formula --ctl=/tmp/530/ctl_6_
ctl formula name RefineWMG-PT-025026-CTLCardinality-08
ctl formula formula --ctl=/tmp/530/ctl_7_
ctl formula name RefineWMG-PT-025026-CTLCardinality-09
ctl formula formula --ctl=/tmp/530/ctl_8_
ctl formula name RefineWMG-PT-025026-CTLCardinality-10
ctl formula formula --ctl=/tmp/530/ctl_9_
ctl formula name RefineWMG-PT-025026-CTLCardinality-12
ctl formula formula --ctl=/tmp/530/ctl_10_
ctl formula name RefineWMG-PT-025026-CTLCardinality-13
ctl formula formula --ctl=/tmp/530/ctl_11_
ctl formula name RefineWMG-PT-025026-CTLCardinality-14
ctl formula formula --ctl=/tmp/530/ctl_12_
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 129 places, 103 transitions and 308 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: 103->27 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 129; there are 27 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 364825 group checks and 0 next state calls
pnml2lts-sym: reachability took 313.330 real 1236.380 user 15.170 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 9.48365140510405e+78 states, 21394 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/530/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/530/ctl_3_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/530/ctl_12_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 536
Killing (9) : 536

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="RefineWMG-PT-025026"
export BK_EXAMINATION="CTLCardinality"
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 RefineWMG-PT-025026, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889202300617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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