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

About the Execution of LTSMin+red for JoinFreeModules-PT-0050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15817.199 3580510.00 14299881.00 394.20 ??F???T??TFT??T? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418500177.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 JoinFreeModules-PT-0050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418500177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 152K 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 JoinFreeModules-PT-0050-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679457652957

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=JoinFreeModules-PT-0050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:00:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 04:00:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:00:54] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-22 04:00:54] [INFO ] Transformed 251 places.
[2023-03-22 04:00:54] [INFO ] Transformed 401 transitions.
[2023-03-22 04:00:54] [INFO ] Parsed PT model containing 251 places and 401 transitions and 1152 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 6 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0050-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 104 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 17 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2023-03-22 04:00:54] [INFO ] Computed 50 place invariants in 22 ms
[2023-03-22 04:00:55] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
[2023-03-22 04:00:55] [INFO ] Invariant cache hit.
[2023-03-22 04:00:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-22 04:00:55] [INFO ] Invariant cache hit.
[2023-03-22 04:00:55] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:00:55] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-22 04:00:55] [INFO ] Invariant cache hit.
[2023-03-22 04:00:55] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 956 ms. Remains : 250/250 places, 401/401 transitions.
Support contains 104 out of 250 places after structural reductions.
[2023-03-22 04:00:55] [INFO ] Flatten gal took : 51 ms
[2023-03-22 04:00:55] [INFO ] Flatten gal took : 20 ms
[2023-03-22 04:00:55] [INFO ] Input system was already deterministic with 401 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 78) seen :64
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-22 04:00:56] [INFO ] Invariant cache hit.
[2023-03-22 04:00:56] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2023-03-22 04:00:56] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 04:00:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 04:00:57] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 04:00:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-22 04:00:57] [INFO ] After 287ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 04:00:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 6 ms to minimize.
[2023-03-22 04:00:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 04:00:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-22 04:00:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-22 04:00:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-22 04:00:58] [INFO ] After 788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-22 04:00:58] [INFO ] After 1646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 10 properties in 512 ms.
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 401/401 transitions.
Graph (complete) has 600 edges and 250 vertex of which 10 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.1 ms
Discarding 240 places :
Also discarding 384 output transitions
Drop transitions removed 384 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 6 ms. Remains 10 /250 variables (removed 240) and now considering 16/401 (removed 385) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 04:00:59] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 04:00:59] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 10/250 places, 16/401 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished Best-First random walk after 498 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=498 )
[2023-03-22 04:00:59] [INFO ] Flatten gal took : 20 ms
[2023-03-22 04:00:59] [INFO ] Flatten gal took : 19 ms
[2023-03-22 04:00:59] [INFO ] Input system was already deterministic with 401 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 26 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 250 cols
[2023-03-22 04:00:59] [INFO ] Computed 50 place invariants in 7 ms
[2023-03-22 04:00:59] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 187 ms. Remains : 250/250 places, 401/401 transitions.
[2023-03-22 04:00:59] [INFO ] Flatten gal took : 16 ms
[2023-03-22 04:00:59] [INFO ] Flatten gal took : 15 ms
[2023-03-22 04:00:59] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:00:59] [INFO ] Invariant cache hit.
[2023-03-22 04:00:59] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 250/250 places, 401/401 transitions.
[2023-03-22 04:00:59] [INFO ] Flatten gal took : 13 ms
[2023-03-22 04:00:59] [INFO ] Flatten gal took : 14 ms
[2023-03-22 04:00:59] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:00:59] [INFO ] Invariant cache hit.
[2023-03-22 04:00:59] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 250/250 places, 401/401 transitions.
[2023-03-22 04:00:59] [INFO ] Flatten gal took : 13 ms
[2023-03-22 04:00:59] [INFO ] Flatten gal took : 13 ms
[2023-03-22 04:00:59] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:00:59] [INFO ] Invariant cache hit.
[2023-03-22 04:00:59] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 250/250 places, 401/401 transitions.
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 15 ms
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 10 ms
[2023-03-22 04:01:00] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:01:00] [INFO ] Invariant cache hit.
[2023-03-22 04:01:00] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 250/250 places, 401/401 transitions.
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 23 ms
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 11 ms
[2023-03-22 04:01:00] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:01:00] [INFO ] Invariant cache hit.
[2023-03-22 04:01:00] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 250/250 places, 401/401 transitions.
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 10 ms
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 10 ms
[2023-03-22 04:01:00] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:01:00] [INFO ] Invariant cache hit.
[2023-03-22 04:01:00] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 250/250 places, 401/401 transitions.
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 10 ms
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 9 ms
[2023-03-22 04:01:00] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:01:00] [INFO ] Invariant cache hit.
[2023-03-22 04:01:00] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 250/250 places, 401/401 transitions.
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 9 ms
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 9 ms
[2023-03-22 04:01:00] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:01:00] [INFO ] Invariant cache hit.
[2023-03-22 04:01:00] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 250/250 places, 401/401 transitions.
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 8 ms
[2023-03-22 04:01:00] [INFO ] Flatten gal took : 8 ms
[2023-03-22 04:01:01] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2023-03-22 04:01:01] [INFO ] Invariant cache hit.
[2023-03-22 04:01:01] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 250/250 places, 401/401 transitions.
[2023-03-22 04:01:01] [INFO ] Flatten gal took : 8 ms
[2023-03-22 04:01:01] [INFO ] Flatten gal took : 8 ms
[2023-03-22 04:01:01] [INFO ] Input system was already deterministic with 401 transitions.
[2023-03-22 04:01:01] [INFO ] Flatten gal took : 9 ms
[2023-03-22 04:01:01] [INFO ] Flatten gal took : 8 ms
[2023-03-22 04:01:01] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 04:01:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 401 transitions and 1150 arcs took 3 ms.
Total runtime 6834 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/527/ctl_0_ --ctl=/tmp/527/ctl_1_ --ctl=/tmp/527/ctl_2_ --ctl=/tmp/527/ctl_3_ --ctl=/tmp/527/ctl_4_ --ctl=/tmp/527/ctl_5_ --ctl=/tmp/527/ctl_6_ --ctl=/tmp/527/ctl_7_ --ctl=/tmp/527/ctl_8_ --ctl=/tmp/527/ctl_9_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 332364 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16096632 kB
Could not compute solution for formula : JoinFreeModules-PT-0050-CTLCardinality-00
Could not compute solution for formula : JoinFreeModules-PT-0050-CTLCardinality-01
Could not compute solution for formula : JoinFreeModules-PT-0050-CTLCardinality-03
Could not compute solution for formula : JoinFreeModules-PT-0050-CTLCardinality-04
Could not compute solution for formula : JoinFreeModules-PT-0050-CTLCardinality-05
Could not compute solution for formula : JoinFreeModules-PT-0050-CTLCardinality-07
Could not compute solution for formula : JoinFreeModules-PT-0050-CTLCardinality-08
Could not compute solution for formula : JoinFreeModules-PT-0050-CTLCardinality-12
Could not compute solution for formula : JoinFreeModules-PT-0050-CTLCardinality-13
Could not compute solution for formula : JoinFreeModules-PT-0050-CTLCardinality-15

