fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r500-smll-171649587400073
Last Updated
July 7, 2024

About the Execution of LTSMin+red for HirschbergSinclair-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
594.500 70237.00 102076.00 437.60 ??????T??F?T?F?? normal

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.r500-smll-171649587400073.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 HirschbergSinclair-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587400073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 13 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 13 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 13 03:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 173K May 18 16:42 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 HirschbergSinclair-PT-15-CTLCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2023-12
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2023-13
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2023-14
FORMULA_NAME HirschbergSinclair-PT-15-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717238862975

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:47:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:47:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:47:45] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2024-06-01 10:47:45] [INFO ] Transformed 330 places.
[2024-06-01 10:47:45] [INFO ] Transformed 296 transitions.
[2024-06-01 10:47:45] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Support contains 130 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 323 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 320 transition count 293
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 320 transition count 293
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 317 transition count 290
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 317 transition count 290
Applied a total of 19 rules in 169 ms. Remains 317 /330 variables (removed 13) and now considering 290/296 (removed 6) transitions.
// Phase 1: matrix 290 rows 317 cols
[2024-06-01 10:47:46] [INFO ] Computed 27 invariants in 44 ms
[2024-06-01 10:47:46] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-06-01 10:47:46] [INFO ] Invariant cache hit.
[2024-06-01 10:47:47] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-06-01 10:47:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 22/316 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-01 10:47:57] [INFO ] Deduced a trap composed of 111 places in 286 ms of which 44 ms to minimize.
[2024-06-01 10:47:57] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 1/317 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 290/607 variables, 317/346 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/607 variables, and 346 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 22/316 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 1/317 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 290/607 variables, 317/346 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 275/621 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-01 10:48:40] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 5 ms to minimize.
[2024-06-01 10:48:40] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 4 ms to minimize.
[2024-06-01 10:48:40] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 4 ms to minimize.
[2024-06-01 10:48:41] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 5 ms to minimize.
[2024-06-01 10:48:41] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 4 ms to minimize.
[2024-06-01 10:48:43] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 5 ms to minimize.
[2024-06-01 10:48:44] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
[2024-06-01 10:48:46] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 4 ms to minimize.
[2024-06-01 10:48:47] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 4 ms to minimize.
[2024-06-01 10:48:47] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/607 variables, and 631 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 12/12 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 60470ms
Starting structural reductions in LTL mode, iteration 1 : 317/330 places, 290/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62600 ms. Remains : 317/330 places, 290/296 transitions.
Support contains 130 out of 317 places after structural reductions.
[2024-06-01 10:48:48] [INFO ] Flatten gal took : 105 ms
[2024-06-01 10:48:48] [INFO ] Flatten gal took : 48 ms
[2024-06-01 10:48:49] [INFO ] Input system was already deterministic with 290 transitions.
RANDOM walk for 40000 steps (132 resets) in 2376 ms. (16 steps per ms) remains 21/103 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
[2024-06-01 10:48:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp101 is UNSAT
At refinement iteration 1 (OVERLAPS) 237/269 variables, 21/21 constraints. Problems are: Problem set: 18 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/21 constraints. Problems are: Problem set: 18 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/275 variables, 2/23 constraints. Problems are: Problem set: 18 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/23 constraints. Problems are: Problem set: 18 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/293 variables, 4/27 constraints. Problems are: Problem set: 18 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/27 constraints. Problems are: Problem set: 18 solved, 3 unsolved
Problem AtomicPropp34 is UNSAT
At refinement iteration 7 (OVERLAPS) 290/583 variables, 293/320 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 0/320 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 24/607 variables, 24/344 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 0/344 constraints. Problems are: Problem set: 19 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/607 variables, 0/344 constraints. Problems are: Problem set: 19 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 607/607 variables, and 344 constraints, problems are : Problem set: 19 solved, 2 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 2 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 179/185 variables, 4/4 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/4 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/264 variables, 16/20 constraints. Problems are: Problem set: 20 solved, 1 unsolved
[2024-06-01 10:48:50] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-01 10:48:50] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 2/22 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/22 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/273 variables, 3/25 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/25 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/291 variables, 4/29 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/29 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 290/581 variables, 291/320 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/321 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 0/321 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/607 variables, 26/347 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/607 variables, 0/347 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/607 variables, 0/347 constraints. Problems are: Problem set: 20 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 607/607 variables, and 347 constraints, problems are : Problem set: 20 solved, 1 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 1/21 constraints, Known Traps: 2/2 constraints]
After SMT, in 1077ms problems are : Problem set: 20 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 290/290 transitions.
Graph (complete) has 612 edges and 317 vertex of which 295 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 138 rules applied. Total rules applied 139 place count 295 transition count 152
Reduce places removed 123 places and 0 transitions.
Graph (complete) has 275 edges and 172 vertex of which 119 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 126 rules applied. Total rules applied 265 place count 119 transition count 150
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 320 place count 117 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 320 place count 117 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 116 transition count 96
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 325 place count 116 transition count 93
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 328 place count 113 transition count 93
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 343 place count 98 transition count 78
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 4 with 74 rules applied. Total rules applied 417 place count 83 transition count 19
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 60 rules applied. Total rules applied 477 place count 24 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 478 place count 23 transition count 18
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 478 place count 23 transition count 8
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 501 place count 10 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 503 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 505 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 506 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 506 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 508 place count 6 transition count 5
Applied a total of 508 rules in 52 ms. Remains 6 /317 variables (removed 311) and now considering 5/290 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 6/317 places, 5/290 transitions.
RANDOM walk for 22 steps (3 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
FORMULA HirschbergSinclair-PT-15-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 23 ms
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 26 ms
[2024-06-01 10:48:51] [INFO ] Input system was already deterministic with 290 transitions.
Support contains 85 out of 317 places (down from 94) after GAL structural reductions.
FORMULA HirschbergSinclair-PT-15-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 317 stabilizing places and 290 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 317 transition count 290
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.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 309 transition count 290
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 19 place count 298 transition count 279
Iterating global reduction 1 with 11 rules applied. Total rules applied 30 place count 298 transition count 279
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 287 transition count 268
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 287 transition count 268
Applied a total of 52 rules in 35 ms. Remains 287 /317 variables (removed 30) and now considering 268/290 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 287/317 places, 268/290 transitions.
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 20 ms
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 21 ms
[2024-06-01 10:48:51] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Graph (complete) has 612 edges and 317 vertex of which 310 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Reduce places removed 12 places and 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 298 transition count 162
Reduce places removed 116 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 121 rules applied. Total rules applied 238 place count 182 transition count 157
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 243 place count 177 transition count 157
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 253 place count 167 transition count 147
Iterating global reduction 3 with 10 rules applied. Total rules applied 263 place count 167 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 264 place count 166 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 166 transition count 146
Applied a total of 265 rules in 32 ms. Remains 166 /317 variables (removed 151) and now considering 146/290 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 166/317 places, 146/290 transitions.
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 9 ms
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 11 ms
[2024-06-01 10:48:51] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Graph (complete) has 612 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 294 transition count 151
Reduce places removed 124 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 125 rules applied. Total rules applied 250 place count 170 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 251 place count 169 transition count 150
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 263 place count 157 transition count 138
Iterating global reduction 3 with 12 rules applied. Total rules applied 275 place count 157 transition count 138
Applied a total of 275 rules in 23 ms. Remains 157 /317 variables (removed 160) and now considering 138/290 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 157/317 places, 138/290 transitions.
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 9 ms
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 11 ms
[2024-06-01 10:48:51] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 310 transition count 290
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 17 place count 300 transition count 280
Iterating global reduction 1 with 10 rules applied. Total rules applied 27 place count 300 transition count 280
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 290 transition count 270
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 290 transition count 270
Applied a total of 47 rules in 32 ms. Remains 290 /317 variables (removed 27) and now considering 270/290 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 290/317 places, 270/290 transitions.
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 18 ms
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 20 ms
[2024-06-01 10:48:51] [INFO ] Input system was already deterministic with 270 transitions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 309 transition count 290
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 19 place count 298 transition count 279
Iterating global reduction 1 with 11 rules applied. Total rules applied 30 place count 298 transition count 279
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 287 transition count 268
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 287 transition count 268
Applied a total of 52 rules in 32 ms. Remains 287 /317 variables (removed 30) and now considering 268/290 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 287/317 places, 268/290 transitions.
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 18 ms
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 19 ms
[2024-06-01 10:48:51] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Graph (complete) has 612 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 295 transition count 151
Reduce places removed 125 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 126 rules applied. Total rules applied 252 place count 170 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 253 place count 169 transition count 150
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 264 place count 158 transition count 139
Iterating global reduction 3 with 11 rules applied. Total rules applied 275 place count 158 transition count 139
Applied a total of 275 rules in 23 ms. Remains 158 /317 variables (removed 159) and now considering 139/290 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 158/317 places, 139/290 transitions.
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 7 ms
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 8 ms
[2024-06-01 10:48:51] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 310 transition count 290
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 19 place count 298 transition count 278
Iterating global reduction 1 with 12 rules applied. Total rules applied 31 place count 298 transition count 278
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 43 place count 286 transition count 266
Iterating global reduction 1 with 12 rules applied. Total rules applied 55 place count 286 transition count 266
Applied a total of 55 rules in 29 ms. Remains 286 /317 variables (removed 31) and now considering 266/290 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 286/317 places, 266/290 transitions.
[2024-06-01 10:48:51] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:48:52] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 310 transition count 290
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 16 place count 301 transition count 281
Iterating global reduction 1 with 9 rules applied. Total rules applied 25 place count 301 transition count 281
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 292 transition count 272
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 292 transition count 272
Applied a total of 43 rules in 30 ms. Remains 292 /317 variables (removed 25) and now considering 272/290 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 292/317 places, 272/290 transitions.
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:48:52] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Graph (complete) has 612 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 295 transition count 162
Reduce places removed 114 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 181 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 231 place count 180 transition count 161
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 242 place count 169 transition count 150
Iterating global reduction 3 with 11 rules applied. Total rules applied 253 place count 169 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 254 place count 168 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 255 place count 168 transition count 149
Applied a total of 255 rules in 29 ms. Remains 168 /317 variables (removed 149) and now considering 149/290 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 168/317 places, 149/290 transitions.
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 8 ms
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 9 ms
[2024-06-01 10:48:52] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Graph (complete) has 612 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 294 transition count 150
Reduce places removed 125 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 126 rules applied. Total rules applied 252 place count 169 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 253 place count 168 transition count 149
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 265 place count 156 transition count 137
Iterating global reduction 3 with 12 rules applied. Total rules applied 277 place count 156 transition count 137
Applied a total of 277 rules in 21 ms. Remains 156 /317 variables (removed 161) and now considering 137/290 (removed 153) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 156/317 places, 137/290 transitions.
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 6 ms
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 7 ms
[2024-06-01 10:48:52] [INFO ] Input system was already deterministic with 137 transitions.
RANDOM walk for 365 steps (0 resets) in 9 ms. (36 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-15-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 309 transition count 290
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 19 place count 298 transition count 279
Iterating global reduction 1 with 11 rules applied. Total rules applied 30 place count 298 transition count 279
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 288 transition count 269
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 288 transition count 269
Applied a total of 50 rules in 31 ms. Remains 288 /317 variables (removed 29) and now considering 269/290 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 288/317 places, 269/290 transitions.
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 15 ms
[2024-06-01 10:48:52] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 309 transition count 290
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 20 place count 297 transition count 278
Iterating global reduction 1 with 12 rules applied. Total rules applied 32 place count 297 transition count 278
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 285 transition count 266
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 285 transition count 266
Applied a total of 56 rules in 33 ms. Remains 285 /317 variables (removed 32) and now considering 266/290 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 285/317 places, 266/290 transitions.
[2024-06-01 10:48:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 15 ms
FORMULA HirschbergSinclair-PT-15-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:48:52] [INFO ] Input system was already deterministic with 266 transitions.
Support contains 0 out of 285 places (down from 1) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 309 transition count 290
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 19 place count 298 transition count 279
Iterating global reduction 1 with 11 rules applied. Total rules applied 30 place count 298 transition count 279
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 287 transition count 268
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 287 transition count 268
Applied a total of 52 rules in 21 ms. Remains 287 /317 variables (removed 30) and now considering 268/290 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 287/317 places, 268/290 transitions.
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 13 ms
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:48:52] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 290/290 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 309 transition count 290
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 20 place count 297 transition count 278
Iterating global reduction 1 with 12 rules applied. Total rules applied 32 place count 297 transition count 278
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 285 transition count 266
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 285 transition count 266
Applied a total of 56 rules in 22 ms. Remains 285 /317 variables (removed 32) and now considering 266/290 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 285/317 places, 266/290 transitions.
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 13 ms
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:48:52] [INFO ] Input system was already deterministic with 266 transitions.
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 15 ms
[2024-06-01 10:48:52] [INFO ] Flatten gal took : 15 ms
[2024-06-01 10:48:52] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 10:48:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 317 places, 290 transitions and 884 arcs took 4 ms.
Total runtime 67563 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 : HirschbergSinclair-PT-15-CTLCardinality-2024-00
Could not compute solution for formula : HirschbergSinclair-PT-15-CTLCardinality-2024-01
Could not compute solution for formula : HirschbergSinclair-PT-15-CTLCardinality-2024-02
Could not compute solution for formula : HirschbergSinclair-PT-15-CTLCardinality-2024-03
Could not compute solution for formula : HirschbergSinclair-PT-15-CTLCardinality-2024-04
Could not compute solution for formula : HirschbergSinclair-PT-15-CTLCardinality-2024-05
Could not compute solution for formula : HirschbergSinclair-PT-15-CTLCardinality-2024-07
Could not compute solution for formula : HirschbergSinclair-PT-15-CTLCardinality-2024-08
Could not compute solution for formula : HirschbergSinclair-PT-15-CTLCardinality-2024-10
Could not compute solution for formula : HirschbergSinclair-PT-15-CTLCardinality-2023-12
Could not compute solution for formula : HirschbergSinclair-PT-15-CTLCardinality-2023-14
Could not compute solution for formula : HirschbergSinclair-PT-15-CTLCardinality-2023-15

BK_STOP 1717238933212

--------------------
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 HirschbergSinclair-PT-15-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/572/ctl_0_
ctl formula name HirschbergSinclair-PT-15-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/572/ctl_1_
ctl formula name HirschbergSinclair-PT-15-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/572/ctl_2_
ctl formula name HirschbergSinclair-PT-15-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/572/ctl_3_
ctl formula name HirschbergSinclair-PT-15-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/572/ctl_4_
ctl formula name HirschbergSinclair-PT-15-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/572/ctl_5_
ctl formula name HirschbergSinclair-PT-15-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/572/ctl_6_
ctl formula name HirschbergSinclair-PT-15-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/572/ctl_7_
ctl formula name HirschbergSinclair-PT-15-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/572/ctl_8_
ctl formula name HirschbergSinclair-PT-15-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/572/ctl_9_
ctl formula name HirschbergSinclair-PT-15-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/572/ctl_10_
ctl formula name HirschbergSinclair-PT-15-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/572/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-15"
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 HirschbergSinclair-PT-15, 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 r500-smll-171649587400073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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