fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r069-tall-171620503600018
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CANConstruction-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12003.256 3600000.00 4786080.00 10354.50 ???T?????T?????? 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.r069-tall-171620503600018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CANConstruction-PT-020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503600018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 641K 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 CANConstruction-PT-020-CTLFireability-2024-00
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2024-01
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2024-02
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2024-03
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2024-04
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2024-05
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2024-06
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2024-07
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2024-08
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2024-09
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2024-10
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2024-11
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2023-12
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2023-13
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2023-14
FORMULA_NAME CANConstruction-PT-020-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716361458080

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:04:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:04:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:04:19] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-22 07:04:19] [INFO ] Transformed 1042 places.
[2024-05-22 07:04:19] [INFO ] Transformed 1760 transitions.
[2024-05-22 07:04:19] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 135 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 309 places :
Symmetric choice reduction at 0 with 309 rule applications. Total rules 309 place count 733 transition count 1142
Iterating global reduction 0 with 309 rules applied. Total rules applied 618 place count 733 transition count 1142
Applied a total of 618 rules in 135 ms. Remains 733 /1042 variables (removed 309) and now considering 1142/1760 (removed 618) transitions.
// Phase 1: matrix 1142 rows 733 cols
[2024-05-22 07:04:19] [INFO ] Computed 41 invariants in 31 ms
[2024-05-22 07:04:20] [INFO ] Implicit Places using invariants in 491 ms returned [12, 26, 40, 54, 68, 82, 96, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 523 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 715/1042 places, 1142/1760 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 698 transition count 1125
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 698 transition count 1125
Applied a total of 34 rules in 125 ms. Remains 698 /715 variables (removed 17) and now considering 1125/1142 (removed 17) transitions.
// Phase 1: matrix 1125 rows 698 cols
[2024-05-22 07:04:20] [INFO ] Computed 23 invariants in 12 ms
[2024-05-22 07:04:20] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-22 07:04:20] [INFO ] Invariant cache hit.
[2024-05-22 07:04:21] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:04:22] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 698/1042 places, 1125/1760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2880 ms. Remains : 698/1042 places, 1125/1760 transitions.
Support contains 135 out of 698 places after structural reductions.
[2024-05-22 07:04:22] [INFO ] Flatten gal took : 107 ms
[2024-05-22 07:04:22] [INFO ] Flatten gal took : 68 ms
[2024-05-22 07:04:23] [INFO ] Input system was already deterministic with 1125 transitions.
RANDOM walk for 40000 steps (113 resets) in 1859 ms. (21 steps per ms) remains 5/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
[2024-05-22 07:04:23] [INFO ] Invariant cache hit.
[2024-05-22 07:04:23] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 670/684 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:04:24] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 17 ms to minimize.
[2024-05-22 07:04:24] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 9 ms to minimize.
[2024-05-22 07:04:24] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:04:24] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-22 07:04:25] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:04:25] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-22 07:04:25] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-22 07:04:25] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 2 ms to minimize.
[2024-05-22 07:04:25] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2024-05-22 07:04:25] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 4 ms to minimize.
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 3 ms to minimize.
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 3 ms to minimize.
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 4 ms to minimize.
[2024-05-22 07:04:26] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/684 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/684 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 11/695 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 07:04:27] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 4 ms to minimize.
[2024-05-22 07:04:27] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 4 ms to minimize.
[2024-05-22 07:04:27] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 4 ms to minimize.
[2024-05-22 07:04:27] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2024-05-22 07:04:28] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 4 ms to minimize.
[2024-05-22 07:04:28] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 4 ms to minimize.
[2024-05-22 07:04:28] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2024-05-22 07:04:28] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 4 ms to minimize.
[2024-05-22 07:04:29] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
SMT process timed out in 5089ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 698 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 698/698 places, 1125/1125 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 123 rules applied. Total rules applied 123 place count 698 transition count 1002
Reduce places removed 123 places and 0 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 246 place count 575 transition count 1002
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 246 place count 575 transition count 984
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 282 place count 557 transition count 984
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 327 place count 512 transition count 894
Iterating global reduction 2 with 45 rules applied. Total rules applied 372 place count 512 transition count 894
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 15 rules applied. Total rules applied 387 place count 512 transition count 879
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 402 place count 497 transition count 879
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 440 place count 478 transition count 860
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 444 place count 478 transition count 856
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 448 place count 474 transition count 856
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 452 place count 474 transition count 856
Applied a total of 452 rules in 240 ms. Remains 474 /698 variables (removed 224) and now considering 856/1125 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 474/698 places, 856/1125 transitions.
RANDOM walk for 40000 steps (294 resets) in 509 ms. (78 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 62 ms. (634 steps per ms) remains 1/2 properties
// Phase 1: matrix 856 rows 474 cols
[2024-05-22 07:04:29] [INFO ] Computed 23 invariants in 4 ms
[2024-05-22 07:04:29] [INFO ] State equation strengthened by 784 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 451/453 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:29] [INFO ] Deduced a trap composed of 2 places in 141 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/471 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:29] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:04:30] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:04:30] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:04:30] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:04:30] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:04:30] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:04:30] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:04:30] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 10 ms to minimize.
[2024-05-22 07:04:30] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-22 07:04:31] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:04:31] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:04:31] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:04:31] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 3 ms to minimize.
[2024-05-22 07:04:31] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:04:31] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:04:31] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/473 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 856/1329 variables, 473/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1329 variables, 784/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1329 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1330 variables, 1/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1330 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1330 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1330/1330 variables, and 1298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2567 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 474/474 constraints, ReadFeed: 784/784 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 451/453 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/471 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:32] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-05-22 07:04:32] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:04:32] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-05-22 07:04:32] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:04:32] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:04:33] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-05-22 07:04:33] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-22 07:04:33] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:04:33] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:04:33] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:04:33] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:04:33] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 5 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:04:34] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-22 07:04:35] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:04:36] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:04:36] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:04:36] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:04:36] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:04:36] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:04:36] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:04:36] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:04:37] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:04:37] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:04:37] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:04:37] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:04:37] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:04:37] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:37] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-22 07:04:37] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:04:38] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:04:38] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:04:38] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
[2024-05-22 07:04:38] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:04:38] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:04:38] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:04:38] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:04:38] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:04:39] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:04:39] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:04:39] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:04:39] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:04:39] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:04:39] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:04:39] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:04:39] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:04:39] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:04:40] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:04:41] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:04:42] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:04:43] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 3 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-22 07:04:44] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:04:45] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:04:46] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:04:46] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:04:46] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:04:46] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/471 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/471 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/473 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 856/1329 variables, 473/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1329 variables, 784/1419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1329 variables, 1/1420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1329 variables, 0/1420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1330 variables, 1/1421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1330 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1330 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1330/1330 variables, and 1421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14595 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 474/474 constraints, ReadFeed: 784/784 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 139/139 constraints]
After SMT, in 17213ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 767 steps, including 82 resets, run visited all 1 properties in 4 ms. (steps per millisecond=191 )
Parikh walk visited 1 properties in 8 ms.
[2024-05-22 07:04:46] [INFO ] Flatten gal took : 40 ms
[2024-05-22 07:04:46] [INFO ] Flatten gal took : 49 ms
[2024-05-22 07:04:46] [INFO ] Input system was already deterministic with 1125 transitions.
Computed a total of 64 stabilizing places and 83 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 698/698 places, 1125/1125 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 698 transition count 1005
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 578 transition count 1005
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 240 place count 578 transition count 986
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 278 place count 559 transition count 986
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 324 place count 513 transition count 894
Iterating global reduction 2 with 46 rules applied. Total rules applied 370 place count 513 transition count 894
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 383 place count 513 transition count 881
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 396 place count 500 transition count 881
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 434 place count 481 transition count 862
Applied a total of 434 rules in 107 ms. Remains 481 /698 variables (removed 217) and now considering 862/1125 (removed 263) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 108 ms. Remains : 481/698 places, 862/1125 transitions.
[2024-05-22 07:04:47] [INFO ] Flatten gal took : 24 ms
[2024-05-22 07:04:47] [INFO ] Flatten gal took : 32 ms
[2024-05-22 07:04:47] [INFO ] Input system was already deterministic with 862 transitions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1125/1125 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 650 transition count 1030
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 650 transition count 1030
Applied a total of 96 rules in 83 ms. Remains 650 /698 variables (removed 48) and now considering 1030/1125 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 650/698 places, 1030/1125 transitions.
[2024-05-22 07:04:47] [INFO ] Flatten gal took : 44 ms
[2024-05-22 07:04:47] [INFO ] Flatten gal took : 46 ms
[2024-05-22 07:04:47] [INFO ] Input system was already deterministic with 1030 transitions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1125/1125 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 649 transition count 1028
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 649 transition count 1028
Applied a total of 98 rules in 24 ms. Remains 649 /698 variables (removed 49) and now considering 1028/1125 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 649/698 places, 1028/1125 transitions.
[2024-05-22 07:04:47] [INFO ] Flatten gal took : 27 ms
[2024-05-22 07:04:47] [INFO ] Flatten gal took : 38 ms
[2024-05-22 07:04:47] [INFO ] Input system was already deterministic with 1028 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 698/698 places, 1125/1125 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 124 place count 698 transition count 1001
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 248 place count 574 transition count 1001
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 248 place count 574 transition count 983
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 284 place count 556 transition count 983
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 334 place count 506 transition count 883
Iterating global reduction 2 with 50 rules applied. Total rules applied 384 place count 506 transition count 883
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 2 with 17 rules applied. Total rules applied 401 place count 506 transition count 866
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 418 place count 489 transition count 866
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 458 place count 469 transition count 846
Applied a total of 458 rules in 64 ms. Remains 469 /698 variables (removed 229) and now considering 846/1125 (removed 279) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 469/698 places, 846/1125 transitions.
[2024-05-22 07:04:47] [INFO ] Flatten gal took : 19 ms
[2024-05-22 07:04:47] [INFO ] Flatten gal took : 31 ms
[2024-05-22 07:04:47] [INFO ] Input system was already deterministic with 846 transitions.
RANDOM walk for 6548 steps (45 resets) in 30 ms. (211 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-020-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1125/1125 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 649 transition count 1028
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 649 transition count 1028
Applied a total of 98 rules in 37 ms. Remains 649 /698 variables (removed 49) and now considering 1028/1125 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 649/698 places, 1028/1125 transitions.
[2024-05-22 07:04:47] [INFO ] Flatten gal took : 22 ms
[2024-05-22 07:04:47] [INFO ] Flatten gal took : 39 ms
[2024-05-22 07:04:48] [INFO ] Input system was already deterministic with 1028 transitions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1125/1125 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 653 transition count 1036
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 653 transition count 1036
Applied a total of 90 rules in 21 ms. Remains 653 /698 variables (removed 45) and now considering 1036/1125 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 653/698 places, 1036/1125 transitions.
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 36 ms
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 25 ms
[2024-05-22 07:04:48] [INFO ] Input system was already deterministic with 1036 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 698/698 places, 1125/1125 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 698 transition count 1005
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 241 place count 578 transition count 1004
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 577 transition count 1004
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 242 place count 577 transition count 985
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 280 place count 558 transition count 985
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 329 place count 509 transition count 887
Iterating global reduction 3 with 49 rules applied. Total rules applied 378 place count 509 transition count 887
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 15 rules applied. Total rules applied 393 place count 509 transition count 872
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 408 place count 494 transition count 872
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 440 place count 478 transition count 856
Applied a total of 440 rules in 67 ms. Remains 478 /698 variables (removed 220) and now considering 856/1125 (removed 269) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 478/698 places, 856/1125 transitions.
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 19 ms
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 20 ms
[2024-05-22 07:04:48] [INFO ] Input system was already deterministic with 856 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 698/698 places, 1125/1125 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 124 place count 698 transition count 1001
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 248 place count 574 transition count 1001
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 248 place count 574 transition count 983
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 284 place count 556 transition count 983
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 334 place count 506 transition count 883
Iterating global reduction 2 with 50 rules applied. Total rules applied 384 place count 506 transition count 883
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 2 with 18 rules applied. Total rules applied 402 place count 506 transition count 865
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 420 place count 488 transition count 865
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 456 place count 470 transition count 847
Applied a total of 456 rules in 54 ms. Remains 470 /698 variables (removed 228) and now considering 847/1125 (removed 278) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 470/698 places, 847/1125 transitions.
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 18 ms
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 19 ms
[2024-05-22 07:04:48] [INFO ] Input system was already deterministic with 847 transitions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1125/1125 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 646 transition count 1022
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 646 transition count 1022
Applied a total of 104 rules in 25 ms. Remains 646 /698 variables (removed 52) and now considering 1022/1125 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 646/698 places, 1022/1125 transitions.
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 22 ms
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 23 ms
[2024-05-22 07:04:48] [INFO ] Input system was already deterministic with 1022 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 698/698 places, 1125/1125 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 123 rules applied. Total rules applied 123 place count 698 transition count 1002
Reduce places removed 123 places and 0 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 246 place count 575 transition count 1002
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 246 place count 575 transition count 984
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 282 place count 557 transition count 984
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 331 place count 508 transition count 886
Iterating global reduction 2 with 49 rules applied. Total rules applied 380 place count 508 transition count 886
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 2 with 16 rules applied. Total rules applied 396 place count 508 transition count 870
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 412 place count 492 transition count 870
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 452 place count 472 transition count 850
Applied a total of 452 rules in 54 ms. Remains 472 /698 variables (removed 226) and now considering 850/1125 (removed 275) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 472/698 places, 850/1125 transitions.
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 18 ms
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 19 ms
[2024-05-22 07:04:48] [INFO ] Input system was already deterministic with 850 transitions.
RANDOM walk for 765 steps (4 resets) in 11 ms. (63 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-020-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 698/698 places, 1125/1125 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 123 rules applied. Total rules applied 123 place count 698 transition count 1002
Reduce places removed 123 places and 0 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 246 place count 575 transition count 1002
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 246 place count 575 transition count 984
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 282 place count 557 transition count 984
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 333 place count 506 transition count 882
Iterating global reduction 2 with 51 rules applied. Total rules applied 384 place count 506 transition count 882
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 2 with 18 rules applied. Total rules applied 402 place count 506 transition count 864
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 420 place count 488 transition count 864
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 456 place count 470 transition count 846
Applied a total of 456 rules in 53 ms. Remains 470 /698 variables (removed 228) and now considering 846/1125 (removed 279) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 470/698 places, 846/1125 transitions.
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 17 ms
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 21 ms
[2024-05-22 07:04:48] [INFO ] Input system was already deterministic with 846 transitions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1125/1125 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 647 transition count 1024
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 647 transition count 1024
Applied a total of 102 rules in 19 ms. Remains 647 /698 variables (removed 51) and now considering 1024/1125 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 647/698 places, 1024/1125 transitions.
[2024-05-22 07:04:48] [INFO ] Flatten gal took : 21 ms
[2024-05-22 07:04:49] [INFO ] Flatten gal took : 37 ms
[2024-05-22 07:04:49] [INFO ] Input system was already deterministic with 1024 transitions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1125/1125 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 662 transition count 1054
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 662 transition count 1054
Applied a total of 72 rules in 18 ms. Remains 662 /698 variables (removed 36) and now considering 1054/1125 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 662/698 places, 1054/1125 transitions.
[2024-05-22 07:04:49] [INFO ] Flatten gal took : 22 ms
[2024-05-22 07:04:49] [INFO ] Flatten gal took : 23 ms
[2024-05-22 07:04:49] [INFO ] Input system was already deterministic with 1054 transitions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1125/1125 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 647 transition count 1024
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 647 transition count 1024
Applied a total of 102 rules in 32 ms. Remains 647 /698 variables (removed 51) and now considering 1024/1125 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 647/698 places, 1024/1125 transitions.
[2024-05-22 07:04:49] [INFO ] Flatten gal took : 20 ms
[2024-05-22 07:04:49] [INFO ] Flatten gal took : 22 ms
[2024-05-22 07:04:49] [INFO ] Input system was already deterministic with 1024 transitions.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1125/1125 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 651 transition count 1032
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 651 transition count 1032
Applied a total of 94 rules in 19 ms. Remains 651 /698 variables (removed 47) and now considering 1032/1125 (removed 93) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 651/698 places, 1032/1125 transitions.
[2024-05-22 07:04:49] [INFO ] Flatten gal took : 20 ms
[2024-05-22 07:04:49] [INFO ] Flatten gal took : 23 ms
[2024-05-22 07:04:49] [INFO ] Input system was already deterministic with 1032 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 698/698 places, 1125/1125 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 123 rules applied. Total rules applied 123 place count 698 transition count 1002
Reduce places removed 123 places and 0 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 246 place count 575 transition count 1002
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 246 place count 575 transition count 984
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 282 place count 557 transition count 984
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 331 place count 508 transition count 886
Iterating global reduction 2 with 49 rules applied. Total rules applied 380 place count 508 transition count 886
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 2 with 16 rules applied. Total rules applied 396 place count 508 transition count 870
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 412 place count 492 transition count 870
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 452 place count 472 transition count 850
Applied a total of 452 rules in 59 ms. Remains 472 /698 variables (removed 226) and now considering 850/1125 (removed 275) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 472/698 places, 850/1125 transitions.
[2024-05-22 07:04:49] [INFO ] Flatten gal took : 19 ms
[2024-05-22 07:04:49] [INFO ] Flatten gal took : 21 ms
[2024-05-22 07:04:49] [INFO ] Input system was already deterministic with 850 transitions.
[2024-05-22 07:04:49] [INFO ] Flatten gal took : 24 ms
[2024-05-22 07:04:49] [INFO ] Flatten gal took : 24 ms
[2024-05-22 07:04:49] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-22 07:04:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 698 places, 1125 transitions and 3859 arcs took 8 ms.
Total runtime 30391 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-020

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1049
MODEL NAME: /home/mcc/execution/407/model
698 places, 1125 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CANConstruction-PT-020"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CANConstruction-PT-020, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620503600018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-020.tgz
mv CANConstruction-PT-020 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;