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-171662337000609.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337000609
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-01
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-02
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-03
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-04
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-05
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-06
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-07
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-08
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-09
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-10
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-11
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-12
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-13
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-14
FORMULA_NAME Referendum-PT-0100-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716763019100

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
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:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 22:37:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:37:00] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-26 22:37:00] [INFO ] Transformed 301 places.
[2024-05-26 22:37:00] [INFO ] Transformed 201 transitions.
[2024-05-26 22:37:00] [INFO ] Found NUPN structural information;
[2024-05-26 22:37:00] [INFO ] Parsed PT model containing 301 places and 201 transitions and 501 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Support contains 301 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 8 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2024-05-26 22:37:00] [INFO ] Computed 100 invariants in 15 ms
[2024-05-26 22:37:00] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-26 22:37:00] [INFO ] Invariant cache hit.
[2024-05-26 22:37:00] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-26 22:37:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 201/301 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 201/401 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/502 variables, 301/702 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/502 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 702 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7441 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 301/301 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/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 201/301 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 201/401 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/502 variables, 301/702 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 200/902 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/502 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 902 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6351 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 13917ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 13934ms
Finished structural reductions in LTL mode , in 1 iterations and 14403 ms. Remains : 301/301 places, 201/201 transitions.
Support contains 301 out of 301 places after structural reductions.
[2024-05-26 22:37:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-26 22:37:15] [INFO ] Flatten gal took : 47 ms
[2024-05-26 22:37:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Referendum-PT-0100-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:37:15] [INFO ] Flatten gal took : 18 ms
[2024-05-26 22:37:15] [INFO ] Input system was already deterministic with 201 transitions.
RANDOM walk for 40000 steps (392 resets) in 3459 ms. (11 steps per ms) remains 7/40 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 655 ms. (60 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 7/7 properties
[2024-05-26 22:37:17] [INFO ] Invariant cache hit.
Problem AtomicPropp19 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/301 variables, 100/400 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 1/401 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 201/502 variables, 301/702 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/702 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/502 variables, 0/702 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 702 constraints, problems are : Problem set: 1 solved, 6 unsolved in 663 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/301 variables, 100/400 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 1/401 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 201/502 variables, 301/702 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 6/708 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/708 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/502 variables, 0/708 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 708 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1596 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 2388ms problems are : Problem set: 1 solved, 6 unsolved
Finished Parikh walk after 100 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=33 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 1045 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA Referendum-PT-0100-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:37:20] [INFO ] Flatten gal took : 14 ms
[2024-05-26 22:37:20] [INFO ] Flatten gal took : 14 ms
[2024-05-26 22:37:20] [INFO ] Input system was already deterministic with 201 transitions.
Computed a total of 301 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 301 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 2 formulas.
FORMULA Referendum-PT-0100-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 1 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 301/301 places, 201/201 transitions.
[2024-05-26 22:37:20] [INFO ] Flatten gal took : 12 ms
[2024-05-26 22:37:20] [INFO ] Flatten gal took : 12 ms
[2024-05-26 22:37:20] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 7 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 301/301 places, 201/201 transitions.
[2024-05-26 22:37:20] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:37:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Referendum-PT-0100-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:37:20] [INFO ] Flatten gal took : 11 ms
[2024-05-26 22:37:20] [INFO ] Input system was already deterministic with 201 transitions.
Support contains 0 out of 301 places (down from 301) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 201 transition count 201
Applied a total of 100 rules in 6 ms. Remains 201 /301 variables (removed 100) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 201/301 places, 201/201 transitions.
[2024-05-26 22:37:20] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:37:20] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:37:20] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 1 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 301/301 places, 201/201 transitions.
[2024-05-26 22:37:20] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:37:20] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:37:20] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 13 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 301/301 places, 201/201 transitions.
[2024-05-26 22:37:20] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:37:21] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 301/301 places, 201/201 transitions.
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:37:21] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Graph (complete) has 300 edges and 301 vertex of which 201 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.2 ms
Discarding 100 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 17 ms. Remains 200 /301 variables (removed 101) and now considering 200/201 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 200/301 places, 200/201 transitions.
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 5 ms
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:37:21] [INFO ] Input system was already deterministic with 200 transitions.
RANDOM walk for 40000 steps (396 resets) in 821 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9820 steps, run visited all 1 properties in 72 ms. (steps per millisecond=136 )
Probabilistic random walk after 9820 steps, saw 9741 distinct states, run finished after 76 ms. (steps per millisecond=129 ) properties seen :1
FORMULA Referendum-PT-0100-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 197 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 294 rules applied. Total rules applied 294 place count 104 transition count 104
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 388 place count 10 transition count 10
Iterating global reduction 1 with 94 rules applied. Total rules applied 482 place count 10 transition count 10
Applied a total of 482 rules in 9 ms. Remains 10 /301 variables (removed 291) and now considering 10/201 (removed 191) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 10/301 places, 10/201 transitions.
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:21] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Graph (complete) has 300 edges and 301 vertex of which 3 are kept as prefixes of interest. Removing 298 places using SCC suffix rule.1 ms
Discarding 298 places :
Also discarding 198 output transitions
Drop transitions (Output transitions of discarded places.) removed 198 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 4 ms. Remains 2 /301 variables (removed 299) and now considering 2/201 (removed 199) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 2/301 places, 2/201 transitions.
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:21] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 194 places and 0 transitions.
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 0 with 288 rules applied. Total rules applied 288 place count 107 transition count 107
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 380 place count 15 transition count 15
Iterating global reduction 1 with 92 rules applied. Total rules applied 472 place count 15 transition count 15
Applied a total of 472 rules in 3 ms. Remains 15 /301 variables (removed 286) and now considering 15/201 (removed 186) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 15/301 places, 15/201 transitions.
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:21] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Graph (complete) has 300 edges and 301 vertex of which 15 are kept as prefixes of interest. Removing 286 places using SCC suffix rule.1 ms
Discarding 286 places :
Also discarding 180 output transitions
Drop transitions (Output transitions of discarded places.) removed 180 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 15 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 15 transition count 15
Applied a total of 8 rules in 5 ms. Remains 15 /301 variables (removed 286) and now considering 15/201 (removed 186) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 15/301 places, 15/201 transitions.
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:21] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 292 rules applied. Total rules applied 292 place count 105 transition count 105
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 385 place count 12 transition count 12
Iterating global reduction 1 with 93 rules applied. Total rules applied 478 place count 12 transition count 12
Applied a total of 478 rules in 3 ms. Remains 12 /301 variables (removed 289) and now considering 12/201 (removed 189) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 12/301 places, 12/201 transitions.
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:37:21] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 9 ms
[2024-05-26 22:37:21] [INFO ] Flatten gal took : 8 ms
[2024-05-26 22:37:21] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-26 22:37:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 301 places, 201 transitions and 501 arcs took 2 ms.
Total runtime 21425 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: 301
TRANSITIONS: 201
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 557
MODEL NAME: /home/mcc/execution/413/model
301 places, 201 transitions.

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

BK_STOP 1716763100456

--------------------
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 CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-171662337000609"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;