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

About the Execution of LTSMin+red for Referendum-PT-1000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15803.487 3597321.00 14307257.00 594.90 ???????T??????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.r329-tall-167889202200522.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 Referendum-PT-1000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202200522
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 34M
-rw-r--r-- 1 mcc users 589K Feb 26 19:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Feb 26 19:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 574K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.0M Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 556K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 258K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 20:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Feb 26 20:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Feb 26 19:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Feb 26 19:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 72K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 176K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 Referendum-PT-1000-CTLFireability-00
FORMULA_NAME Referendum-PT-1000-CTLFireability-01
FORMULA_NAME Referendum-PT-1000-CTLFireability-02
FORMULA_NAME Referendum-PT-1000-CTLFireability-03
FORMULA_NAME Referendum-PT-1000-CTLFireability-04
FORMULA_NAME Referendum-PT-1000-CTLFireability-05
FORMULA_NAME Referendum-PT-1000-CTLFireability-06
FORMULA_NAME Referendum-PT-1000-CTLFireability-07
FORMULA_NAME Referendum-PT-1000-CTLFireability-08
FORMULA_NAME Referendum-PT-1000-CTLFireability-09
FORMULA_NAME Referendum-PT-1000-CTLFireability-10
FORMULA_NAME Referendum-PT-1000-CTLFireability-11
FORMULA_NAME Referendum-PT-1000-CTLFireability-12
FORMULA_NAME Referendum-PT-1000-CTLFireability-13
FORMULA_NAME Referendum-PT-1000-CTLFireability-14
FORMULA_NAME Referendum-PT-1000-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679145656204

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-1000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 13:20:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 13:20:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 13:20:58] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2023-03-18 13:20:58] [INFO ] Transformed 3001 places.
[2023-03-18 13:20:58] [INFO ] Transformed 2001 transitions.
[2023-03-18 13:20:58] [INFO ] Found NUPN structural information;
[2023-03-18 13:20:58] [INFO ] Parsed PT model containing 3001 places and 2001 transitions and 5001 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 138 ms.
Support contains 1001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 2000 places and 0 transitions.
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 3000 rules applied. Total rules applied 3000 place count 1001 transition count 1001
Applied a total of 3000 rules in 131 ms. Remains 1001 /3001 variables (removed 2000) and now considering 1001/2001 (removed 1000) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2023-03-18 13:20:58] [INFO ] Computed 0 place invariants in 25 ms
[2023-03-18 13:20:59] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-18 13:20:59] [INFO ] Invariant cache hit.
[2023-03-18 13:20:59] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2023-03-18 13:20:59] [INFO ] Invariant cache hit.
[2023-03-18 13:21:00] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/3001 places, 1001/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1736 ms. Remains : 1001/3001 places, 1001/2001 transitions.
Support contains 1001 out of 1001 places after structural reductions.
[2023-03-18 13:21:01] [INFO ] Flatten gal took : 511 ms
[2023-03-18 13:21:03] [INFO ] Flatten gal took : 380 ms
[2023-03-18 13:21:05] [INFO ] Input system was already deterministic with 1001 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 34) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1074 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 13:21:06] [INFO ] Invariant cache hit.
[2023-03-18 13:21:12] [INFO ] After 5100ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-18 13:21:13] [INFO ] Flatten gal took : 283 ms
[2023-03-18 13:21:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Referendum-PT-1000-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 13:21:14] [INFO ] Flatten gal took : 241 ms
[2023-03-18 13:21:15] [INFO ] Input system was already deterministic with 1001 transitions.
Computed a total of 1001 stabilizing places and 1001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1001 transition count 1001
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 5 formulas.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 5 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 1001/1001 places, 1001/1001 transitions.
[2023-03-18 13:21:15] [INFO ] Flatten gal took : 100 ms
[2023-03-18 13:21:15] [INFO ] Flatten gal took : 102 ms
[2023-03-18 13:21:15] [INFO ] Input system was already deterministic with 1001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 999 places :
Symmetric choice reduction at 0 with 999 rule applications. Total rules 999 place count 2 transition count 2
Iterating global reduction 0 with 999 rules applied. Total rules applied 1998 place count 2 transition count 2
Applied a total of 1998 rules in 41 ms. Remains 2 /1001 variables (removed 999) and now considering 2/1001 (removed 999) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 2/1001 places, 2/1001 transitions.
[2023-03-18 13:21:16] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:16] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:16] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 5 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 1001/1001 places, 1001/1001 transitions.
[2023-03-18 13:21:16] [INFO ] Flatten gal took : 103 ms
[2023-03-18 13:21:16] [INFO ] Flatten gal took : 118 ms
[2023-03-18 13:21:16] [INFO ] Input system was already deterministic with 1001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 5 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 1001/1001 places, 1001/1001 transitions.
[2023-03-18 13:21:16] [INFO ] Flatten gal took : 121 ms
[2023-03-18 13:21:16] [INFO ] Flatten gal took : 136 ms
[2023-03-18 13:21:16] [INFO ] Input system was already deterministic with 1001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 4 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 1001/1001 places, 1001/1001 transitions.
[2023-03-18 13:21:16] [INFO ] Flatten gal took : 107 ms
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 124 ms
[2023-03-18 13:21:17] [INFO ] Input system was already deterministic with 1001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 4 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 1001/1001 places, 1001/1001 transitions.
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 105 ms
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 117 ms
[2023-03-18 13:21:17] [INFO ] Input system was already deterministic with 1001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Applied a total of 0 rules in 4 ms. Remains 1001 /1001 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 1001/1001 places, 1001/1001 transitions.
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 98 ms
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 107 ms
[2023-03-18 13:21:17] [INFO ] Input system was already deterministic with 1001 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Graph (complete) has 1000 edges and 1001 vertex of which 2 are kept as prefixes of interest. Removing 999 places using SCC suffix rule.2 ms
Discarding 999 places :
Also discarding 999 output transitions
Drop transitions removed 999 transitions
Applied a total of 1 rules in 9 ms. Remains 2 /1001 variables (removed 999) and now considering 2/1001 (removed 999) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 2/1001 places, 2/1001 transitions.
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:17] [INFO ] Input system was already deterministic with 2 transitions.
Support contains 0 out of 2 places (down from 1) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 992 places :
Symmetric choice reduction at 0 with 992 rule applications. Total rules 992 place count 9 transition count 9
Iterating global reduction 0 with 992 rules applied. Total rules applied 1984 place count 9 transition count 9
Applied a total of 1984 rules in 27 ms. Remains 9 /1001 variables (removed 992) and now considering 9/1001 (removed 992) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 9/1001 places, 9/1001 transitions.
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 13:21:17] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 998 place count 3 transition count 3
Iterating global reduction 0 with 998 rules applied. Total rules applied 1996 place count 3 transition count 3
Applied a total of 1996 rules in 15 ms. Remains 3 /1001 variables (removed 998) and now considering 3/1001 (removed 998) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 3/1001 places, 3/1001 transitions.
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:17] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 990 places :
Symmetric choice reduction at 0 with 990 rule applications. Total rules 990 place count 11 transition count 11
Iterating global reduction 0 with 990 rules applied. Total rules applied 1980 place count 11 transition count 11
Applied a total of 1980 rules in 15 ms. Remains 11 /1001 variables (removed 990) and now considering 11/1001 (removed 990) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 11/1001 places, 11/1001 transitions.
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 13:21:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:17] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 994 places :
Symmetric choice reduction at 0 with 994 rule applications. Total rules 994 place count 7 transition count 7
Iterating global reduction 0 with 994 rules applied. Total rules applied 1988 place count 7 transition count 7
Applied a total of 1988 rules in 16 ms. Remains 7 /1001 variables (removed 994) and now considering 7/1001 (removed 994) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 7/1001 places, 7/1001 transitions.
[2023-03-18 13:21:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 13:21:18] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 999 places :
Symmetric choice reduction at 0 with 999 rule applications. Total rules 999 place count 2 transition count 2
Iterating global reduction 0 with 999 rules applied. Total rules applied 1998 place count 2 transition count 2
Applied a total of 1998 rules in 15 ms. Remains 2 /1001 variables (removed 999) and now considering 2/1001 (removed 999) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 2/1001 places, 2/1001 transitions.
[2023-03-18 13:21:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:18] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 998 places :
Symmetric choice reduction at 0 with 998 rule applications. Total rules 998 place count 3 transition count 3
Iterating global reduction 0 with 998 rules applied. Total rules applied 1996 place count 3 transition count 3
Applied a total of 1996 rules in 13 ms. Remains 3 /1001 variables (removed 998) and now considering 3/1001 (removed 998) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 3/1001 places, 3/1001 transitions.
[2023-03-18 13:21:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 13:21:18] [INFO ] Flatten gal took : 1 ms
FORMULA Referendum-PT-1000-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 13:21:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:18] [INFO ] Input system was already deterministic with 3 transitions.
Support contains 0 out of 3 places (down from 1) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 1001/1001 transitions.
Discarding 997 places :
Symmetric choice reduction at 0 with 997 rule applications. Total rules 997 place count 4 transition count 4
Iterating global reduction 0 with 997 rules applied. Total rules applied 1994 place count 4 transition count 4
Applied a total of 1994 rules in 12 ms. Remains 4 /1001 variables (removed 997) and now considering 4/1001 (removed 997) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 4/1001 places, 4/1001 transitions.
[2023-03-18 13:21:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 13:21:18] [INFO ] Input system was already deterministic with 4 transitions.
[2023-03-18 13:21:18] [INFO ] Flatten gal took : 211 ms
[2023-03-18 13:21:19] [INFO ] Flatten gal took : 205 ms
[2023-03-18 13:21:20] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 66 ms.
[2023-03-18 13:21:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1001 places, 1001 transitions and 2001 arcs took 4 ms.
Total runtime 22679 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/474/ctl_0_ --ctl=/tmp/474/ctl_1_ --ctl=/tmp/474/ctl_2_ --ctl=/tmp/474/ctl_3_ --ctl=/tmp/474/ctl_4_ --ctl=/tmp/474/ctl_5_ --ctl=/tmp/474/ctl_6_ --ctl=/tmp/474/ctl_7_ --ctl=/tmp/474/ctl_8_ --ctl=/tmp/474/ctl_9_ --ctl=/tmp/474/ctl_10_ --ctl=/tmp/474/ctl_11_ --ctl=/tmp/474/ctl_12_ --ctl=/tmp/474/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393232 kB
MemFree: 9734128 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16037956 kB
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-00
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-01
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-02
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-03
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-04
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-05
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-06
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-08
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-09
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-10
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-11
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-12
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-13
Could not compute solution for formula : Referendum-PT-1000-CTLFireability-15

BK_STOP 1679149253525

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name Referendum-PT-1000-CTLFireability-00
ctl formula formula --ctl=/tmp/474/ctl_0_
ctl formula name Referendum-PT-1000-CTLFireability-01
ctl formula formula --ctl=/tmp/474/ctl_1_
ctl formula name Referendum-PT-1000-CTLFireability-02
ctl formula formula --ctl=/tmp/474/ctl_2_
ctl formula name Referendum-PT-1000-CTLFireability-03
ctl formula formula --ctl=/tmp/474/ctl_3_
ctl formula name Referendum-PT-1000-CTLFireability-04
ctl formula formula --ctl=/tmp/474/ctl_4_
ctl formula name Referendum-PT-1000-CTLFireability-05
ctl formula formula --ctl=/tmp/474/ctl_5_
ctl formula name Referendum-PT-1000-CTLFireability-06
ctl formula formula --ctl=/tmp/474/ctl_6_
ctl formula name Referendum-PT-1000-CTLFireability-08
ctl formula formula --ctl=/tmp/474/ctl_7_
ctl formula name Referendum-PT-1000-CTLFireability-09
ctl formula formula --ctl=/tmp/474/ctl_8_
ctl formula name Referendum-PT-1000-CTLFireability-10
ctl formula formula --ctl=/tmp/474/ctl_9_
ctl formula name Referendum-PT-1000-CTLFireability-11
ctl formula formula --ctl=/tmp/474/ctl_10_
ctl formula name Referendum-PT-1000-CTLFireability-12
ctl formula formula --ctl=/tmp/474/ctl_11_
ctl formula name Referendum-PT-1000-CTLFireability-13
ctl formula formula --ctl=/tmp/474/ctl_12_
ctl formula name Referendum-PT-1000-CTLFireability-15
ctl formula formula --ctl=/tmp/474/ctl_13_
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 1001 places, 1001 transitions and 2001 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.010 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: 1001->1 groups
pnml2lts-sym: Regrouping took 0.940 real 0.930 user 0.000 sys
pnml2lts-sym: state vector length is 1001; there are 1 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: 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) : 480
Killing (9) : 480

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="Referendum-PT-1000"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Referendum-PT-1000, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889202200522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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