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.r536-tall-171690532300434.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 Sudoku-COL-AN04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532300434
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.2K Apr 12 11:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 11:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 11:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 11:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 11:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 12 11:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 11:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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 Sudoku-COL-AN04-CTLFireability-2024-00
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-01
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-02
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-03
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-04
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-05
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-06
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-07
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-08
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-09
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-10
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-11
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-12
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-13
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-14
FORMULA_NAME Sudoku-COL-AN04-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717256624088

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:43:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:43:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:43:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 15:43:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 15:43:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 541 ms
[2024-06-01 15:43:45] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 112 PT places and 64.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
[2024-06-01 15:43:46] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2024-06-01 15:43:46] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
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 11 formulas.
FORMULA Sudoku-COL-AN04-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
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 1 formulas.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-06-01 15:43:46] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:43:46] [INFO ] Flatten gal took : 1 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2024-06-01 15:43:46] [INFO ] Unfolded HLPN to a Petri net with 112 places and 64 transitions 256 arcs in 21 ms.
[2024-06-01 15:43:46] [INFO ] Unfolded 14 HLPN properties in 3 ms.
Support contains 48 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 27 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-06-01 15:43:46] [INFO ] Computed 11 invariants in 8 ms
[2024-06-01 15:43:46] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 15:43:46] [INFO ] Invariant cache hit.
[2024-06-01 15:43:46] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 48/112 places, 64/64 transitions.
Support contains 48 out of 48 places after structural reductions.
[2024-06-01 15:43:47] [INFO ] Flatten gal took : 98 ms
[2024-06-01 15:43:47] [INFO ] Flatten gal took : 70 ms
[2024-06-01 15:43:48] [INFO ] Input system was already deterministic with 64 transitions.
Reduction of identical properties reduced properties to check from 13 to 4
RANDOM walk for 40000 steps (2781 resets) in 1011 ms. (39 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (132 resets) in 1063 ms. (37 steps per ms) remains 1/1 properties
[2024-06-01 15:43:48] [INFO ] Invariant cache hit.
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 48/112 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 75 ms.
Refiners :[Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-06-01 15:43:49] [INFO ] Flatten gal took : 60 ms
[2024-06-01 15:43:49] [INFO ] Flatten gal took : 58 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 52 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
FORMULA Sudoku-COL-AN04-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 25 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 17 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 55 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
FORMULA Sudoku-COL-AN04-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 48/48 places, 64/64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:43:50] [INFO ] Input system was already deterministic with 64 transitions.
[2024-06-01 15:43:50] [INFO ] Flatten gal took : 47 ms
[2024-06-01 15:43:51] [INFO ] Flatten gal took : 47 ms
[2024-06-01 15:43:51] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 50 ms.
[2024-06-01 15:43:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 64 transitions and 192 arcs took 3 ms.
Total runtime 6205 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 : Sudoku-COL-AN04-CTLFireability-2024-00
Could not compute solution for formula : Sudoku-COL-AN04-CTLFireability-2024-03
Could not compute solution for formula : Sudoku-COL-AN04-CTLFireability-2024-04
Could not compute solution for formula : Sudoku-COL-AN04-CTLFireability-2024-05
Could not compute solution for formula : Sudoku-COL-AN04-CTLFireability-2024-06
Could not compute solution for formula : Sudoku-COL-AN04-CTLFireability-2024-07
Could not compute solution for formula : Sudoku-COL-AN04-CTLFireability-2024-08
Could not compute solution for formula : Sudoku-COL-AN04-CTLFireability-2024-09
Could not compute solution for formula : Sudoku-COL-AN04-CTLFireability-2024-10
Could not compute solution for formula : Sudoku-COL-AN04-CTLFireability-2024-12
Could not compute solution for formula : Sudoku-COL-AN04-CTLFireability-2024-13
Could not compute solution for formula : Sudoku-COL-AN04-CTLFireability-2024-14

BK_STOP 1717256631998

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 Sudoku-COL-AN04-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/497/ctl_0_
ctl formula name Sudoku-COL-AN04-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/497/ctl_1_
ctl formula name Sudoku-COL-AN04-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/497/ctl_2_
ctl formula name Sudoku-COL-AN04-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/497/ctl_3_
ctl formula name Sudoku-COL-AN04-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/497/ctl_4_
ctl formula name Sudoku-COL-AN04-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/497/ctl_5_
ctl formula name Sudoku-COL-AN04-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/497/ctl_6_
ctl formula name Sudoku-COL-AN04-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/497/ctl_7_
ctl formula name Sudoku-COL-AN04-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/497/ctl_8_
ctl formula name Sudoku-COL-AN04-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/497/ctl_9_
ctl formula name Sudoku-COL-AN04-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/497/ctl_10_
ctl formula name Sudoku-COL-AN04-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/497/ctl_11_
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="Sudoku-COL-AN04"
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 Sudoku-COL-AN04, 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 r536-tall-171690532300434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN04.tgz
mv Sudoku-COL-AN04 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 ;