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.r512-smll-171654407000161.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 PermAdmissibility-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407000161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 11K Apr 12 09:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 09:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 12 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 268K Apr 12 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 12 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 12 09:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 575K Apr 12 09:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K 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 PermAdmissibility-PT-02-CTLCardinality-2024-00
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-01
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-02
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-03
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-04
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-05
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-06
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-07
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-08
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-09
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-10
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-11
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-12
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-13
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-14
FORMULA_NAME PermAdmissibility-PT-02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717254174091

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:02:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:02:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:02:56] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2024-06-01 15:02:57] [INFO ] Transformed 168 places.
[2024-06-01 15:02:57] [INFO ] Transformed 592 transitions.
[2024-06-01 15:02:57] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 563 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 43 ms.
Support contains 157 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 164 transition count 592
Applied a total of 4 rules in 55 ms. Remains 164 /168 variables (removed 4) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 164 cols
[2024-06-01 15:02:57] [INFO ] Computed 28 invariants in 50 ms
[2024-06-01 15:02:57] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-06-01 15:02:57] [INFO ] Invariant cache hit.
[2024-06-01 15:02:58] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2024-06-01 15:02:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 8/111 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 53/164 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:03:14] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 32 ms to minimize.
[2024-06-01 15:03:14] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:03:15] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:03:16] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 4 ms to minimize.
[2024-06-01 15:03:16] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:03:17] [INFO ] Deduced a trap composed of 22 places in 327 ms of which 4 ms to minimize.
[2024-06-01 15:03:17] [INFO ] Deduced a trap composed of 28 places in 348 ms of which 3 ms to minimize.
[2024-06-01 15:03:17] [INFO ] Deduced a trap composed of 41 places in 362 ms of which 3 ms to minimize.
[2024-06-01 15:03:18] [INFO ] Deduced a trap composed of 24 places in 348 ms of which 19 ms to minimize.
[2024-06-01 15:03:18] [INFO ] Deduced a trap composed of 37 places in 354 ms of which 4 ms to minimize.
[2024-06-01 15:03:18] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 3 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 37 places in 360 ms of which 3 ms to minimize.
[2024-06-01 15:03:19] [INFO ] Deduced a trap composed of 29 places in 335 ms of which 3 ms to minimize.
[2024-06-01 15:03:20] [INFO ] Deduced a trap composed of 42 places in 343 ms of which 3 ms to minimize.
[2024-06-01 15:03:20] [INFO ] Deduced a trap composed of 20 places in 338 ms of which 5 ms to minimize.
[2024-06-01 15:03:20] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 3 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 26 places in 344 ms of which 3 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 3 ms to minimize.
[2024-06-01 15:03:21] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 2 ms to minimize.
[2024-06-01 15:03:22] [INFO ] Deduced a trap composed of 24 places in 343 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 588 unsolved
[2024-06-01 15:03:23] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-06-01 15:03:24] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:03:25] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:03:25] [INFO ] Deduced a trap composed of 24 places in 342 ms of which 3 ms to minimize.
[2024-06-01 15:03:26] [INFO ] Deduced a trap composed of 21 places in 351 ms of which 4 ms to minimize.
[2024-06-01 15:03:26] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 3 ms to minimize.
[2024-06-01 15:03:26] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 3 ms to minimize.
[2024-06-01 15:03:27] [INFO ] Deduced a trap composed of 31 places in 335 ms of which 4 ms to minimize.
[2024-06-01 15:03:27] [INFO ] Deduced a trap composed of 25 places in 325 ms of which 3 ms to minimize.
[2024-06-01 15:03:27] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 2 ms to minimize.
[2024-06-01 15:03:28] [INFO ] Deduced a trap composed of 33 places in 315 ms of which 3 ms to minimize.
[2024-06-01 15:03:28] [INFO ] Deduced a trap composed of 26 places in 304 ms of which 3 ms to minimize.
[2024-06-01 15:03:28] [INFO ] Deduced a trap composed of 41 places in 310 ms of which 3 ms to minimize.
[2024-06-01 15:03:29] [INFO ] Deduced a trap composed of 41 places in 301 ms of which 4 ms to minimize.
[2024-06-01 15:03:29] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 6 ms to minimize.
[2024-06-01 15:03:30] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 3 ms to minimize.
[2024-06-01 15:03:30] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 3 ms to minimize.
[2024-06-01 15:03:30] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 3 ms to minimize.
[2024-06-01 15:03:31] [INFO ] Deduced a trap composed of 21 places in 316 ms of which 3 ms to minimize.
SMT process timed out in 32425ms, After SMT, problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 32510ms
Starting structural reductions in LTL mode, iteration 1 : 164/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33901 ms. Remains : 164/168 places, 592/592 transitions.
Support contains 157 out of 164 places after structural reductions.
[2024-06-01 15:03:31] [INFO ] Flatten gal took : 222 ms
[2024-06-01 15:03:31] [INFO ] Flatten gal took : 133 ms
[2024-06-01 15:03:32] [INFO ] Input system was already deterministic with 592 transitions.
RANDOM walk for 40002 steps (849 resets) in 3530 ms. (11 steps per ms) remains 36/81 properties
BEST_FIRST walk for 4003 steps (20 resets) in 79 ms. (50 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (16 resets) in 54 ms. (72 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (17 resets) in 58 ms. (67 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (24 resets) in 89 ms. (44 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (15 resets) in 60 ms. (65 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (16 resets) in 54 ms. (72 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (19 resets) in 70 ms. (56 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (16 resets) in 60 ms. (65 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (16 resets) in 62 ms. (63 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (24 resets) in 89 ms. (44 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (16 resets) in 49 ms. (80 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (16 resets) in 55 ms. (71 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (21 resets) in 73 ms. (54 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (22 resets) in 62 ms. (63 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (24 resets) in 72 ms. (54 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (24 resets) in 27 ms. (143 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (16 resets) in 39 ms. (100 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (14 resets) in 43 ms. (91 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (20 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (22 resets) in 44 ms. (88 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (22 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (23 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (18 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (26 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (21 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (21 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (15 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (23 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (21 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
[2024-06-01 15:03:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp76 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/128 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 35 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 4 (OVERLAPS) 36/164 variables, 23/28 constraints. Problems are: Problem set: 33 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/28 constraints. Problems are: Problem set: 33 solved, 3 unsolved
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 6 (OVERLAPS) 592/756 variables, 164/192 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/192 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/756 variables, 0/192 constraints. Problems are: Problem set: 35 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 756/756 variables, and 192 constraints, problems are : Problem set: 35 solved, 1 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/20 variables, 1/1 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/161 variables, 24/25 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/25 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/164 variables, 3/28 constraints. Problems are: Problem set: 35 solved, 1 unsolved
[2024-06-01 15:03:35] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/29 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/29 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 592/756 variables, 164/193 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 1/194 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/756 variables, 0/194 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/756 variables, 0/194 constraints. Problems are: Problem set: 35 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 756/756 variables, and 194 constraints, problems are : Problem set: 35 solved, 1 unsolved in 933 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 1/36 constraints, Known Traps: 1/1 constraints]
After SMT, in 2038ms problems are : Problem set: 35 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 10 ms.
Successfully simplified 35 atomic propositions for a total of 16 simplifications.
FORMULA PermAdmissibility-PT-02-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:03:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 63 ms
[2024-06-01 15:03:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PermAdmissibility-PT-02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 49 ms
[2024-06-01 15:03:36] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 112 out of 164 places (down from 147) after GAL structural reductions.
Computed a total of 164 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 592
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 PermAdmissibility-PT-02-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 592/592 transitions.
Graph (complete) has 1575 edges and 164 vertex of which 128 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.6 ms
Discarding 36 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 121 transition count 480
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 121 transition count 480
Applied a total of 15 rules in 63 ms. Remains 121 /164 variables (removed 43) and now considering 480/592 (removed 112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 121/164 places, 480/592 transitions.
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 28 ms
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 33 ms
[2024-06-01 15:03:36] [INFO ] Input system was already deterministic with 480 transitions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 592/592 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 112 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 92 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 106 place count 78 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 120 place count 78 transition count 230
Applied a total of 120 rules in 38 ms. Remains 78 /164 variables (removed 86) and now considering 230/592 (removed 362) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 78/164 places, 230/592 transitions.
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 22 ms
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 17 ms
[2024-06-01 15:03:36] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 592/592 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 86 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 112 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 136 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 160 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 163 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 166 place count 51 transition count 84
Applied a total of 166 rules in 21 ms. Remains 51 /164 variables (removed 113) and now considering 84/592 (removed 508) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 51/164 places, 84/592 transitions.
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:03:36] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 592/592 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 86 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 112 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 136 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 160 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 162 place count 52 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 164 place count 52 transition count 92
Applied a total of 164 rules in 12 ms. Remains 52 /164 variables (removed 112) and now considering 92/592 (removed 500) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 52/164 places, 92/592 transitions.
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:03:36] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 592/592 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 105 transition count 592
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 82 transition count 358
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 82 transition count 358
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 122 place count 65 transition count 158
Iterating global reduction 1 with 17 rules applied. Total rules applied 139 place count 65 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 64 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 64 transition count 150
Applied a total of 141 rules in 10 ms. Remains 64 /164 variables (removed 100) and now considering 150/592 (removed 442) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 64/164 places, 150/592 transitions.
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:03:36] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 592/592 transitions.
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 106 transition count 592
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 85 transition count 364
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 85 transition count 364
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 114 place count 71 transition count 192
Iterating global reduction 1 with 14 rules applied. Total rules applied 128 place count 71 transition count 192
Applied a total of 128 rules in 9 ms. Remains 71 /164 variables (removed 93) and now considering 192/592 (removed 400) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 71/164 places, 192/592 transitions.
[2024-06-01 15:03:36] [INFO ] Flatten gal took : 12 ms
[2024-06-01 15:03:37] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:03:37] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 592/592 transitions.
Graph (complete) has 1575 edges and 164 vertex of which 105 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.4 ms
Discarding 59 places :
Also discarding 0 output transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 79 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 79 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 77 place count 55 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 101 place count 55 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 104 place count 52 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 107 place count 52 transition count 84
Applied a total of 107 rules in 22 ms. Remains 52 /164 variables (removed 112) and now considering 84/592 (removed 508) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 52/164 places, 84/592 transitions.
[2024-06-01 15:03:37] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:03:37] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:03:37] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 592/592 transitions.
Graph (complete) has 1575 edges and 164 vertex of which 104 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.4 ms
Discarding 60 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 79 transition count 348
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 79 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 73 place count 57 transition count 118
Iterating global reduction 0 with 22 rules applied. Total rules applied 95 place count 57 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 55 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 55 transition count 102
Applied a total of 99 rules in 23 ms. Remains 55 /164 variables (removed 109) and now considering 102/592 (removed 490) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 55/164 places, 102/592 transitions.
[2024-06-01 15:03:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:03:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:03:37] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 651 steps (11 resets) in 18 ms. (34 steps per ms) remains 0/1 properties
FORMULA PermAdmissibility-PT-02-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 592/592 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 115 transition count 592
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 103 transition count 436
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 103 transition count 436
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 101 transition count 406
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 101 transition count 406
Applied a total of 77 rules in 8 ms. Remains 101 /164 variables (removed 63) and now considering 406/592 (removed 186) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 101/164 places, 406/592 transitions.
[2024-06-01 15:03:37] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:03:37] [INFO ] Flatten gal took : 22 ms
[2024-06-01 15:03:37] [INFO ] Input system was already deterministic with 406 transitions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 592/592 transitions.
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 107 transition count 592
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 85 transition count 360
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 85 transition count 360
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 116 place count 70 transition count 178
Iterating global reduction 1 with 15 rules applied. Total rules applied 131 place count 70 transition count 178
Applied a total of 131 rules in 7 ms. Remains 70 /164 variables (removed 94) and now considering 178/592 (removed 414) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 70/164 places, 178/592 transitions.
[2024-06-01 15:03:37] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:03:37] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:03:37] [INFO ] Input system was already deterministic with 178 transitions.
[2024-06-01 15:03:37] [INFO ] Flatten gal took : 33 ms
[2024-06-01 15:03:37] [INFO ] Flatten gal took : 34 ms
[2024-06-01 15:03:37] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 15:03:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 164 places, 592 transitions and 3424 arcs took 9 ms.
Total runtime 41253 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 : PermAdmissibility-PT-02-CTLCardinality-2024-00
Could not compute solution for formula : PermAdmissibility-PT-02-CTLCardinality-2024-01
Could not compute solution for formula : PermAdmissibility-PT-02-CTLCardinality-2024-02
Could not compute solution for formula : PermAdmissibility-PT-02-CTLCardinality-2024-06
Could not compute solution for formula : PermAdmissibility-PT-02-CTLCardinality-2024-08
Could not compute solution for formula : PermAdmissibility-PT-02-CTLCardinality-2024-11
Could not compute solution for formula : PermAdmissibility-PT-02-CTLCardinality-2024-12
Could not compute solution for formula : PermAdmissibility-PT-02-CTLCardinality-2024-14
Could not compute solution for formula : PermAdmissibility-PT-02-CTLCardinality-2024-15

BK_STOP 1717254218109

--------------------
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
mcc2024
ctl formula name PermAdmissibility-PT-02-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/646/ctl_0_
ctl formula name PermAdmissibility-PT-02-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/646/ctl_1_
ctl formula name PermAdmissibility-PT-02-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/646/ctl_2_
ctl formula name PermAdmissibility-PT-02-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/646/ctl_3_
ctl formula name PermAdmissibility-PT-02-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/646/ctl_4_
ctl formula name PermAdmissibility-PT-02-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/646/ctl_5_
ctl formula name PermAdmissibility-PT-02-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/646/ctl_6_
ctl formula name PermAdmissibility-PT-02-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/646/ctl_7_
ctl formula name PermAdmissibility-PT-02-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/646/ctl_8_
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="PermAdmissibility-PT-02"
export BK_EXAMINATION="CTLCardinality"
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 PermAdmissibility-PT-02, 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 r512-smll-171654407000161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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