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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15270.151 3578430.00 14280521.00 343.10 T???FFT????????? 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-167889202100506.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-0200, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202100506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 200K Feb 26 17:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 966K Feb 26 17:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 26 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 500K Feb 26 17:36 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 96K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 331K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 230K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 529K Feb 26 18:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Feb 26 18:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 253K Feb 26 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 58K 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 228K 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-0200-CTLFireability-00
FORMULA_NAME Referendum-PT-0200-CTLFireability-01
FORMULA_NAME Referendum-PT-0200-CTLFireability-02
FORMULA_NAME Referendum-PT-0200-CTLFireability-03
FORMULA_NAME Referendum-PT-0200-CTLFireability-04
FORMULA_NAME Referendum-PT-0200-CTLFireability-05
FORMULA_NAME Referendum-PT-0200-CTLFireability-06
FORMULA_NAME Referendum-PT-0200-CTLFireability-07
FORMULA_NAME Referendum-PT-0200-CTLFireability-08
FORMULA_NAME Referendum-PT-0200-CTLFireability-09
FORMULA_NAME Referendum-PT-0200-CTLFireability-10
FORMULA_NAME Referendum-PT-0200-CTLFireability-11
FORMULA_NAME Referendum-PT-0200-CTLFireability-12
FORMULA_NAME Referendum-PT-0200-CTLFireability-13
FORMULA_NAME Referendum-PT-0200-CTLFireability-14
FORMULA_NAME Referendum-PT-0200-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679142063917

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-0200
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 12:21:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 12:21:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 12:21:05] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-18 12:21:05] [INFO ] Transformed 601 places.
[2023-03-18 12:21:05] [INFO ] Transformed 401 transitions.
[2023-03-18 12:21:05] [INFO ] Found NUPN structural information;
[2023-03-18 12:21:05] [INFO ] Parsed PT model containing 601 places and 401 transitions and 1001 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Support contains 201 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 600 rules applied. Total rules applied 600 place count 201 transition count 201
Applied a total of 600 rules in 12 ms. Remains 201 /601 variables (removed 400) and now considering 201/401 (removed 200) transitions.
// Phase 1: matrix 201 rows 201 cols
[2023-03-18 12:21:05] [INFO ] Computed 0 place invariants in 14 ms
[2023-03-18 12:21:05] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-18 12:21:05] [INFO ] Invariant cache hit.
[2023-03-18 12:21:06] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2023-03-18 12:21:06] [INFO ] Invariant cache hit.
[2023-03-18 12:21:06] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/601 places, 201/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 201/601 places, 201/401 transitions.
Support contains 201 out of 201 places after structural reductions.
[2023-03-18 12:21:06] [INFO ] Flatten gal took : 60 ms
[2023-03-18 12:21:06] [INFO ] Flatten gal took : 36 ms
[2023-03-18 12:21:06] [INFO ] Input system was already deterministic with 201 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 33) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 12:21:07] [INFO ] Invariant cache hit.
[2023-03-18 12:21:08] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-18 12:21:09] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
[2023-03-18 12:21:09] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 45 ms
FORMULA Referendum-PT-0200-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 29 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 201 transitions.
Computed a total of 201 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 201 transition count 201
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 3 formulas.
FORMULA Referendum-PT-0200-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 201/201 places, 201/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 12 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 12 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 201/201 places, 201/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 14 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 16 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 199 place count 2 transition count 2
Iterating global reduction 0 with 199 rules applied. Total rules applied 398 place count 2 transition count 2
Applied a total of 398 rules in 10 ms. Remains 2 /201 variables (removed 199) and now considering 2/201 (removed 199) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 2/201 places, 2/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 199 place count 2 transition count 2
Iterating global reduction 0 with 199 rules applied. Total rules applied 398 place count 2 transition count 2
Applied a total of 398 rules in 4 ms. Remains 2 /201 variables (removed 199) and now considering 2/201 (removed 199) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 2/201 places, 2/201 transitions.
[2023-03-18 12:21:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
FORMULA Referendum-PT-0200-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 199 place count 2 transition count 2
Iterating global reduction 0 with 199 rules applied. Total rules applied 398 place count 2 transition count 2
Applied a total of 398 rules in 3 ms. Remains 2 /201 variables (removed 199) and now considering 2/201 (removed 199) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 2/201 places, 2/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 193 places :
Symmetric choice reduction at 0 with 193 rule applications. Total rules 193 place count 8 transition count 8
Iterating global reduction 0 with 193 rules applied. Total rules applied 386 place count 8 transition count 8
Applied a total of 386 rules in 3 ms. Remains 8 /201 variables (removed 193) and now considering 8/201 (removed 193) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 8/201 places, 8/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 190 places :
Symmetric choice reduction at 0 with 190 rule applications. Total rules 190 place count 11 transition count 11
Iterating global reduction 0 with 190 rules applied. Total rules applied 380 place count 11 transition count 11
Applied a total of 380 rules in 3 ms. Remains 11 /201 variables (removed 190) and now considering 11/201 (removed 190) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 11/201 places, 11/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 196 places :
Symmetric choice reduction at 0 with 196 rule applications. Total rules 196 place count 5 transition count 5
Iterating global reduction 0 with 196 rules applied. Total rules applied 392 place count 5 transition count 5
Applied a total of 392 rules in 4 ms. Remains 5 /201 variables (removed 196) and now considering 5/201 (removed 196) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 5/201 places, 5/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 197 place count 4 transition count 4
Iterating global reduction 0 with 197 rules applied. Total rules applied 394 place count 4 transition count 4
Applied a total of 394 rules in 3 ms. Remains 4 /201 variables (removed 197) and now considering 4/201 (removed 197) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 4/201 places, 4/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 197 place count 4 transition count 4
Iterating global reduction 0 with 197 rules applied. Total rules applied 394 place count 4 transition count 4
Applied a total of 394 rules in 2 ms. Remains 4 /201 variables (removed 197) and now considering 4/201 (removed 197) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 4/201 places, 4/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 198 place count 3 transition count 3
Iterating global reduction 0 with 198 rules applied. Total rules applied 396 place count 3 transition count 3
Applied a total of 396 rules in 3 ms. Remains 3 /201 variables (removed 198) and now considering 3/201 (removed 198) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 3/201 places, 3/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 197 place count 4 transition count 4
Iterating global reduction 0 with 197 rules applied. Total rules applied 394 place count 4 transition count 4
Applied a total of 394 rules in 3 ms. Remains 4 /201 variables (removed 197) and now considering 4/201 (removed 197) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 4/201 places, 4/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 197 place count 4 transition count 4
Iterating global reduction 0 with 197 rules applied. Total rules applied 394 place count 4 transition count 4
Applied a total of 394 rules in 3 ms. Remains 4 /201 variables (removed 197) and now considering 4/201 (removed 197) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 4/201 places, 4/201 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 1 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 0 ms
[2023-03-18 12:21:09] [INFO ] Input system was already deterministic with 4 transitions.
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 28 ms
[2023-03-18 12:21:09] [INFO ] Flatten gal took : 32 ms
[2023-03-18 12:21:09] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 15 ms.
[2023-03-18 12:21:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 201 places, 201 transitions and 401 arcs took 1 ms.
Total runtime 4712 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/461/ctl_0_ --ctl=/tmp/461/ctl_1_ --ctl=/tmp/461/ctl_2_ --ctl=/tmp/461/ctl_3_ --ctl=/tmp/461/ctl_4_ --ctl=/tmp/461/ctl_5_ --ctl=/tmp/461/ctl_6_ --ctl=/tmp/461/ctl_7_ --ctl=/tmp/461/ctl_8_ --ctl=/tmp/461/ctl_9_ --ctl=/tmp/461/ctl_10_ --ctl=/tmp/461/ctl_11_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 9834984 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16090452 kB
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-01
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-02
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-03
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-07
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-08
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-09
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-10
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-11
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-12
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-13
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-14
Could not compute solution for formula : Referendum-PT-0200-CTLFireability-15

BK_STOP 1679145642347

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-0200-CTLFireability-01
ctl formula formula --ctl=/tmp/461/ctl_0_
ctl formula name Referendum-PT-0200-CTLFireability-02
ctl formula formula --ctl=/tmp/461/ctl_1_
ctl formula name Referendum-PT-0200-CTLFireability-03
ctl formula formula --ctl=/tmp/461/ctl_2_
ctl formula name Referendum-PT-0200-CTLFireability-07
ctl formula formula --ctl=/tmp/461/ctl_3_
ctl formula name Referendum-PT-0200-CTLFireability-08
ctl formula formula --ctl=/tmp/461/ctl_4_
ctl formula name Referendum-PT-0200-CTLFireability-09
ctl formula formula --ctl=/tmp/461/ctl_5_
ctl formula name Referendum-PT-0200-CTLFireability-10
ctl formula formula --ctl=/tmp/461/ctl_6_
ctl formula name Referendum-PT-0200-CTLFireability-11
ctl formula formula --ctl=/tmp/461/ctl_7_
ctl formula name Referendum-PT-0200-CTLFireability-12
ctl formula formula --ctl=/tmp/461/ctl_8_
ctl formula name Referendum-PT-0200-CTLFireability-13
ctl formula formula --ctl=/tmp/461/ctl_9_
ctl formula name Referendum-PT-0200-CTLFireability-14
ctl formula formula --ctl=/tmp/461/ctl_10_
ctl formula name Referendum-PT-0200-CTLFireability-15
ctl formula formula --ctl=/tmp/461/ctl_11_
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 201 places, 201 transitions and 401 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: 201->1 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 201; 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: 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) : 467
Killing (9) : 467

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-0200"
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-0200, 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-167889202100506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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