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-171662337000618.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-0200, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337000618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 119K Apr 11 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 85K Apr 11 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 626K Apr 11 16:29 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 125K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 417K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 206K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 195K Apr 11 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 939K Apr 11 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 233K Apr 11 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 52K 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 228K 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-0200-CTLFireability-2024-00
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-01
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-02
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-03
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-04
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-05
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-06
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-07
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-08
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-09
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-10
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-11
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-12
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-13
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-14
FORMULA_NAME Referendum-PT-0200-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716763119127

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-0200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 22:38:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 22:38:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:38:40] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-26 22:38:40] [INFO ] Transformed 601 places.
[2024-05-26 22:38:40] [INFO ] Transformed 401 transitions.
[2024-05-26 22:38:40] [INFO ] Found NUPN structural information;
[2024-05-26 22:38:40] [INFO ] Parsed PT model containing 601 places and 401 transitions and 1001 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 46 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 21 ms. Remains 201 /601 variables (removed 400) and now considering 201/401 (removed 200) transitions.
// Phase 1: matrix 201 rows 201 cols
[2024-05-26 22:38:40] [INFO ] Computed 0 invariants in 10 ms
[2024-05-26 22:38:40] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-26 22:38:40] [INFO ] Invariant cache hit.
[2024-05-26 22:38:41] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-26 22:38:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 201/401 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 1/402 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 402 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6248 ms.
Refiners :[Domain max(s): 201/201 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 201/401 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 1/402 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 602 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7977 ms.
Refiners :[Domain max(s): 201/201 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 14354ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 14374ms
Starting structural reductions in LTL mode, iteration 1 : 201/601 places, 201/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14863 ms. Remains : 201/601 places, 201/401 transitions.
Support contains 201 out of 201 places after structural reductions.
[2024-05-26 22:38:55] [INFO ] Flatten gal took : 75 ms
[2024-05-26 22:38:56] [INFO ] Flatten gal took : 50 ms
[2024-05-26 22:38:56] [INFO ] Input system was already deterministic with 201 transitions.
Reduction of identical properties reduced properties to check from 43 to 37
RANDOM walk for 40000 steps (196 resets) in 2083 ms. (19 steps per ms) remains 1/37 properties
BEST_FIRST walk for 40004 steps (8 resets) in 615 ms. (64 steps per ms) remains 1/1 properties
[2024-05-26 22:38:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 402/402 variables, and 402 constraints, problems are : Problem set: 1 solved, 0 unsolved in 142 ms.
Refiners :[Domain max(s): 201/201 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-26 22:38:57] [INFO ] Flatten gal took : 38 ms
[2024-05-26 22:38:57] [INFO ] Flatten gal took : 28 ms
[2024-05-26 22:38:57] [INFO ] Input system was already deterministic with 201 transitions.
FORMULA Referendum-PT-0200-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 4 formulas.
FORMULA Referendum-PT-0200-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 5 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 201/201 places, 201/201 transitions.
[2024-05-26 22:38:57] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:38:57] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:38:57] [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 1 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 1 ms. Remains : 201/201 places, 201/201 transitions.
[2024-05-26 22:38:57] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:38:57] [INFO ] Flatten gal took : 13 ms
[2024-05-26 22:38:57] [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 1 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 1 ms. Remains : 201/201 places, 201/201 transitions.
[2024-05-26 22:38:57] [INFO ] Flatten gal took : 12 ms
[2024-05-26 22:38:57] [INFO ] Flatten gal took : 12 ms
[2024-05-26 22:38:58] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Graph (complete) has 200 edges and 201 vertex of which 1 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.0 ms
Discarding 200 places :
Also discarding 200 output transitions
Drop transitions (Output transitions of discarded places.) removed 200 transitions
Applied a total of 1 rules in 9 ms. Remains 1 /201 variables (removed 200) and now considering 1/201 (removed 200) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 1/201 places, 1/201 transitions.
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Input system was already deterministic with 1 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 9 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 9 ms. Remains : 2/201 places, 2/201 transitions.
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 194 places :
Symmetric choice reduction at 0 with 194 rule applications. Total rules 194 place count 7 transition count 7
Iterating global reduction 0 with 194 rules applied. Total rules applied 388 place count 7 transition count 7
Applied a total of 388 rules in 3 ms. Remains 7 /201 variables (removed 194) and now considering 7/201 (removed 194) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 7/201 places, 7/201 transitions.
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:38:58] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 192 place count 9 transition count 9
Iterating global reduction 0 with 192 rules applied. Total rules applied 384 place count 9 transition count 9
Applied a total of 384 rules in 2 ms. Remains 9 /201 variables (removed 192) and now considering 9/201 (removed 192) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 9/201 places, 9/201 transitions.
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:38:58] [INFO ] Input system was already deterministic with 9 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.
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Graph (complete) has 200 edges and 201 vertex of which 3 are kept as prefixes of interest. Removing 198 places using SCC suffix rule.0 ms
Discarding 198 places :
Also discarding 198 output transitions
Drop transitions (Output transitions of discarded places.) removed 198 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /201 variables (removed 198) and now considering 3/201 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 3/201 places, 3/201 transitions.
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:38:58] [INFO ] Input system was already deterministic with 3 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 2 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 2 ms. Remains : 8/201 places, 8/201 transitions.
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 194 places :
Symmetric choice reduction at 0 with 194 rule applications. Total rules 194 place count 7 transition count 7
Iterating global reduction 0 with 194 rules applied. Total rules applied 388 place count 7 transition count 7
Applied a total of 388 rules in 2 ms. Remains 7 /201 variables (removed 194) and now considering 7/201 (removed 194) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 7/201 places, 7/201 transitions.
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Input system was already deterministic with 7 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 2 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 2 ms. Remains : 8/201 places, 8/201 transitions.
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:38:58] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:38:58] [INFO ] Flatten gal took : 15 ms
[2024-05-26 22:38:58] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 16 ms.
[2024-05-26 22:38:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 201 places, 201 transitions and 401 arcs took 3 ms.
Total runtime 17958 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Referendum-PT-0200

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/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: 550
MODEL NAME: /home/mcc/execution/411/model
201 places, 201 transitions.

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

BK_STOP 1716763140738

--------------------
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-0200"
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-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 r311-tall-171662337000618"
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 ;