Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662338900594.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Referendum-PT-0020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662338900594
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 16K Apr 11 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 11 16:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 37K Apr 11 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 305K Apr 11 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 23K May 18 16:43 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-0020-CTLFireability-2024-00
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-01
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-02
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-03
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-04
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-05
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-06
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-07
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-08
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-09
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-10
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-11
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-12
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-13
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-14
FORMULA_NAME Referendum-PT-0020-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717261830214

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-0020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:10:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:10:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:10:31] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2024-06-01 17:10:31] [INFO ] Transformed 61 places.
[2024-06-01 17:10:31] [INFO ] Transformed 41 transitions.
[2024-06-01 17:10:31] [INFO ] Found NUPN structural information;
[2024-06-01 17:10:31] [INFO ] Parsed PT model containing 61 places and 41 transitions and 101 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
FORMULA Referendum-PT-0020-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 21 transition count 21
Applied a total of 60 rules in 18 ms. Remains 21 /61 variables (removed 40) and now considering 21/41 (removed 20) transitions.
// Phase 1: matrix 21 rows 21 cols
[2024-06-01 17:10:31] [INFO ] Computed 0 invariants in 3 ms
[2024-06-01 17:10:31] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 17:10:31] [INFO ] Invariant cache hit.
[2024-06-01 17:10:31] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-06-01 17:10:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 21/41 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/42 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 235 ms.
Refiners :[Domain max(s): 21/21 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 21/41 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/42 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 222 ms.
Refiners :[Domain max(s): 21/21 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 496ms
Starting structural reductions in LTL mode, iteration 1 : 21/61 places, 21/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 702 ms. Remains : 21/61 places, 21/41 transitions.
Support contains 21 out of 21 places after structural reductions.
[2024-06-01 17:10:32] [INFO ] Flatten gal took : 19 ms
[2024-06-01 17:10:32] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:10:32] [INFO ] Input system was already deterministic with 21 transitions.
Reduction of identical properties reduced properties to check from 48 to 38
RANDOM walk for 40000 steps (1816 resets) in 1006 ms. (39 steps per ms) remains 1/38 properties
BEST_FIRST walk for 40004 steps (172 resets) in 987 ms. (40 steps per ms) remains 1/1 properties
[2024-06-01 17:10:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 42/42 variables, and 42 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Domain max(s): 21/21 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
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 2 formulas.
FORMULA Referendum-PT-0020-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 21/21 places, 21/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/21 places, 21/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 21/21 places, 21/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 21/21 places, 21/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 21/21 places, 21/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Graph (complete) has 20 edges and 21 vertex of which 15 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Applied a total of 1 rules in 8 ms. Remains 15 /21 variables (removed 6) and now considering 15/21 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 15/21 places, 15/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 0 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 4 transition count 4
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 4 transition count 4
Applied a total of 34 rules in 1 ms. Remains 4 /21 variables (removed 17) and now considering 4/21 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 4/21 places, 4/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 0 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 0 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Graph (complete) has 20 edges and 21 vertex of which 6 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Applied a total of 1 rules in 0 ms. Remains 6 /21 variables (removed 15) and now considering 6/21 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 6/21 places, 6/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 0 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 7 transition count 7
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 7 transition count 7
Applied a total of 28 rules in 1 ms. Remains 7 /21 variables (removed 14) and now considering 7/21 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 7/21 places, 7/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 0 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 0 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 9 transition count 9
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 9 transition count 9
Applied a total of 24 rules in 0 ms. Remains 9 /21 variables (removed 12) and now considering 9/21 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/21 places, 9/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Graph (complete) has 20 edges and 21 vertex of which 8 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /21 variables (removed 13) and now considering 8/21 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 8/21 places, 8/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Graph (complete) has 20 edges and 21 vertex of which 6 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Applied a total of 1 rules in 1 ms. Remains 6 /21 variables (removed 15) and now considering 6/21 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 6/21 places, 6/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 0 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 16 transition count 16
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 16 transition count 16
Applied a total of 10 rules in 0 ms. Remains 16 /21 variables (removed 5) and now considering 16/21 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/21 places, 16/21 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:10:33] [INFO ] Input system was already deterministic with 16 transitions.
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:10:33] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:10:33] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 17:10:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21 places, 21 transitions and 41 arcs took 2 ms.
Total runtime 2131 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-00
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-01
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-03
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-04
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-06
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-08
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-09
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-10
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-11
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-12
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-13
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-14
Could not compute solution for formula : Referendum-PT-0020-CTLFireability-2024-15

BK_STOP 1717261833950

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Referendum-PT-0020-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/501/ctl_0_
ctl formula name Referendum-PT-0020-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/501/ctl_1_
ctl formula name Referendum-PT-0020-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/501/ctl_2_
ctl formula name Referendum-PT-0020-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/501/ctl_3_
ctl formula name Referendum-PT-0020-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/501/ctl_4_
ctl formula name Referendum-PT-0020-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/501/ctl_5_
ctl formula name Referendum-PT-0020-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/501/ctl_6_
ctl formula name Referendum-PT-0020-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/501/ctl_7_
ctl formula name Referendum-PT-0020-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/501/ctl_8_
ctl formula name Referendum-PT-0020-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/501/ctl_9_
ctl formula name Referendum-PT-0020-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/501/ctl_10_
ctl formula name Referendum-PT-0020-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/501/ctl_11_
ctl formula name Referendum-PT-0020-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/501/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-0020"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Referendum-PT-0020, 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 r520-tall-171662338900594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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