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.r311-tall-171662337000610.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 greatspnxred
Input is Referendum-PT-0100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337000610
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 73K Apr 11 16:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 361K Apr 11 16:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Apr 11 16:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 254K Apr 11 16:28 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 52K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 189K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 146K Apr 11 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 748K Apr 11 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 690K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:47 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 113K 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-0100-CTLFireability-2024-00
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-01
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-02
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-03
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-04
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-05
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-06
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-07
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-08
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-09
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-10
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-11
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-12
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-13
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-14
FORMULA_NAME Referendum-PT-0100-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716763021071

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 22:37:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 22:37:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:37:02] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-26 22:37:02] [INFO ] Transformed 301 places.
[2024-05-26 22:37:02] [INFO ] Transformed 201 transitions.
[2024-05-26 22:37:02] [INFO ] Found NUPN structural information;
[2024-05-26 22:37:02] [INFO ] Parsed PT model containing 301 places and 201 transitions and 501 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 101 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 300 rules applied. Total rules applied 300 place count 101 transition count 101
Applied a total of 300 rules in 20 ms. Remains 101 /301 variables (removed 200) and now considering 101/201 (removed 100) transitions.
// Phase 1: matrix 101 rows 101 cols
[2024-05-26 22:37:02] [INFO ] Computed 0 invariants in 8 ms
[2024-05-26 22:37:02] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-26 22:37:02] [INFO ] Invariant cache hit.
[2024-05-26 22:37:02] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-26 22:37:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/201 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/202 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 202 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1985 ms.
Refiners :[Domain max(s): 101/101 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/201 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 100/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 1/202 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 302 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2720 ms.
Refiners :[Domain max(s): 101/101 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4766ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4782ms
Starting structural reductions in LTL mode, iteration 1 : 101/301 places, 101/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5100 ms. Remains : 101/301 places, 101/201 transitions.
Support contains 101 out of 101 places after structural reductions.
[2024-05-26 22:37:07] [INFO ] Flatten gal took : 48 ms
[2024-05-26 22:37:08] [INFO ] Flatten gal took : 31 ms
[2024-05-26 22:37:08] [INFO ] Input system was already deterministic with 101 transitions.
Reduction of identical properties reduced properties to check from 46 to 42
RANDOM walk for 40000 steps (392 resets) in 1365 ms. (29 steps per ms) remains 3/42 properties
BEST_FIRST walk for 40004 steps (8 resets) in 701 ms. (56 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 520 ms. (76 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
[2024-05-26 22:37:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 202/202 variables, and 202 constraints, problems are : Problem set: 3 solved, 0 unsolved in 208 ms.
Refiners :[Domain max(s): 101/101 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 283ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA Referendum-PT-0100-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:37:09] [INFO ] Flatten gal took : 16 ms
[2024-05-26 22:37:09] [INFO ] Flatten gal took : 19 ms
[2024-05-26 22:37:09] [INFO ] Input system was already deterministic with 101 transitions.
Computed a total of 101 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 101 transition count 101
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.
FORMULA Referendum-PT-0100-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 101/101 places, 101/101 transitions.
[2024-05-26 22:37:09] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:37:09] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:37:09] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 101/101 places, 101/101 transitions.
[2024-05-26 22:37:09] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:37:09] [INFO ] Flatten gal took : 28 ms
[2024-05-26 22:37:09] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 101/101 places, 101/101 transitions.
[2024-05-26 22:37:09] [INFO ] Flatten gal took : 30 ms
[2024-05-26 22:37:09] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:37:09] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 101/101 places, 101/101 transitions.
[2024-05-26 22:37:09] [INFO ] Flatten gal took : 7 ms
[2024-05-26 22:37:09] [INFO ] Flatten gal took : 6 ms
[2024-05-26 22:37:09] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 101/101 places, 101/101 transitions.
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 5 ms
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 5 ms
[2024-05-26 22:37:10] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 99 place count 2 transition count 2
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 2 transition count 2
Applied a total of 198 rules in 5 ms. Remains 2 /101 variables (removed 99) and now considering 2/101 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 2/101 places, 2/101 transitions.
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:10] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 11 transition count 11
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 11 transition count 11
Applied a total of 180 rules in 2 ms. Remains 11 /101 variables (removed 90) and now considering 11/101 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 11/101 places, 11/101 transitions.
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:10] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 10 transition count 10
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 10 transition count 10
Applied a total of 182 rules in 2 ms. Remains 10 /101 variables (removed 91) and now considering 10/101 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 10/101 places, 10/101 transitions.
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:10] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 6 transition count 6
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 6 transition count 6
Applied a total of 190 rules in 2 ms. Remains 6 /101 variables (removed 95) and now considering 6/101 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 6/101 places, 6/101 transitions.
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:10] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 3 transition count 3
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 3 transition count 3
Applied a total of 196 rules in 1 ms. Remains 3 /101 variables (removed 98) and now considering 3/101 (removed 98) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 3/101 places, 3/101 transitions.
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:10] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 85 place count 16 transition count 16
Iterating global reduction 0 with 85 rules applied. Total rules applied 170 place count 16 transition count 16
Applied a total of 170 rules in 1 ms. Remains 16 /101 variables (removed 85) and now considering 16/101 (removed 85) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/101 places, 16/101 transitions.
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:10] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 10 transition count 10
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 10 transition count 10
Applied a total of 182 rules in 2 ms. Remains 10 /101 variables (removed 91) and now considering 10/101 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 10/101 places, 10/101 transitions.
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:10] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 101/101 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 3 transition count 3
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 3 transition count 3
Applied a total of 196 rules in 1 ms. Remains 3 /101 variables (removed 98) and now considering 3/101 (removed 98) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 3/101 places, 3/101 transitions.
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:10] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 10 ms
[2024-05-26 22:37:10] [INFO ] Flatten gal took : 10 ms
[2024-05-26 22:37:10] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 16 ms.
[2024-05-26 22:37:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 101 places, 101 transitions and 201 arcs took 3 ms.
Total runtime 7968 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Referendum-PT-0100

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 101
TRANSITIONS: 101
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 542
MODEL NAME: /home/mcc/execution/413/model
101 places, 101 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Referendum-PT-0100-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0100-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716763031463

--------------------
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

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-0100"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Referendum-PT-0100, 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 r311-tall-171662337000610"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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