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.r180-tall-171640604300817.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 itstools
Input is HealthRecord-PT-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604300817
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 125K 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 HealthRecord-PT-16-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716521149161

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-24 03:25:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:25:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:25:50] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-24 03:25:50] [INFO ] Transformed 453 places.
[2024-05-24 03:25:50] [INFO ] Transformed 594 transitions.
[2024-05-24 03:25:50] [INFO ] Found NUPN structural information;
[2024-05-24 03:25:50] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA HealthRecord-PT-16-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 89 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 393 transition count 526
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 393 transition count 526
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 145 place count 368 transition count 492
Iterating global reduction 0 with 25 rules applied. Total rules applied 170 place count 368 transition count 492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 172 place count 368 transition count 490
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 181 place count 359 transition count 474
Iterating global reduction 1 with 9 rules applied. Total rules applied 190 place count 359 transition count 474
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 193 place count 356 transition count 469
Iterating global reduction 1 with 3 rules applied. Total rules applied 196 place count 356 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 198 place count 354 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 200 place count 354 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 201 place count 353 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 202 place count 353 transition count 463
Applied a total of 202 rules in 113 ms. Remains 353 /453 variables (removed 100) and now considering 463/594 (removed 131) transitions.
// Phase 1: matrix 463 rows 353 cols
[2024-05-24 03:25:50] [INFO ] Computed 14 invariants in 25 ms
[2024-05-24 03:25:51] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-24 03:25:51] [INFO ] Invariant cache hit.
[2024-05-24 03:25:51] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-24 03:25:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:25:57] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 24 ms to minimize.
[2024-05-24 03:25:57] [INFO ] Deduced a trap composed of 150 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:25:57] [INFO ] Deduced a trap composed of 167 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:25:57] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 143 places in 101 ms of which 3 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 166 places in 94 ms of which 3 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 167 places in 96 ms of which 3 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 3 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:25:59] [INFO ] Deduced a trap composed of 153 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:25:59] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:25:59] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-24 03:25:59] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:25:59] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:25:59] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:25:59] [INFO ] Deduced a trap composed of 138 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:26:00] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:26:00] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:26:03] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 3 ms to minimize.
[2024-05-24 03:26:03] [INFO ] Deduced a trap composed of 152 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:26:03] [INFO ] Deduced a trap composed of 112 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:26:03] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:26:03] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:26:04] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:26:04] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:26:05] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:26:05] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:26:05] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:26:06] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:26:06] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:26:06] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:26:06] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 3 ms to minimize.
[2024-05-24 03:26:06] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 3 ms to minimize.
[2024-05-24 03:26:07] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:26:08] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:26:08] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2024-05-24 03:26:08] [INFO ] Deduced a trap composed of 154 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:26:08] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:26:09] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:26:09] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:26:10] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:26:11] [INFO ] Deduced a trap composed of 95 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:26:11] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 3 ms to minimize.
[2024-05-24 03:26:11] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:26:11] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 3 ms to minimize.
[2024-05-24 03:26:11] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:26:12] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:26:12] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:26:12] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:26:14] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 3 ms to minimize.
[2024-05-24 03:26:14] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:26:14] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:26:15] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:26:16] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:26:16] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:26:18] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/816 variables, and 74 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/353 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:26:24] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 3 ms to minimize.
[2024-05-24 03:26:24] [INFO ] Deduced a trap composed of 159 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:26:25] [INFO ] Deduced a trap composed of 114 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:26:25] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 3 ms to minimize.
[2024-05-24 03:26:26] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:26:26] [INFO ] Deduced a trap composed of 113 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:26:26] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:26:28] [INFO ] Deduced a trap composed of 108 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:26:28] [INFO ] Deduced a trap composed of 112 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:26:28] [INFO ] Deduced a trap composed of 101 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:26:30] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 463/816 variables, 353/438 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 462/900 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/816 variables, and 900 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 71/71 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in LTL mode, iteration 1 : 353/453 places, 463/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60936 ms. Remains : 353/453 places, 463/594 transitions.
Support contains 89 out of 353 places after structural reductions.
[2024-05-24 03:26:51] [INFO ] Flatten gal took : 57 ms
[2024-05-24 03:26:51] [INFO ] Flatten gal took : 22 ms
[2024-05-24 03:26:51] [INFO ] Input system was already deterministic with 463 transitions.
Support contains 88 out of 353 places (down from 89) after GAL structural reductions.
RANDOM walk for 40000 steps (212 resets) in 2481 ms. (16 steps per ms) remains 30/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
[2024-05-24 03:26:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 114/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 183/353 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 463/816 variables, 353/367 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/816 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/816 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/816 variables, and 367 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 114/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-24 03:26:54] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 2 ms to minimize.
[2024-05-24 03:26:54] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:26:54] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:26:54] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:26:54] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-24 03:26:54] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-24 03:26:55] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 6 (OVERLAPS) 183/353 variables, 6/21 constraints. Problems are: Problem set: 1 solved, 29 unsolved
[2024-05-24 03:26:55] [INFO ] Deduced a trap composed of 137 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:26:55] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:26:55] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 3 ms to minimize.
[2024-05-24 03:26:55] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:26:56] [INFO ] Deduced a trap composed of 150 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:26:56] [INFO ] Deduced a trap composed of 153 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:26:56] [INFO ] Deduced a trap composed of 140 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:26:56] [INFO ] Deduced a trap composed of 176 places in 104 ms of which 3 ms to minimize.
[2024-05-24 03:26:56] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
Problem AtomicPropp27 is UNSAT
[2024-05-24 03:26:56] [INFO ] Deduced a trap composed of 130 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:26:56] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:26:56] [INFO ] Deduced a trap composed of 77 places in 178 ms of which 6 ms to minimize.
[2024-05-24 03:26:57] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:26:57] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:26:57] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:26:57] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 3 ms to minimize.
[2024-05-24 03:26:57] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 17/38 constraints. Problems are: Problem set: 2 solved, 28 unsolved
[2024-05-24 03:26:57] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:26:57] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:26:57] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:26:57] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:26:58] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 5/43 constraints. Problems are: Problem set: 2 solved, 28 unsolved
[2024-05-24 03:26:58] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 463/816 variables, 353/397 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/816 variables, 28/425 constraints. Problems are: Problem set: 2 solved, 28 unsolved
[2024-05-24 03:26:59] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 1 ms to minimize.
SMT process timed out in 6259ms, After SMT, problems are : Problem set: 2 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 463/463 transitions.
Graph (trivial) has 313 edges and 353 vertex of which 32 / 353 are part of one of the 13 SCC in 3 ms
Free SCC test removed 19 places
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Graph (complete) has 662 edges and 334 vertex of which 326 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 326 transition count 324
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 115 rules applied. Total rules applied 222 place count 221 transition count 314
Reduce places removed 5 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 15 rules applied. Total rules applied 237 place count 216 transition count 304
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 249 place count 206 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 250 place count 205 transition count 302
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 250 place count 205 transition count 296
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 262 place count 199 transition count 296
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 271 place count 190 transition count 279
Iterating global reduction 5 with 9 rules applied. Total rules applied 280 place count 190 transition count 279
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 281 place count 189 transition count 278
Iterating global reduction 5 with 1 rules applied. Total rules applied 282 place count 189 transition count 278
Performed 45 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 372 place count 144 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 374 place count 144 transition count 230
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 376 place count 142 transition count 226
Iterating global reduction 6 with 2 rules applied. Total rules applied 378 place count 142 transition count 226
Performed 9 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 396 place count 133 transition count 296
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 399 place count 133 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 403 place count 133 transition count 289
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 404 place count 132 transition count 288
Iterating global reduction 7 with 1 rules applied. Total rules applied 405 place count 132 transition count 288
Free-agglomeration rule applied 15 times.
Iterating global reduction 7 with 15 rules applied. Total rules applied 420 place count 132 transition count 273
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 437 place count 117 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 440 place count 117 transition count 268
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 456 place count 117 transition count 268
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 461 place count 117 transition count 268
Applied a total of 461 rules in 135 ms. Remains 117 /353 variables (removed 236) and now considering 268/463 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 117/353 places, 268/463 transitions.
RANDOM walk for 40000 steps (42 resets) in 691 ms. (57 steps per ms) remains 19/28 properties
BEST_FIRST walk for 4003 steps (25 resets) in 18 ms. (210 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 13/17 properties
BEST_FIRST walk for 4000 steps (17 resets) in 12 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (20 resets) in 27 ms. (142 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (20 resets) in 26 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4001 steps (18 resets) in 12 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (23 resets) in 23 ms. (166 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (20 resets) in 21 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (23 resets) in 18 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (20 resets) in 17 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 12/12 properties
[2024-05-24 03:26:59] [INFO ] Flow matrix only has 265 transitions (discarded 3 similar events)
// Phase 1: matrix 265 rows 117 cols
[2024-05-24 03:26:59] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 03:26:59] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 92/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 265/382 variables, 117/124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 26/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/382 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 150 constraints, problems are : Problem set: 0 solved, 12 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 92/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 3 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:27:00] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-05-24 03:27:01] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-24 03:27:01] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 265/382 variables, 117/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 12/180 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/382 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 180 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1652 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 18/18 constraints]
After SMT, in 1940ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 11 properties in 461 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 268/268 transitions.
Graph (trivial) has 103 edges and 117 vertex of which 8 / 117 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 338 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 112 transition count 238
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 90 transition count 237
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 47 place count 90 transition count 232
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 57 place count 85 transition count 232
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 66 place count 76 transition count 216
Iterating global reduction 2 with 9 rules applied. Total rules applied 75 place count 76 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 75 place count 76 transition count 215
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 75 transition count 215
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 72 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 72 transition count 207
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 109 place count 59 transition count 194
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 129 place count 59 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 58 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 58 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 133 place count 58 transition count 169
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 57 transition count 167
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 57 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 141 place count 54 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 157 place count 54 transition count 151
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 166 place count 54 transition count 142
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 175 place count 45 transition count 142
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 190 place count 45 transition count 142
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 191 place count 44 transition count 140
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 44 transition count 140
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 193 place count 43 transition count 138
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 43 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 43 transition count 138
Applied a total of 195 rules in 52 ms. Remains 43 /117 variables (removed 74) and now considering 138/268 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 43/117 places, 138/268 transitions.
RANDOM walk for 40000 steps (4430 resets) in 324 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (648 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2496 steps, run visited all 1 properties in 19 ms. (steps per millisecond=131 )
Probabilistic random walk after 2496 steps, saw 900 distinct states, run finished after 24 ms. (steps per millisecond=104 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-16-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:27:02] [INFO ] Flatten gal took : 18 ms
[2024-05-24 03:27:02] [INFO ] Flatten gal took : 20 ms
[2024-05-24 03:27:02] [INFO ] Input system was already deterministic with 463 transitions.
Computed a total of 100 stabilizing places and 111 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 320 transition count 419
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 320 transition count 419
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 81 place count 305 transition count 398
Iterating global reduction 0 with 15 rules applied. Total rules applied 96 place count 305 transition count 398
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 99 place count 305 transition count 395
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 108 place count 296 transition count 379
Iterating global reduction 1 with 9 rules applied. Total rules applied 117 place count 296 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 293 transition count 373
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 293 transition count 373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 292 transition count 372
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 292 transition count 372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 291 transition count 371
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 291 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 128 place count 291 transition count 370
Applied a total of 128 rules in 37 ms. Remains 291 /353 variables (removed 62) and now considering 370/463 (removed 93) transitions.
// Phase 1: matrix 370 rows 291 cols
[2024-05-24 03:27:02] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 03:27:02] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-24 03:27:02] [INFO ] Invariant cache hit.
[2024-05-24 03:27:02] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2024-05-24 03:27:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-24 03:27:06] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:27:06] [INFO ] Deduced a trap composed of 138 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:27:06] [INFO ] Deduced a trap composed of 118 places in 91 ms of which 3 ms to minimize.
[2024-05-24 03:27:06] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:27:06] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:27:07] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:27:07] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:27:07] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:27:07] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:27:07] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:27:07] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:27:07] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:27:08] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:27:08] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:27:08] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:27:08] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:27:08] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:27:09] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:27:09] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:27:09] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-24 03:27:11] [INFO ] Deduced a trap composed of 140 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:27:11] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-24 03:27:14] [INFO ] Deduced a trap composed of 116 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:27:14] [INFO ] Deduced a trap composed of 136 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:27:15] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:27:15] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:27:15] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:27:16] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:27:16] [INFO ] Deduced a trap composed of 136 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:27:16] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-24 03:27:19] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-24 03:27:22] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:27:22] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 9 (OVERLAPS) 370/661 variables, 291/338 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/661 variables, and 338 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-24 03:27:35] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-24 03:27:37] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:27:39] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:27:39] [INFO ] Deduced a trap composed of 159 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-24 03:27:41] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-24 03:27:45] [INFO ] Deduced a trap composed of 151 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-05-24 03:27:46] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 10 (OVERLAPS) 370/661 variables, 291/345 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 369/714 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 661/661 variables, and 714 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 40/40 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 291/353 places, 370/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60396 ms. Remains : 291/353 places, 370/463 transitions.
[2024-05-24 03:28:02] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:28:02] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:28:02] [INFO ] Input system was already deterministic with 370 transitions.
[2024-05-24 03:28:02] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:28:02] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:28:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality435959560707666723.gal : 6 ms
[2024-05-24 03:28:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality7725470229569366503.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality435959560707666723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7725470229569366503.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.73581e+11,3.43502,89996,2,12070,5,261914,6,0,1536,569003,0


Converting to forward existential form...Done !
original formula: EF(!(E((!(EX((p295==0))) + !(EG(((p441==0)||(p82==1))))) U !(EX(((p130==0)||(p271==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!(EX((p295==0))) + !(EG(((p441==0)||(p82==1))))) U !(EX(((p130==0)||(p271==1)))))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...716
Detected timeout of ITS tools.
[2024-05-24 03:28:32] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:28:32] [INFO ] Applying decomposition
[2024-05-24 03:28:32] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4933153090629472611.txt' '-o' '/tmp/graph4933153090629472611.bin' '-w' '/tmp/graph4933153090629472611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4933153090629472611.bin' '-l' '-1' '-v' '-w' '/tmp/graph4933153090629472611.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:28:33] [INFO ] Decomposing Gal with order
[2024-05-24 03:28:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:28:33] [INFO ] Removed a total of 108 redundant transitions.
[2024-05-24 03:28:33] [INFO ] Flatten gal took : 55 ms
[2024-05-24 03:28:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 13 ms.
[2024-05-24 03:28:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality15148270993560239760.gal : 8 ms
[2024-05-24 03:28:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality9262810970493970721.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15148270993560239760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9262810970493970721.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.73581e+11,0.381646,16476,1048,123,22601,2861,700,45092,125,8486,0


Converting to forward existential form...Done !
original formula: EF(!(E((!(EX((i16.u82.p295==0))) + !(EG(((i20.u105.p441==0)||(i1.i0.u6.p82==1))))) U !(EX(((i4.i1.u26.p130==0)||(i14.i2.u74.p271==1))))))...156
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!(EX((i16.u82.p295==0))) + !(EG(((i20.u105.p441==0)||(i1.i0.u6.p82==1))))) U !(EX(((i4....208
Reverse transition relation is NOT exact ! Due to transitions t13, t239, t315, t316, t317, t318, t319, t331, t338, i1.i0.u6.t277, i1.i0.u6.t279, i1.i0.u6.t...1328
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,3.76795,115212,1,0,201202,6861,4684,409826,641,22492,361257
FORMULA HealthRecord-PT-16-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 321 transition count 420
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 321 transition count 420
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 79 place count 306 transition count 400
Iterating global reduction 0 with 15 rules applied. Total rules applied 94 place count 306 transition count 400
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 306 transition count 397
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 297 transition count 381
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 297 transition count 381
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 119 place count 293 transition count 373
Iterating global reduction 1 with 4 rules applied. Total rules applied 123 place count 293 transition count 373
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 291 transition count 371
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 291 transition count 371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 289 transition count 368
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 289 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 132 place count 289 transition count 367
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 288 transition count 365
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 288 transition count 365
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 287 transition count 363
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 287 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 287 transition count 362
Applied a total of 137 rules in 45 ms. Remains 287 /353 variables (removed 66) and now considering 362/463 (removed 101) transitions.
// Phase 1: matrix 362 rows 287 cols
[2024-05-24 03:28:37] [INFO ] Computed 14 invariants in 3 ms
[2024-05-24 03:28:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-24 03:28:37] [INFO ] Invariant cache hit.
[2024-05-24 03:28:37] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-24 03:28:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-24 03:28:40] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 6 ms to minimize.
[2024-05-24 03:28:41] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:28:41] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:28:41] [INFO ] Deduced a trap composed of 136 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:28:41] [INFO ] Deduced a trap composed of 126 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:28:41] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:28:41] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:28:42] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:28:42] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:28:42] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:28:42] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:28:42] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:28:42] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:28:43] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:28:43] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:28:44] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 2 ms to minimize.
[2024-05-24 03:28:44] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-24 03:28:46] [INFO ] Deduced a trap composed of 135 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:28:46] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:28:46] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-24 03:28:49] [INFO ] Deduced a trap composed of 135 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-24 03:28:51] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-24 03:28:57] [INFO ] Deduced a trap composed of 124 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:28:57] [INFO ] Deduced a trap composed of 121 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-24 03:28:58] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 3 ms to minimize.
[2024-05-24 03:28:59] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 2 ms to minimize.
[2024-05-24 03:28:59] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 1 ms to minimize.
[2024-05-24 03:28:59] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:28:59] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:28:59] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:28:59] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:28:59] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:29:00] [INFO ] Deduced a trap composed of 137 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 10 (OVERLAPS) 362/649 variables, 287/334 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/649 variables, and 334 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/649 variables, 287/334 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 361/695 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/649 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 649/649 variables, and 695 constraints, problems are : Problem set: 0 solved, 361 unsolved in 21558 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 33/33 constraints]
After SMT, in 51645ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 51650ms
Starting structural reductions in LTL mode, iteration 1 : 287/353 places, 362/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52071 ms. Remains : 287/353 places, 362/463 transitions.
[2024-05-24 03:29:29] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:29:29] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:29:29] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-24 03:29:29] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:29:29] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:29:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality8650387961564394109.gal : 2 ms
[2024-05-24 03:29:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality16313447388242710153.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8650387961564394109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16313447388242710153.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.66916e+11,5.12121,144448,2,13737,5,416205,6,0,1512,968032,0


Converting to forward existential form...Done !
original formula: EX((AX(AG(EX((p225==0)))) * EG(AF(((p202==0)&&(p332==1))))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(EX(!(!(E(TRUE U !(EX((p225==0))))))))),!(EG(!(((p202==0)&&(p332==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t19, t22, t24, t26, t29, t31, t32, t34, t35, t36, t37, t40, t41, t42...664
Detected timeout of ITS tools.
[2024-05-24 03:29:59] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:29:59] [INFO ] Applying decomposition
[2024-05-24 03:29:59] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18329892244872436572.txt' '-o' '/tmp/graph18329892244872436572.bin' '-w' '/tmp/graph18329892244872436572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18329892244872436572.bin' '-l' '-1' '-v' '-w' '/tmp/graph18329892244872436572.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:29:59] [INFO ] Decomposing Gal with order
[2024-05-24 03:29:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:29:59] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-24 03:29:59] [INFO ] Flatten gal took : 21 ms
[2024-05-24 03:29:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2024-05-24 03:29:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality10260503811737748339.gal : 6 ms
[2024-05-24 03:29:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7815811332859708204.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10260503811737748339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7815811332859708204.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.66916e+11,1.34806,38244,1490,40,55676,438,639,126212,73,943,0


Converting to forward existential form...Done !
original formula: EX((AX(AG(EX((i12.u63.p225==0)))) * EG(AF(((i9.u54.p202==0)&&(i16.u85.p332==1))))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(EX(!(!(E(TRUE U !(EX((i12.u63.p225==0))))))))),!(EG(!(((i9.u54.p202==0)&&(i16.u85.p332==1)))...168
Reverse transition relation is NOT exact ! Due to transitions t50, t135, t234, t326, i2.t300, i2.t290, i2.t288, i2.t287, i2.t286, i2.t284, i2.t281, i2.t275...1088
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,5.53691,147012,1,0,239420,775,4619,595833,348,1883,501346
FORMULA HealthRecord-PT-16-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 319 transition count 418
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 319 transition count 418
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 84 place count 303 transition count 396
Iterating global reduction 0 with 16 rules applied. Total rules applied 100 place count 303 transition count 396
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 103 place count 303 transition count 393
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 113 place count 293 transition count 375
Iterating global reduction 1 with 10 rules applied. Total rules applied 123 place count 293 transition count 375
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 127 place count 289 transition count 367
Iterating global reduction 1 with 4 rules applied. Total rules applied 131 place count 289 transition count 367
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 287 transition count 365
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 287 transition count 365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 285 transition count 362
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 285 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 140 place count 285 transition count 361
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 284 transition count 359
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 284 transition count 359
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 283 transition count 357
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 283 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 145 place count 283 transition count 356
Applied a total of 145 rules in 48 ms. Remains 283 /353 variables (removed 70) and now considering 356/463 (removed 107) transitions.
// Phase 1: matrix 356 rows 283 cols
[2024-05-24 03:30:04] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 03:30:05] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 03:30:05] [INFO ] Invariant cache hit.
[2024-05-24 03:30:05] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2024-05-24 03:30:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 134 places in 106 ms of which 3 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 116 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:30:10] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 1 ms to minimize.
[2024-05-24 03:30:10] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:30:11] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:30:11] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:30:13] [INFO ] Deduced a trap composed of 135 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:30:13] [INFO ] Deduced a trap composed of 144 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:30:13] [INFO ] Deduced a trap composed of 136 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:30:14] [INFO ] Deduced a trap composed of 133 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:30:15] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:30:18] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 356/639 variables, 283/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (OVERLAPS) 0/639 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 317 constraints, problems are : Problem set: 0 solved, 355 unsolved in 27811 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:30:35] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:30:35] [INFO ] Deduced a trap composed of 157 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:30:35] [INFO ] Deduced a trap composed of 135 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-24 03:30:38] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 2 ms to minimize.
[2024-05-24 03:30:39] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 356/639 variables, 283/322 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 355/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 10 (OVERLAPS) 0/639 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Int declared 639/639 variables, and 677 constraints, problems are : Problem set: 0 solved, 355 unsolved in 24074 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 25/25 constraints]
After SMT, in 51959ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 51973ms
Starting structural reductions in LTL mode, iteration 1 : 283/353 places, 356/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52295 ms. Remains : 283/353 places, 356/463 transitions.
[2024-05-24 03:30:57] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:30:57] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:30:57] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-24 03:30:57] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:30:57] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:30:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality13942119574792452373.gal : 19 ms
[2024-05-24 03:30:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality6736329594991958391.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13942119574792452373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6736329594991958391.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44695e+11,2.02477,71408,2,9342,5,208164,6,0,1490,440851,0


Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...638
(forward)formula 0,1,8.64854,250668,1,0,564,726132,727,317,7903,975477,718
FORMULA HealthRecord-PT-16-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Graph (trivial) has 381 edges and 353 vertex of which 42 / 353 are part of one of the 15 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 325 transition count 306
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 141 rules applied. Total rules applied 268 place count 199 transition count 291
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 278 place count 192 transition count 288
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 283 place count 189 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 284 place count 188 transition count 286
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 284 place count 188 transition count 279
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 298 place count 181 transition count 279
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 324 place count 155 transition count 233
Iterating global reduction 5 with 26 rules applied. Total rules applied 350 place count 155 transition count 233
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 353 place count 155 transition count 230
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 356 place count 152 transition count 230
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 362 place count 146 transition count 218
Iterating global reduction 7 with 6 rules applied. Total rules applied 368 place count 146 transition count 218
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 1 rules applied. Total rules applied 369 place count 146 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 370 place count 145 transition count 217
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 374 place count 141 transition count 211
Iterating global reduction 9 with 4 rules applied. Total rules applied 378 place count 141 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 379 place count 141 transition count 210
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 380 place count 140 transition count 208
Iterating global reduction 10 with 1 rules applied. Total rules applied 381 place count 140 transition count 208
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 382 place count 139 transition count 207
Iterating global reduction 10 with 1 rules applied. Total rules applied 383 place count 139 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 384 place count 139 transition count 206
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 11 with 36 rules applied. Total rules applied 420 place count 121 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 422 place count 121 transition count 186
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 429 place count 114 transition count 172
Iterating global reduction 12 with 7 rules applied. Total rules applied 436 place count 114 transition count 172
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 438 place count 112 transition count 170
Iterating global reduction 12 with 2 rules applied. Total rules applied 440 place count 112 transition count 170
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 442 place count 110 transition count 166
Iterating global reduction 12 with 2 rules applied. Total rules applied 444 place count 110 transition count 166
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 446 place count 108 transition count 162
Iterating global reduction 12 with 2 rules applied. Total rules applied 448 place count 108 transition count 162
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 449 place count 107 transition count 160
Iterating global reduction 12 with 1 rules applied. Total rules applied 450 place count 107 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 451 place count 107 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 453 place count 107 transition count 157
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 13 with 1 rules applied. Total rules applied 454 place count 107 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 455 place count 106 transition count 156
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 456 place count 105 transition count 154
Iterating global reduction 15 with 1 rules applied. Total rules applied 457 place count 105 transition count 154
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 458 place count 104 transition count 152
Iterating global reduction 15 with 1 rules applied. Total rules applied 459 place count 104 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 461 place count 103 transition count 151
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 462 place count 102 transition count 150
Iterating global reduction 15 with 1 rules applied. Total rules applied 463 place count 102 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 464 place count 102 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 464 place count 102 transition count 148
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 466 place count 101 transition count 148
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 469 place count 101 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 470 place count 100 transition count 147
Applied a total of 470 rules in 109 ms. Remains 100 /353 variables (removed 253) and now considering 147/463 (removed 316) transitions.
[2024-05-24 03:31:06] [INFO ] Flow matrix only has 140 transitions (discarded 7 similar events)
// Phase 1: matrix 140 rows 100 cols
[2024-05-24 03:31:06] [INFO ] Computed 8 invariants in 9 ms
[2024-05-24 03:31:06] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 03:31:06] [INFO ] Flow matrix only has 140 transitions (discarded 7 similar events)
[2024-05-24 03:31:06] [INFO ] Invariant cache hit.
[2024-05-24 03:31:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:31:06] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-24 03:31:06] [INFO ] Redundant transitions in 4 ms returned []
Running 143 sub problems to find dead transitions.
[2024-05-24 03:31:06] [INFO ] Flow matrix only has 140 transitions (discarded 7 similar events)
[2024-05-24 03:31:06] [INFO ] Invariant cache hit.
[2024-05-24 03:31:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 2/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-24 03:31:06] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:31:07] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:31:07] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:31:07] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 0 ms to minimize.
[2024-05-24 03:31:07] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:31:07] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 1/100 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-24 03:31:08] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:31:08] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:31:08] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:31:08] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:31:08] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:31:08] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-24 03:31:09] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:31:09] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 139/239 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-24 03:31:10] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (OVERLAPS) 1/240 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 14 (OVERLAPS) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6560 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 2/99 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 1/100 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 139/239 variables, 100/123 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 143/266 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (OVERLAPS) 1/240 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 14 (OVERLAPS) 0/240 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 267 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5776 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 15/15 constraints]
After SMT, in 12370ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 12372ms
Starting structural reductions in SI_CTL mode, iteration 1 : 100/353 places, 147/463 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12629 ms. Remains : 100/353 places, 147/463 transitions.
[2024-05-24 03:31:18] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:31:18] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:31:18] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-24 03:31:18] [INFO ] Flatten gal took : 31 ms
[2024-05-24 03:31:18] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:31:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality6918287377894066978.gal : 17 ms
[2024-05-24 03:31:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality504448974972621084.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6918287377894066978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality504448974972621084.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.51856e+07,0.212356,8484,2,1864,5,20927,6,0,537,23781,0


Converting to forward existential form...Done !
original formula: EF((((p226==1) * (EF((p155!=1)) + ((p259!=0)&&(p313!=1)))) * (((E((p427==1) U (p440==0)) + AF((p94==1))) + ((p315==0)||(p351==1))) + (((p...202
=> equivalent forward existential formula: ((([(FwdU((FwdU(Init,TRUE) * ((p226==1) * (E(TRUE U (p155!=1)) + ((p259!=0)&&(p313!=1))))),(p427==1)) * (p440==0...555
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t6, t7, t9, t11, t12, t13, t14, t17, t19, t20, t21, t24, t25, t28, t29, t32, t33, t40...356
Hit Full ! (commute/partial/dont) 144/0/3
(forward)formula 0,1,1.1863,38052,1,0,262,182697,317,122,3520,140843,305
FORMULA HealthRecord-PT-16-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Graph (trivial) has 402 edges and 353 vertex of which 46 / 353 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 323 transition count 291
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 159 rules applied. Total rules applied 299 place count 184 transition count 271
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 310 place count 174 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 173 transition count 270
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 311 place count 173 transition count 264
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 323 place count 167 transition count 264
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 354 place count 136 transition count 209
Iterating global reduction 4 with 31 rules applied. Total rules applied 385 place count 136 transition count 209
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 391 place count 136 transition count 203
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 397 place count 130 transition count 203
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 408 place count 119 transition count 182
Iterating global reduction 6 with 11 rules applied. Total rules applied 419 place count 119 transition count 182
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 422 place count 116 transition count 178
Iterating global reduction 6 with 3 rules applied. Total rules applied 425 place count 116 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 426 place count 116 transition count 177
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 454 place count 102 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 456 place count 102 transition count 161
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 461 place count 97 transition count 151
Iterating global reduction 8 with 5 rules applied. Total rules applied 466 place count 97 transition count 151
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 470 place count 93 transition count 145
Iterating global reduction 8 with 4 rules applied. Total rules applied 474 place count 93 transition count 145
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 477 place count 90 transition count 141
Iterating global reduction 8 with 3 rules applied. Total rules applied 480 place count 90 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 481 place count 90 transition count 140
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 483 place count 88 transition count 136
Iterating global reduction 9 with 2 rules applied. Total rules applied 485 place count 88 transition count 136
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 487 place count 86 transition count 132
Iterating global reduction 9 with 2 rules applied. Total rules applied 489 place count 86 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 490 place count 86 transition count 131
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 491 place count 85 transition count 129
Iterating global reduction 10 with 1 rules applied. Total rules applied 492 place count 85 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 493 place count 85 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 495 place count 85 transition count 126
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 11 with 1 rules applied. Total rules applied 496 place count 85 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 497 place count 84 transition count 125
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 498 place count 83 transition count 123
Iterating global reduction 13 with 1 rules applied. Total rules applied 499 place count 83 transition count 123
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 500 place count 82 transition count 121
Iterating global reduction 13 with 1 rules applied. Total rules applied 501 place count 82 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 503 place count 81 transition count 120
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 504 place count 80 transition count 119
Iterating global reduction 13 with 1 rules applied. Total rules applied 505 place count 80 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 506 place count 80 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 506 place count 80 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 508 place count 79 transition count 117
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 513 place count 79 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 514 place count 78 transition count 116
Applied a total of 514 rules in 48 ms. Remains 78 /353 variables (removed 275) and now considering 116/463 (removed 347) transitions.
[2024-05-24 03:31:19] [INFO ] Flow matrix only has 108 transitions (discarded 8 similar events)
// Phase 1: matrix 108 rows 78 cols
[2024-05-24 03:31:19] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 03:31:20] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-24 03:31:20] [INFO ] Flow matrix only has 108 transitions (discarded 8 similar events)
[2024-05-24 03:31:20] [INFO ] Invariant cache hit.
[2024-05-24 03:31:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 03:31:20] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-24 03:31:20] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-24 03:31:20] [INFO ] Flow matrix only has 108 transitions (discarded 8 similar events)
[2024-05-24 03:31:20] [INFO ] Invariant cache hit.
[2024-05-24 03:31:20] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 7/78 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:31:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:31:20] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:31:20] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:31:20] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:31:21] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 107/185 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/186 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 92 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2854 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 7/78 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:31:23] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 107/185 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 102/194 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 03:31:24] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 1/186 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 196 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3779 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 7/7 constraints]
After SMT, in 6656ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6657ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/353 places, 116/463 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6869 ms. Remains : 78/353 places, 116/463 transitions.
[2024-05-24 03:31:26] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:31:26] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:31:26] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-24 03:31:26] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:31:26] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:31:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality15535717028633607075.gal : 1 ms
[2024-05-24 03:31:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality7909136362669951763.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15535717028633607075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7909136362669951763.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.03759e+07,0.062088,6184,2,983,5,11956,6,0,420,10828,0


Converting to forward existential form...Done !
original formula: AF(AG(AF(((p254==1)&&((p329==0)||(p42==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!(((p254==1)&&((p329==0)||(p42==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t16, t17, t56, t101, t102, t103, t104, t106, t107, t108, t1...264
(forward)formula 0,0,4.09034,130012,1,0,498,808878,253,240,2871,758896,574
FORMULA HealthRecord-PT-16-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Graph (trivial) has 406 edges and 353 vertex of which 44 / 353 are part of one of the 17 SCC in 2 ms
Free SCC test removed 27 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 325 transition count 290
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 164 rules applied. Total rules applied 308 place count 182 transition count 269
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 318 place count 172 transition count 269
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 318 place count 172 transition count 263
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 330 place count 166 transition count 263
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 363 place count 133 transition count 204
Iterating global reduction 3 with 33 rules applied. Total rules applied 396 place count 133 transition count 204
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 402 place count 133 transition count 198
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 408 place count 127 transition count 198
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 419 place count 116 transition count 177
Iterating global reduction 5 with 11 rules applied. Total rules applied 430 place count 116 transition count 177
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 5 with 1 rules applied. Total rules applied 431 place count 116 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 432 place count 115 transition count 176
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 436 place count 111 transition count 170
Iterating global reduction 7 with 4 rules applied. Total rules applied 440 place count 111 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 441 place count 111 transition count 169
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 442 place count 110 transition count 167
Iterating global reduction 8 with 1 rules applied. Total rules applied 443 place count 110 transition count 167
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 444 place count 109 transition count 166
Iterating global reduction 8 with 1 rules applied. Total rules applied 445 place count 109 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 446 place count 109 transition count 165
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 472 place count 96 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 474 place count 96 transition count 150
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 478 place count 92 transition count 142
Iterating global reduction 10 with 4 rules applied. Total rules applied 482 place count 92 transition count 142
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 486 place count 88 transition count 137
Iterating global reduction 10 with 4 rules applied. Total rules applied 490 place count 88 transition count 137
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 493 place count 85 transition count 132
Iterating global reduction 10 with 3 rules applied. Total rules applied 496 place count 85 transition count 132
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 499 place count 82 transition count 126
Iterating global reduction 10 with 3 rules applied. Total rules applied 502 place count 82 transition count 126
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 505 place count 79 transition count 120
Iterating global reduction 10 with 3 rules applied. Total rules applied 508 place count 79 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 509 place count 79 transition count 119
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 510 place count 78 transition count 117
Iterating global reduction 11 with 1 rules applied. Total rules applied 511 place count 78 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 512 place count 78 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 514 place count 78 transition count 114
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 12 with 1 rules applied. Total rules applied 515 place count 78 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 516 place count 77 transition count 113
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 517 place count 76 transition count 111
Iterating global reduction 14 with 1 rules applied. Total rules applied 518 place count 76 transition count 111
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 519 place count 75 transition count 109
Iterating global reduction 14 with 1 rules applied. Total rules applied 520 place count 75 transition count 109
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 521 place count 74 transition count 108
Iterating global reduction 14 with 1 rules applied. Total rules applied 522 place count 74 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 524 place count 73 transition count 107
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 525 place count 72 transition count 106
Iterating global reduction 14 with 1 rules applied. Total rules applied 526 place count 72 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 528 place count 72 transition count 104
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 14 with 1 rules applied. Total rules applied 529 place count 72 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 530 place count 71 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 531 place count 70 transition count 102
Applied a total of 531 rules in 40 ms. Remains 70 /353 variables (removed 283) and now considering 102/463 (removed 361) transitions.
[2024-05-24 03:31:30] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
// Phase 1: matrix 94 rows 70 cols
[2024-05-24 03:31:30] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 03:31:31] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 03:31:31] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
[2024-05-24 03:31:31] [INFO ] Invariant cache hit.
[2024-05-24 03:31:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:31:31] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-24 03:31:31] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-24 03:31:31] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
[2024-05-24 03:31:31] [INFO ] Invariant cache hit.
[2024-05-24 03:31:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 7/70 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 03:31:31] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:31:31] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 93/163 variables, 70/79 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 1/164 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 80 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1995 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 7/70 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 03:31:33] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 93/163 variables, 70/80 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/164 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 169 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2152 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 3/3 constraints]
After SMT, in 4159ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 4160ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/353 places, 102/463 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4305 ms. Remains : 70/353 places, 102/463 transitions.
[2024-05-24 03:31:35] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:31:35] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:31:35] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-24 03:31:35] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:31:35] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:31:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9534521327797825579.gal : 1 ms
[2024-05-24 03:31:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality18354097443134670400.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9534521327797825579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18354097443134670400.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.72032e+07,0.031093,4776,2,656,5,6403,6,0,374,4126,0


Converting to forward existential form...Done !
original formula: EG((p33==0))
=> equivalent forward existential formula: [FwdG(Init,(p33==0))] != FALSE
Hit Full ! (commute/partial/dont) 100/0/2
(forward)formula 0,1,0.125963,9000,1,0,8,29833,19,4,1843,15934,8
FORMULA HealthRecord-PT-16-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 320 transition count 419
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 320 transition count 419
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 81 place count 305 transition count 398
Iterating global reduction 0 with 15 rules applied. Total rules applied 96 place count 305 transition count 398
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 99 place count 305 transition count 395
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 108 place count 296 transition count 380
Iterating global reduction 1 with 9 rules applied. Total rules applied 117 place count 296 transition count 380
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 292 transition count 372
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 292 transition count 372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 291 transition count 371
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 291 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 290 transition count 370
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 290 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 130 place count 290 transition count 369
Applied a total of 130 rules in 25 ms. Remains 290 /353 variables (removed 63) and now considering 369/463 (removed 94) transitions.
// Phase 1: matrix 369 rows 290 cols
[2024-05-24 03:31:35] [INFO ] Computed 14 invariants in 8 ms
[2024-05-24 03:31:35] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 03:31:35] [INFO ] Invariant cache hit.
[2024-05-24 03:31:35] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-24 03:31:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:31:39] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:31:39] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:31:39] [INFO ] Deduced a trap composed of 181 places in 89 ms of which 3 ms to minimize.
[2024-05-24 03:31:39] [INFO ] Deduced a trap composed of 145 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:31:39] [INFO ] Deduced a trap composed of 139 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:31:39] [INFO ] Deduced a trap composed of 115 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:31:39] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:31:40] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:31:40] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:31:40] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:31:40] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:31:41] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:31:41] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:31:44] [INFO ] Deduced a trap composed of 139 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:31:44] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 369/659 variables, 290/319 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:31:52] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 9 (OVERLAPS) 0/659 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 320 constraints, problems are : Problem set: 0 solved, 368 unsolved in 29867 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/659 variables, 290/320 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 368/688 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:32:11] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:32:15] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:32:18] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:32:18] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:32:18] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 3/693 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:32:25] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:32:25] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:32:29] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/659 variables, 3/696 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/659 variables, and 696 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 24/24 constraints]
After SMT, in 59939ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 59943ms
Starting structural reductions in LTL mode, iteration 1 : 290/353 places, 369/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60210 ms. Remains : 290/353 places, 369/463 transitions.
[2024-05-24 03:32:35] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:32:35] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:32:35] [INFO ] Input system was already deterministic with 369 transitions.
[2024-05-24 03:32:35] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:32:35] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:32:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9626608455773664779.gal : 2 ms
[2024-05-24 03:32:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality4579979200204202376.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9626608455773664779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4579979200204202376.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65268e+11,2.62697,79660,2,9419,5,228290,6,0,1531,501184,0


Converting to forward existential form...Done !
original formula: EX(E((!(AF((p366==1))) * !(E(((p108==0)||(p188==1)) U (p201==1)))) U (p49==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),(!(!(EG(!((p366==1))))) * !(E(((p108==0)||(p188==1)) U (p201==1))))) * (p49==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...671
Detected timeout of ITS tools.
[2024-05-24 03:33:05] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:33:05] [INFO ] Applying decomposition
[2024-05-24 03:33:05] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph388896083139296187.txt' '-o' '/tmp/graph388896083139296187.bin' '-w' '/tmp/graph388896083139296187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph388896083139296187.bin' '-l' '-1' '-v' '-w' '/tmp/graph388896083139296187.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:33:05] [INFO ] Decomposing Gal with order
[2024-05-24 03:33:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:33:05] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-24 03:33:05] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:33:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2024-05-24 03:33:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality4480651981496841646.gal : 4 ms
[2024-05-24 03:33:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality709081809260311149.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4480651981496841646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality709081809260311149.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65268e+11,1.10527,41132,1013,58,56579,1903,709,211453,94,8468,0


Converting to forward existential form...Done !
original formula: EX(E((!(AF((i17.i2.u81.p366==1))) * !(E(((u21.p108==0)||(i10.i1.u49.p188==1)) U (i10.i3.u54.p201==1)))) U (i1.u8.p49==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),(!(!(EG(!((i17.i2.u81.p366==1))))) * !(E(((u21.p108==0)||(i10.i1.u49.p188==1)) U (i10.i3.u54.p20...192
Reverse transition relation is NOT exact ! Due to transitions t90, t234, t304, t331, i1.t311, i1.t309, i1.t292, i1.t282, i1.t272, i1.u7.t293, i1.u7.t295, i...1269
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,5.17727,148316,1,0,202710,3251,4953,979948,467,9734,380432
FORMULA HealthRecord-PT-16-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Graph (trivial) has 405 edges and 353 vertex of which 46 / 353 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 323 transition count 287
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 164 rules applied. Total rules applied 308 place count 180 transition count 266
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 318 place count 170 transition count 266
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 318 place count 170 transition count 260
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 330 place count 164 transition count 260
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 363 place count 131 transition count 201
Iterating global reduction 3 with 33 rules applied. Total rules applied 396 place count 131 transition count 201
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 402 place count 131 transition count 195
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 408 place count 125 transition count 195
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 419 place count 114 transition count 174
Iterating global reduction 5 with 11 rules applied. Total rules applied 430 place count 114 transition count 174
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 5 with 1 rules applied. Total rules applied 431 place count 114 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 432 place count 113 transition count 173
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 436 place count 109 transition count 167
Iterating global reduction 7 with 4 rules applied. Total rules applied 440 place count 109 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 441 place count 109 transition count 166
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 442 place count 108 transition count 164
Iterating global reduction 8 with 1 rules applied. Total rules applied 443 place count 108 transition count 164
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 444 place count 107 transition count 163
Iterating global reduction 8 with 1 rules applied. Total rules applied 445 place count 107 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 446 place count 107 transition count 162
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 472 place count 94 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 474 place count 94 transition count 147
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 478 place count 90 transition count 139
Iterating global reduction 10 with 4 rules applied. Total rules applied 482 place count 90 transition count 139
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 486 place count 86 transition count 134
Iterating global reduction 10 with 4 rules applied. Total rules applied 490 place count 86 transition count 134
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 493 place count 83 transition count 129
Iterating global reduction 10 with 3 rules applied. Total rules applied 496 place count 83 transition count 129
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 498 place count 81 transition count 125
Iterating global reduction 10 with 2 rules applied. Total rules applied 500 place count 81 transition count 125
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 502 place count 79 transition count 121
Iterating global reduction 10 with 2 rules applied. Total rules applied 504 place count 79 transition count 121
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 505 place count 78 transition count 119
Iterating global reduction 10 with 1 rules applied. Total rules applied 506 place count 78 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 507 place count 78 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 509 place count 78 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 513 place count 76 transition count 114
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 515 place count 74 transition count 111
Iterating global reduction 11 with 2 rules applied. Total rules applied 517 place count 74 transition count 111
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 518 place count 73 transition count 109
Iterating global reduction 11 with 1 rules applied. Total rules applied 519 place count 73 transition count 109
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 520 place count 72 transition count 108
Iterating global reduction 11 with 1 rules applied. Total rules applied 521 place count 72 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 523 place count 72 transition count 106
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 11 with 1 rules applied. Total rules applied 524 place count 72 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 525 place count 71 transition count 105
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 527 place count 71 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 528 place count 70 transition count 104
Applied a total of 528 rules in 39 ms. Remains 70 /353 variables (removed 283) and now considering 104/463 (removed 359) transitions.
[2024-05-24 03:33:11] [INFO ] Flow matrix only has 96 transitions (discarded 8 similar events)
// Phase 1: matrix 96 rows 70 cols
[2024-05-24 03:33:11] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 03:33:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 03:33:11] [INFO ] Flow matrix only has 96 transitions (discarded 8 similar events)
[2024-05-24 03:33:11] [INFO ] Invariant cache hit.
[2024-05-24 03:33:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:33:11] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-24 03:33:11] [INFO ] Redundant transitions in 2 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-24 03:33:11] [INFO ] Flow matrix only has 96 transitions (discarded 8 similar events)
[2024-05-24 03:33:11] [INFO ] Invariant cache hit.
[2024-05-24 03:33:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 7/70 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-24 03:33:11] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:33:11] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:33:11] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 95/165 variables, 70/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 1/166 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/166 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 81 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2090 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 7/70 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-24 03:33:13] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 95/165 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 90/171 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 1/166 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 172 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2006 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 4/4 constraints]
After SMT, in 4111ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 4114ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/353 places, 104/463 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4263 ms. Remains : 70/353 places, 104/463 transitions.
[2024-05-24 03:33:15] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:33:15] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:33:15] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-24 03:33:15] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:33:15] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:33:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality6860319893544237460.gal : 1 ms
[2024-05-24 03:33:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality17599982362749973040.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6860319893544237460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17599982362749973040.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39264e+07,0.036062,5072,2,504,5,7213,6,0,376,5704,0


Converting to forward existential form...Done !
original formula: EF(AG(((p416==0)||(p232==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p416==0)||(p232==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t14, t16, t95, t97, Intersection with reachable at each st...215
(forward)formula 0,1,0.184981,11144,1,0,155,43672,221,79,2340,25316,209
FORMULA HealthRecord-PT-16-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 323 transition count 424
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 323 transition count 424
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 73 place count 310 transition count 406
Iterating global reduction 0 with 13 rules applied. Total rules applied 86 place count 310 transition count 406
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 89 place count 310 transition count 403
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 303 transition count 390
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 303 transition count 390
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 107 place count 299 transition count 382
Iterating global reduction 1 with 4 rules applied. Total rules applied 111 place count 299 transition count 382
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 298 transition count 381
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 298 transition count 381
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 297 transition count 380
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 297 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 116 place count 297 transition count 379
Applied a total of 116 rules in 20 ms. Remains 297 /353 variables (removed 56) and now considering 379/463 (removed 84) transitions.
// Phase 1: matrix 379 rows 297 cols
[2024-05-24 03:33:15] [INFO ] Computed 14 invariants in 7 ms
[2024-05-24 03:33:15] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-24 03:33:15] [INFO ] Invariant cache hit.
[2024-05-24 03:33:15] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2024-05-24 03:33:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-24 03:33:19] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:33:19] [INFO ] Deduced a trap composed of 128 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:33:19] [INFO ] Deduced a trap composed of 146 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:33:19] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:33:19] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:33:20] [INFO ] Deduced a trap composed of 145 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:33:20] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2024-05-24 03:33:21] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:33:22] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:33:22] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-24 03:33:24] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-24 03:33:26] [INFO ] Deduced a trap composed of 140 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:33:27] [INFO ] Deduced a trap composed of 140 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:33:27] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:33:27] [INFO ] Deduced a trap composed of 130 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:33:27] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:33:27] [INFO ] Deduced a trap composed of 120 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:33:28] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:33:28] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:33:28] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 2 ms to minimize.
[2024-05-24 03:33:28] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:33:29] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (OVERLAPS) 379/676 variables, 297/333 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-24 03:33:34] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:33:36] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/676 variables, and 335 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (OVERLAPS) 379/676 variables, 297/335 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 378/713 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-24 03:33:53] [INFO ] Deduced a trap composed of 149 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-24 03:34:10] [INFO ] Deduced a trap composed of 144 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/676 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 715 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 26/26 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in LTL mode, iteration 1 : 297/353 places, 379/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60356 ms. Remains : 297/353 places, 379/463 transitions.
[2024-05-24 03:34:15] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:34:15] [INFO ] Flatten gal took : 17 ms
[2024-05-24 03:34:15] [INFO ] Input system was already deterministic with 379 transitions.
[2024-05-24 03:34:15] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:34:15] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:34:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality5785191226206681664.gal : 5 ms
[2024-05-24 03:34:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality16554371856944254770.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5785191226206681664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16554371856944254770.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.0177e+11,3.23979,104824,2,14097,5,311682,6,0,1569,669252,0


Converting to forward existential form...Done !
original formula: AG(AX((((p181==0)||(p44==1)) + ((EF((p407==1)) * AX((p88==1))) + (EX((p19==1)) * !(A(((p299==0)||(p444==1)) U (p257==1))))))))
=> equivalent forward existential formula: ([(((EY(FwdU(Init,TRUE)) * !(((p181==0)||(p44==1)))) * !((EX((p19==1)) * !(!((E(!((p257==1)) U (!(((p299==0)||(p...435
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t21, t24, t26, t28, t31, t33, t34, t36, t37, t38, t39, t42...732
Detected timeout of ITS tools.
[2024-05-24 03:34:45] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:34:45] [INFO ] Applying decomposition
[2024-05-24 03:34:46] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12139189149633183617.txt' '-o' '/tmp/graph12139189149633183617.bin' '-w' '/tmp/graph12139189149633183617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12139189149633183617.bin' '-l' '-1' '-v' '-w' '/tmp/graph12139189149633183617.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:34:46] [INFO ] Decomposing Gal with order
[2024-05-24 03:34:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:34:46] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-24 03:34:46] [INFO ] Flatten gal took : 34 ms
[2024-05-24 03:34:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 4 ms.
[2024-05-24 03:34:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality15488027414805990613.gal : 3 ms
[2024-05-24 03:34:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality286721453470775437.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15488027414805990613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality286721453470775437.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.0177e+11,2.88238,80000,2781,154,122560,3420,736,350367,117,16547,0


Converting to forward existential form...Done !
original formula: AG(AX((((i10.i2.u46.p181==0)||(i1.i0.u9.p44==1)) + ((EF((i18.u105.p407==1)) * AX((i1.i4.u14.p88==1))) + (EX((i1.i2.u6.p19==1)) * !(A(((i1...223
=> equivalent forward existential formula: ([(((EY(FwdU(Init,TRUE)) * !(((i10.i2.u46.p181==0)||(i1.i0.u9.p44==1)))) * !((EX((i1.i2.u6.p19==1)) * !(!((E(!((...618
Reverse transition relation is NOT exact ! Due to transitions t97, t334, t335, t336, t338, t339, i1.i0.t281, i1.i0.t297, i1.i0.t317, i1.i0.t318, i1.i0.u3.t...1388
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,9.03831,221240,1,0,352698,5782,5232,885338,609,20086,986334
FORMULA HealthRecord-PT-16-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 321 transition count 421
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 321 transition count 421
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 305 transition count 399
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 305 transition count 399
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 99 place count 305 transition count 396
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 108 place count 296 transition count 380
Iterating global reduction 1 with 9 rules applied. Total rules applied 117 place count 296 transition count 380
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 292 transition count 372
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 292 transition count 372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 291 transition count 371
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 291 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 290 transition count 370
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 290 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 130 place count 290 transition count 369
Applied a total of 130 rules in 25 ms. Remains 290 /353 variables (removed 63) and now considering 369/463 (removed 94) transitions.
// Phase 1: matrix 369 rows 290 cols
[2024-05-24 03:34:55] [INFO ] Computed 14 invariants in 5 ms
[2024-05-24 03:34:55] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-24 03:34:55] [INFO ] Invariant cache hit.
[2024-05-24 03:34:55] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-05-24 03:34:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:34:58] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:34:59] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:34:59] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2024-05-24 03:34:59] [INFO ] Deduced a trap composed of 157 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:35:00] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2024-05-24 03:35:00] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:35:01] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:35:01] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:35:01] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:35:01] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:35:01] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:35:04] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:35:04] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:35:04] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:35:04] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:35:04] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:35:05] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:35:05] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:35:05] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:35:05] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 2 ms to minimize.
[2024-05-24 03:35:05] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:35:05] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:35:05] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:35:06] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:35:06] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:35:06] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:35:07] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:35:08] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:35:08] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:35:08] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 369/659 variables, 290/334 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 9 (OVERLAPS) 0/659 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 334 constraints, problems are : Problem set: 0 solved, 368 unsolved in 28661 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:35:26] [INFO ] Deduced a trap composed of 118 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:35:27] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:35:28] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:35:29] [INFO ] Deduced a trap composed of 139 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:35:31] [INFO ] Deduced a trap composed of 140 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:35:34] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:35:34] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 9 (OVERLAPS) 369/659 variables, 290/341 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/659 variables, 368/709 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:35:40] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/659 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-05-24 03:35:47] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:35:47] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/659 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/659 variables, and 712 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 40/40 constraints]
After SMT, in 58723ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 58727ms
Starting structural reductions in LTL mode, iteration 1 : 290/353 places, 369/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59002 ms. Remains : 290/353 places, 369/463 transitions.
[2024-05-24 03:35:54] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:35:54] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:35:54] [INFO ] Input system was already deterministic with 369 transitions.
[2024-05-24 03:35:54] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:35:54] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:35:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13989521708438796215.gal : 2 ms
[2024-05-24 03:35:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality944413355364342691.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13989521708438796215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality944413355364342691.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62297e+11,2.84532,75176,2,10314,5,218087,6,0,1531,465386,0


Converting to forward existential form...Done !
original formula: EF(AG(EX(((p396==0)&&(p143==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(((p396==0)&&(p143==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...680
(forward)formula 0,1,13.8269,299324,1,0,597,835440,759,332,8544,1.04815e+06,751
FORMULA HealthRecord-PT-16-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 322 transition count 422
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 322 transition count 422
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 75 place count 309 transition count 404
Iterating global reduction 0 with 13 rules applied. Total rules applied 88 place count 309 transition count 404
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 309 transition count 402
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 99 place count 300 transition count 385
Iterating global reduction 1 with 9 rules applied. Total rules applied 108 place count 300 transition count 385
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 297 transition count 379
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 297 transition count 379
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 296 transition count 378
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 296 transition count 378
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 295 transition count 376
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 295 transition count 376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 294 transition count 374
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 294 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 293 transition count 372
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 293 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 293 transition count 371
Applied a total of 123 rules in 23 ms. Remains 293 /353 variables (removed 60) and now considering 371/463 (removed 92) transitions.
// Phase 1: matrix 371 rows 293 cols
[2024-05-24 03:36:08] [INFO ] Computed 14 invariants in 4 ms
[2024-05-24 03:36:08] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-24 03:36:08] [INFO ] Invariant cache hit.
[2024-05-24 03:36:08] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-05-24 03:36:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-24 03:36:11] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:36:12] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:36:12] [INFO ] Deduced a trap composed of 163 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:36:12] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:36:12] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:36:12] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2024-05-24 03:36:13] [INFO ] Deduced a trap composed of 114 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:36:15] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:36:15] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:36:15] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 371/664 variables, 293/317 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/664 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/664 variables, and 317 constraints, problems are : Problem set: 0 solved, 370 unsolved in 21159 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-24 03:36:31] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:36:31] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:36:32] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 371/664 variables, 293/320 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/664 variables, 370/690 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-24 03:36:39] [INFO ] Deduced a trap composed of 134 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:36:39] [INFO ] Deduced a trap composed of 134 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 2/692 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 10 (OVERLAPS) 0/664 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 664/664 variables, and 692 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 15/15 constraints]
After SMT, in 51223ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 51226ms
Starting structural reductions in LTL mode, iteration 1 : 293/353 places, 371/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51495 ms. Remains : 293/353 places, 371/463 transitions.
[2024-05-24 03:36:59] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:36:59] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:36:59] [INFO ] Input system was already deterministic with 371 transitions.
[2024-05-24 03:36:59] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:36:59] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:36:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality5161049405787082925.gal : 2 ms
[2024-05-24 03:36:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality9981921119461100056.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5161049405787082925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9981921119461100056.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.02814e+11,2.6872,86568,2,10771,5,251968,6,0,1545,540852,0


Converting to forward existential form...Done !
original formula: (E(EX(!(((p288==0)||(p236==1)))) U ((!(EX(AG(((p184==0)||(p120==1))))) * AG(((A(((p432==0)||(p212==1)) U ((p98==0)||(p279==1))) + (p19==0...231
=> equivalent forward existential formula: [(FwdU(EY((Init * !(E(EX(!(((p288==0)||(p236==1)))) U ((!(EX(!(E(TRUE U !(((p184==0)||(p120==1))))))) * !(E(TRUE...407
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...689
Detected timeout of ITS tools.
[2024-05-24 03:37:29] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:37:29] [INFO ] Applying decomposition
[2024-05-24 03:37:29] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11917782696650049540.txt' '-o' '/tmp/graph11917782696650049540.bin' '-w' '/tmp/graph11917782696650049540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11917782696650049540.bin' '-l' '-1' '-v' '-w' '/tmp/graph11917782696650049540.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:37:29] [INFO ] Decomposing Gal with order
[2024-05-24 03:37:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:37:29] [INFO ] Removed a total of 107 redundant transitions.
[2024-05-24 03:37:29] [INFO ] Flatten gal took : 31 ms
[2024-05-24 03:37:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 20 ms.
[2024-05-24 03:37:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality11290693742529590960.gal : 4 ms
[2024-05-24 03:37:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15756525211558396464.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11290693742529590960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15756525211558396464.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.02814e+11,0.509072,21096,1051,66,30822,919,751,67120,96,2454,0


Converting to forward existential form...Done !
original formula: (E(EX(!(((i15.u84.p288==0)||(i11.i0.u65.p236==1)))) U ((!(EX(AG(((i9.i2.u47.p184==0)||(i5.i1.u26.p120==1))))) * AG(((A(((i18.i0.u106.p432...362
=> equivalent forward existential formula: [(FwdU(EY((Init * !(E(EX(!(((i15.u84.p288==0)||(i11.i0.u65.p236==1)))) U ((!(EX(!(E(TRUE U !(((i9.i2.u47.p184==0...580
Reverse transition relation is NOT exact ! Due to transitions t318, t319, t320, t321, t322, t334, i2.i3.t273, i2.i3.t283, i2.i3.t286, i2.i3.t288, i2.i3.t31...1339
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,1.502,54888,1,0,94013,1631,5083,206664,476,3072,260433
FORMULA HealthRecord-PT-16-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 320 transition count 419
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 320 transition count 419
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 82 place count 304 transition count 397
Iterating global reduction 0 with 16 rules applied. Total rules applied 98 place count 304 transition count 397
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 101 place count 304 transition count 394
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 110 place count 295 transition count 379
Iterating global reduction 1 with 9 rules applied. Total rules applied 119 place count 295 transition count 379
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 123 place count 291 transition count 371
Iterating global reduction 1 with 4 rules applied. Total rules applied 127 place count 291 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 290 transition count 370
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 290 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 289 transition count 369
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 289 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 132 place count 289 transition count 368
Applied a total of 132 rules in 24 ms. Remains 289 /353 variables (removed 64) and now considering 368/463 (removed 95) transitions.
// Phase 1: matrix 368 rows 289 cols
[2024-05-24 03:37:31] [INFO ] Computed 14 invariants in 6 ms
[2024-05-24 03:37:31] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-24 03:37:31] [INFO ] Invariant cache hit.
[2024-05-24 03:37:31] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2024-05-24 03:37:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-24 03:37:35] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:37:35] [INFO ] Deduced a trap composed of 139 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:37:35] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:37:35] [INFO ] Deduced a trap composed of 138 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:37:35] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:37:37] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 2 ms to minimize.
[2024-05-24 03:37:37] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-24 03:37:39] [INFO ] Deduced a trap composed of 143 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:37:40] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:37:40] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:37:40] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:37:40] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:37:41] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:37:41] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:37:41] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:37:41] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:37:41] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-24 03:37:43] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 4 ms to minimize.
[2024-05-24 03:37:43] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:37:43] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:37:43] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:37:43] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:37:44] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:37:44] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:37:44] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-24 03:37:47] [INFO ] Deduced a trap composed of 139 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:37:47] [INFO ] Deduced a trap composed of 138 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (OVERLAPS) 368/657 variables, 289/330 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-24 03:37:52] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/657 variables, and 331 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-24 03:38:04] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-24 03:38:06] [INFO ] Deduced a trap composed of 116 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-24 03:38:10] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:38:10] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-24 03:38:11] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (OVERLAPS) 368/657 variables, 289/339 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 367/706 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/657 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-24 03:38:24] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/657 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 707 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 37/37 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 289/353 places, 368/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60420 ms. Remains : 289/353 places, 368/463 transitions.
[2024-05-24 03:38:31] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:38:31] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:38:32] [INFO ] Input system was already deterministic with 368 transitions.
[2024-05-24 03:38:32] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:38:32] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:38:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15364297513574671348.gal : 2 ms
[2024-05-24 03:38:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality9901104128088945177.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15364297513574671348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9901104128088945177.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62247e+11,2.40772,79648,2,9408,5,228236,6,0,1526,501019,0


Converting to forward existential form...Done !
original formula: !(A(!(AF(E((p201!=1) U EX((p81==1))))) U AG(E(!(((p161==1)||(p163==0))) U (((p48==0)||(p159==1))||((p161==0)&&(p357==0)))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !(E(!(((p161==1)||(p163==0))) U (((p48==0)||(p159==1))||((p161==0)&&(p357==0))))...431
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...671
Detected timeout of ITS tools.
[2024-05-24 03:39:02] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:39:02] [INFO ] Applying decomposition
[2024-05-24 03:39:02] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3552496743820943312.txt' '-o' '/tmp/graph3552496743820943312.bin' '-w' '/tmp/graph3552496743820943312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3552496743820943312.bin' '-l' '-1' '-v' '-w' '/tmp/graph3552496743820943312.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:39:02] [INFO ] Decomposing Gal with order
[2024-05-24 03:39:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:39:02] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-24 03:39:02] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:39:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2024-05-24 03:39:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality10437851681594898433.gal : 3 ms
[2024-05-24 03:39:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality9223007821163633553.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10437851681594898433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9223007821163633553.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62247e+11,2.96636,80692,1270,236,78085,69686,748,235765,145,444554,0


Converting to forward existential form...Done !
original formula: !(A(!(AF(E((i9.i2.u52.p201!=1) U EX((i1.i1.u4.p81==1))))) U AG(E(!(((i6.i0.u38.p161==1)||(i6.i0.u40.p163==0))) U (((i1.i1.u9.p48==0)||(i6...222
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !(E(!(((i6.i0.u38.p161==1)||(i6.i0.u40.p163==0))) U (((i1.i1.u9.p48==0)||(i6.i0....630
Reverse transition relation is NOT exact ! Due to transitions t23, t287, t303, t330, i1.i1.t272, i1.i1.t281, i1.i1.t284, i1.i1.t285, i1.i1.t290, i1.i1.t292...1259
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 463/463 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 322 transition count 421
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 322 transition count 421
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 77 place count 307 transition count 400
Iterating global reduction 0 with 15 rules applied. Total rules applied 92 place count 307 transition count 400
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 95 place count 307 transition count 397
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 104 place count 298 transition count 381
Iterating global reduction 1 with 9 rules applied. Total rules applied 113 place count 298 transition count 381
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 295 transition count 375
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 295 transition count 375
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 293 transition count 373
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 293 transition count 373
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 291 transition count 370
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 291 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 128 place count 291 transition count 369
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 290 transition count 367
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 290 transition count 367
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 289 transition count 365
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 289 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 289 transition count 364
Applied a total of 133 rules in 21 ms. Remains 289 /353 variables (removed 64) and now considering 364/463 (removed 99) transitions.
// Phase 1: matrix 364 rows 289 cols
[2024-05-24 03:39:32] [INFO ] Computed 14 invariants in 4 ms
[2024-05-24 03:39:32] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 03:39:32] [INFO ] Invariant cache hit.
[2024-05-24 03:39:32] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-05-24 03:39:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:39:35] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:39:35] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 3 ms to minimize.
[2024-05-24 03:39:36] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:39:36] [INFO ] Deduced a trap composed of 157 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:39:36] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:39:36] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:39:36] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:39:37] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:39:37] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:39:38] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:39:40] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:39:40] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:39:44] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/653 variables, 289/316 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:39:49] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 3 ms to minimize.
[2024-05-24 03:39:51] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/653 variables, and 318 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:40:04] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:40:04] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:40:07] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:40:07] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:40:07] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:40:07] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:40:08] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:40:08] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:40:08] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:40:08] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:40:08] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:40:09] [INFO ] Deduced a trap composed of 140 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:40:10] [INFO ] Deduced a trap composed of 137 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:40:10] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:40:14] [INFO ] Deduced a trap composed of 114 places in 89 ms of which 1 ms to minimize.
[2024-05-24 03:40:14] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:40:16] [INFO ] Deduced a trap composed of 146 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:40:18] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:40:18] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:40:19] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:40:19] [INFO ] Deduced a trap composed of 125 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:40:19] [INFO ] Deduced a trap composed of 115 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 11 (OVERLAPS) 364/653 variables, 289/340 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/653 variables, 363/703 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:40:24] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:40:24] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:40:24] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/653 variables, 3/706 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-05-24 03:40:31] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:40:31] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:40:31] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/653 variables, and 709 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 43/43 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 289/353 places, 364/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60351 ms. Remains : 289/353 places, 364/463 transitions.
[2024-05-24 03:40:32] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:40:32] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:40:32] [INFO ] Input system was already deterministic with 364 transitions.
[2024-05-24 03:40:32] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:40:32] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:40:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality13814023660987783000.gal : 1 ms
[2024-05-24 03:40:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality8694103773246726962.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13814023660987783000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8694103773246726962.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64179e+11,3.90162,113268,2,13378,5,305643,6,0,1522,753895,0


Converting to forward existential form...Done !
original formula: AX(EG(((p410==0) * EF(((p143==0)&&(p319==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((p410==0) * E(TRUE U ((p143==0)&&(p319==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t34, t36, t37, t38, t41, t42, t43...706
Detected timeout of ITS tools.
[2024-05-24 03:41:02] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:41:02] [INFO ] Applying decomposition
[2024-05-24 03:41:02] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16068513102987488034.txt' '-o' '/tmp/graph16068513102987488034.bin' '-w' '/tmp/graph16068513102987488034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16068513102987488034.bin' '-l' '-1' '-v' '-w' '/tmp/graph16068513102987488034.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:41:02] [INFO ] Decomposing Gal with order
[2024-05-24 03:41:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:41:02] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-24 03:41:02] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:41:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 4 ms.
[2024-05-24 03:41:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality15818822057901740670.gal : 3 ms
[2024-05-24 03:41:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality10498203497278543159.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15818822057901740670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10498203497278543159.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64179e+11,0.500277,22336,1301,110,35060,2183,726,64432,122,5465,0


Converting to forward existential form...Done !
original formula: AX(EG(((i21.i1.u101.p410==0) * EF(((u31.p143==0)&&(i17.u81.p319==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((i21.i1.u101.p410==0) * E(TRUE U ((u31.p143==0)&&(i17.u81.p319==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t137, t170, t236, t312, t313, t314, t315, t316, t328, t347, u31.t229, i1.i1.u9.t274, i1.i1.u9...1364
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,1,1.60537,57712,1,0,108313,3894,5122,199546,661,9864,313915
FORMULA HealthRecord-PT-16-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 03:41:04] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:41:04] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:41:04] [INFO ] Applying decomposition
[2024-05-24 03:41:04] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7426513121911913497.txt' '-o' '/tmp/graph7426513121911913497.bin' '-w' '/tmp/graph7426513121911913497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7426513121911913497.bin' '-l' '-1' '-v' '-w' '/tmp/graph7426513121911913497.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:41:04] [INFO ] Decomposing Gal with order
[2024-05-24 03:41:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:41:04] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-24 03:41:04] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:41:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-24 03:41:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality1749995149320547446.gal : 3 ms
[2024-05-24 03:41:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality4621913545053158288.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1749995149320547446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4621913545053158288.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.38479e+11,6.64444,200768,2432,943,271017,47583,879,863361,241,397603,0


Converting to forward existential form...Done !
original formula: !(A(!(AF(E((i10.i2.u62.p201!=1) U EX((i1.i4.u16.p81==1))))) U AG(E(!(((i9.i0.u47.p161==1)||(i9.i1.u48.p163==0))) U (((i1.i4.u16.p48==0)||...226
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !(E(!(((i9.i0.u47.p161==1)||(i9.i1.u48.p163==0))) U (((i1.i4.u16.p48==0)||(i9.i1...638
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t94, t95, t137, t138, t410, t412, t414, t415, u26.t324, u41.t287, i1.i4.t337, i1.i4...1927
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,1,454.005,3007476,1,0,4.01792e+06,152784,2852,8.05022e+06,703,751813,131721
FORMULA HealthRecord-PT-16-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1368407 ms.

BK_STOP 1716522518809

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="HealthRecord-PT-16"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is HealthRecord-PT-16, 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 r180-tall-171640604300817"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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