BK_STOP 1679461233467

--------------------
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 JoinFreeModules-PT-0050-CTLCardinality-00
ctl formula formula --ctl=/tmp/527/ctl_0_
ctl formula name JoinFreeModules-PT-0050-CTLCardinality-01
ctl formula formula --ctl=/tmp/527/ctl_1_
ctl formula name JoinFreeModules-PT-0050-CTLCardinality-03
ctl formula formula --ctl=/tmp/527/ctl_2_
ctl formula name JoinFreeModules-PT-0050-CTLCardinality-04
ctl formula formula --ctl=/tmp/527/ctl_3_
ctl formula name JoinFreeModules-PT-0050-CTLCardinality-05
ctl formula formula --ctl=/tmp/527/ctl_4_
ctl formula name JoinFreeModules-PT-0050-CTLCardinality-07
ctl formula formula --ctl=/tmp/527/ctl_5_
ctl formula name JoinFreeModules-PT-0050-CTLCardinality-08
ctl formula formula --ctl=/tmp/527/ctl_6_
ctl formula name JoinFreeModules-PT-0050-CTLCardinality-12
ctl formula formula --ctl=/tmp/527/ctl_7_
ctl formula name JoinFreeModules-PT-0050-CTLCardinality-13
ctl formula formula --ctl=/tmp/527/ctl_8_
ctl formula name JoinFreeModules-PT-0050-CTLCardinality-15
ctl formula formula --ctl=/tmp/527/ctl_9_
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 250 places, 401 transitions and 1150 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 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: 401->151 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.010 sys
pnml2lts-sym: state vector length is 250; there are 151 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: 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) : 533
Killing (9) : 533

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="JoinFreeModules-PT-0050"
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 JoinFreeModules-PT-0050, 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 r233-tall-167856418500177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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