About the Execution of ITS-Tools for HealthRecord-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
410.075 | 81201.00 | 116744.00 | 300.00 | TFTTFTTTTFFTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r180-tall-171640604000705.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-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604000705
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 20:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 20:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 47K 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-02-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716519096104
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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-24 02:51:37] [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 02:51:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:51:37] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-24 02:51:37] [INFO ] Transformed 119 places.
[2024-05-24 02:51:37] [INFO ] Transformed 225 transitions.
[2024-05-24 02:51:37] [INFO ] Found NUPN structural information;
[2024-05-24 02:51:37] [INFO ] Parsed PT model containing 119 places and 225 transitions and 577 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
FORMULA HealthRecord-PT-02-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 219/219 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 94 transition count 175
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 94 transition count 175
Applied a total of 50 rules in 20 ms. Remains 94 /119 variables (removed 25) and now considering 175/219 (removed 44) transitions.
[2024-05-24 02:51:37] [INFO ] Flow matrix only has 173 transitions (discarded 2 similar events)
// Phase 1: matrix 173 rows 94 cols
[2024-05-24 02:51:37] [INFO ] Computed 8 invariants in 14 ms
[2024-05-24 02:51:37] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-24 02:51:37] [INFO ] Flow matrix only has 173 transitions (discarded 2 similar events)
[2024-05-24 02:51:37] [INFO ] Invariant cache hit.
[2024-05-24 02:51:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:51:37] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-24 02:51:37] [INFO ] Flow matrix only has 173 transitions (discarded 2 similar events)
[2024-05-24 02:51:37] [INFO ] Invariant cache hit.
[2024-05-24 02:51:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 10 ms to minimize.
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 1 ms to minimize.
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-24 02:51:39] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:40] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-24 02:51:40] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 1 ms to minimize.
[2024-05-24 02:51:40] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:51:40] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:51:41] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-24 02:51:41] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:51:41] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:51:41] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:51:41] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:51:41] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:51:41] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:51:41] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:51:41] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:41] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:42] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:51:42] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:43] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 172/266 variables, 94/131 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 1/267 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:45] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:51:45] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2024-05-24 02:51:45] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:51:45] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:47] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:47] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:50] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/267 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/267 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 18 (OVERLAPS) 0/267 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 139 constraints, problems are : Problem set: 0 solved, 174 unsolved in 14643 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:53] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-24 02:51:53] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:53] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-24 02:51:53] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
[2024-05-24 02:51:53] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:51:53] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:51:54] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:51:54] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:51:54] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:54] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-24 02:51:54] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 02:51:55] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:51:55] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 172/266 variables, 94/151 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 174/325 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 1/267 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 14 (OVERLAPS) 0/267 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 326 constraints, problems are : Problem set: 0 solved, 174 unsolved in 13475 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 49/49 constraints]
After SMT, in 28226ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 28253ms
Starting structural reductions in LTL mode, iteration 1 : 94/119 places, 175/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28626 ms. Remains : 94/119 places, 175/219 transitions.
Support contains 64 out of 94 places after structural reductions.
[2024-05-24 02:52:06] [INFO ] Flatten gal took : 53 ms
[2024-05-24 02:52:06] [INFO ] Flatten gal took : 15 ms
[2024-05-24 02:52:06] [INFO ] Input system was already deterministic with 175 transitions.
Support contains 61 out of 94 places (down from 64) after GAL structural reductions.
RANDOM walk for 40000 steps (2344 resets) in 2304 ms. (17 steps per ms) remains 13/47 properties
BEST_FIRST walk for 40004 steps (356 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (360 resets) in 99 ms. (400 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40003 steps (350 resets) in 102 ms. (388 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (359 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (418 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (352 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (357 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (366 resets) in 75 ms. (526 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (364 resets) in 31 ms. (1250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (364 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
[2024-05-24 02:52:07] [INFO ] Flow matrix only has 173 transitions (discarded 2 similar events)
[2024-05-24 02:52:07] [INFO ] Invariant cache hit.
[2024-05-24 02:52:07] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 50/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-24 02:52:07] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-24 02:52:07] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:52:07] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:52:07] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:52:07] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:52:08] [INFO ] Deduced a trap composed of 38 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 4 (OVERLAPS) 30/94 variables, 6/14 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-24 02:52:08] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 9 ms to minimize.
[2024-05-24 02:52:08] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-24 02:52:08] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 172/266 variables, 94/111 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/267 variables, 1/112 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-24 02:52:08] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/267 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/267 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 113 constraints, problems are : Problem set: 1 solved, 8 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 51/63 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-24 02:52:08] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:52:08] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 31/94 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-24 02:52:08] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-24 02:52:08] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-24 02:52:08] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 3/23 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-24 02:52:08] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 172/266 variables, 94/118 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 8/126 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/267 variables, 1/127 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-24 02:52:09] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:52:09] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/267 variables, 2/129 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/267 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/267 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 129 constraints, problems are : Problem set: 1 solved, 8 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 18/18 constraints]
After SMT, in 1688ms problems are : Problem set: 1 solved, 8 unsolved
Parikh walk visited 7 properties in 117 ms.
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 130 edges and 94 vertex of which 12 / 94 are part of one of the 6 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 301 edges and 88 vertex of which 86 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 86 transition count 156
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 1 with 8 rules applied. Total rules applied 14 place count 82 transition count 152
Reduce places removed 1 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 2 with 3 rules applied. Total rules applied 17 place count 81 transition count 150
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 80 transition count 149
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 19 place count 80 transition count 146
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 27 place count 75 transition count 146
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 59 place count 43 transition count 82
Iterating global reduction 4 with 32 rules applied. Total rules applied 91 place count 43 transition count 82
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 101 place count 33 transition count 62
Iterating global reduction 4 with 10 rules applied. Total rules applied 111 place count 33 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 115 place count 33 transition count 58
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 118 place count 30 transition count 49
Iterating global reduction 5 with 3 rules applied. Total rules applied 121 place count 30 transition count 49
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 124 place count 27 transition count 43
Iterating global reduction 5 with 3 rules applied. Total rules applied 127 place count 27 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 130 place count 27 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 140 place count 22 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 142 place count 22 transition count 63
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 151 place count 22 transition count 63
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 159 place count 22 transition count 63
Applied a total of 159 rules in 45 ms. Remains 22 /94 variables (removed 72) and now considering 63/175 (removed 112) transitions.
Running 47 sub problems to find dead transitions.
[2024-05-24 02:52:09] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
// Phase 1: matrix 59 rows 22 cols
[2024-05-24 02:52:09] [INFO ] Computed 4 invariants in 3 ms
[2024-05-24 02:52:09] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 3 (OVERLAPS) 59/81 variables, 22/26 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 11/37 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/37 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/81 variables, 0/37 constraints. Problems are: Problem set: 9 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 37 constraints, problems are : Problem set: 9 solved, 38 unsolved in 366 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 2/22 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 59/81 variables, 22/26 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 11/37 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 38/75 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/75 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/75 constraints. Problems are: Problem set: 9 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 75 constraints, problems are : Problem set: 9 solved, 38 unsolved in 501 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 38/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 907ms problems are : Problem set: 9 solved, 38 unsolved
Search for dead transitions found 9 dead transitions in 908ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 22/94 places, 54/175 transitions.
Graph (complete) has 66 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 21 transition count 54
Applied a total of 3 rules in 6 ms. Remains 21 /22 variables (removed 1) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 961 ms. Remains : 21/94 places, 54/175 transitions.
RANDOM walk for 25284 steps (8386 resets) in 525 ms. (48 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-24 02:52:10] [INFO ] Flatten gal took : 10 ms
[2024-05-24 02:52:10] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:52:10] [INFO ] Input system was already deterministic with 175 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 59 transition count 106
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 59 transition count 106
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 52 transition count 92
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 52 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 87 place count 52 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 51 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 51 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 50 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 50 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 50 transition count 83
Applied a total of 92 rules in 7 ms. Remains 50 /94 variables (removed 44) and now considering 83/175 (removed 92) transitions.
[2024-05-24 02:52:10] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
// Phase 1: matrix 82 rows 50 cols
[2024-05-24 02:52:10] [INFO ] Computed 7 invariants in 3 ms
[2024-05-24 02:52:10] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 02:52:10] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2024-05-24 02:52:10] [INFO ] Invariant cache hit.
[2024-05-24 02:52:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:10] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-24 02:52:10] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2024-05-24 02:52:10] [INFO ] Invariant cache hit.
[2024-05-24 02:52:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:52:11] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-24 02:52:11] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 81/131 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 60 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:52:12] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:52:12] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 81/131 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 82/143 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 144 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2139 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 4/4 constraints]
After SMT, in 3398ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3400ms
Starting structural reductions in LTL mode, iteration 1 : 50/94 places, 83/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3490 ms. Remains : 50/94 places, 83/175 transitions.
[2024-05-24 02:52:14] [INFO ] Flatten gal took : 7 ms
[2024-05-24 02:52:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:52:14] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-24 02:52:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:52:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:52:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality12664897697586884200.gal : 2 ms
[2024-05-24 02:52:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality1807346546683851694.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/CTLCardinality12664897697586884200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1807346546683851694.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,49581,0.027123,4092,2,429,5,2539,6,0,281,2162,0
Converting to forward existential form...Done !
original formula: AF((EF(AX(((p95==0)&&(p101==1)))) + ((p97==0)&&(p104==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U !(EX(!(((p95==0)&&(p101==1)))))) + ((p97==0)&&(p104==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...297
(forward)formula 0,1,0.10561,7776,1,0,164,21186,193,82,1938,17726,190
FORMULA HealthRecord-PT-02-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 105 edges and 94 vertex of which 10 / 94 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 57 transition count 108
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 57 transition count 108
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 72 place count 48 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 81 place count 48 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 84 place count 48 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 47 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 47 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 46 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 46 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 89 place count 46 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 46 transition count 77
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 2 with 4 rules applied. Total rules applied 97 place count 44 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 43 transition count 74
Applied a total of 98 rules in 26 ms. Remains 43 /94 variables (removed 51) and now considering 74/175 (removed 101) transitions.
[2024-05-24 02:52:14] [INFO ] Flow matrix only has 69 transitions (discarded 5 similar events)
// Phase 1: matrix 69 rows 43 cols
[2024-05-24 02:52:14] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:52:14] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 02:52:14] [INFO ] Flow matrix only has 69 transitions (discarded 5 similar events)
[2024-05-24 02:52:14] [INFO ] Invariant cache hit.
[2024-05-24 02:52:14] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-24 02:52:14] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-24 02:52:14] [INFO ] Flow matrix only has 69 transitions (discarded 5 similar events)
[2024-05-24 02:52:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 02:52:14] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-24 02:52:14] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:52:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 68/111 variables, 43/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 53 constraints, problems are : Problem set: 0 solved, 60 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 02:52:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:52:15] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 68/111 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 60/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 115 constraints, problems are : Problem set: 0 solved, 60 unsolved in 813 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 5/5 constraints]
After SMT, in 1616ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1616ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/94 places, 74/175 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1719 ms. Remains : 43/94 places, 74/175 transitions.
[2024-05-24 02:52:16] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:52:16] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:52:16] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-24 02:52:16] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:16] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:52:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6633974313783793774.gal : 2 ms
[2024-05-24 02:52:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality17561664936441137468.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/CTLCardinality6633974313783793774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17561664936441137468.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,35428,0.020734,4148,2,443,5,3137,6,0,237,3493,0
Converting to forward existential form...Done !
original formula: AG(EF(((A(((p31==0)||(p8==1)) U (p7==0)) * (p52==1)) * ((p116==0)||(p39==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!((E(!((p7==0)) U (!(((p31==0)||(p8==1))) * !((p7==0)))) + EG(!((p7==0))))) * (...200
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...300
(forward)formula 0,0,0.169229,10220,1,0,199,40402,176,96,1676,31203,232
FORMULA HealthRecord-PT-02-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 59 transition count 106
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 59 transition count 106
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 50 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 50 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 92 place count 50 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 48 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 48 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 46 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 46 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 46 transition count 72
Applied a total of 102 rules in 5 ms. Remains 46 /94 variables (removed 48) and now considering 72/175 (removed 103) transitions.
[2024-05-24 02:52:16] [INFO ] Flow matrix only has 71 transitions (discarded 1 similar events)
// Phase 1: matrix 71 rows 46 cols
[2024-05-24 02:52:16] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:52:16] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 02:52:16] [INFO ] Flow matrix only has 71 transitions (discarded 1 similar events)
[2024-05-24 02:52:16] [INFO ] Invariant cache hit.
[2024-05-24 02:52:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:16] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-05-24 02:52:16] [INFO ] Flow matrix only has 71 transitions (discarded 1 similar events)
[2024-05-24 02:52:16] [INFO ] Invariant cache hit.
[2024-05-24 02:52:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-24 02:52:16] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
[2024-05-24 02:52:16] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 70/116 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 56 constraints, problems are : Problem set: 0 solved, 71 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-24 02:52:17] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:52:17] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 70/116 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 71/128 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 1/117 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/117 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 129 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1496 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 4/4 constraints]
After SMT, in 2508ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2509ms
Starting structural reductions in LTL mode, iteration 1 : 46/94 places, 72/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2614 ms. Remains : 46/94 places, 72/175 transitions.
[2024-05-24 02:52:18] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:52:18] [INFO ] Flatten gal took : 7 ms
[2024-05-24 02:52:18] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-24 02:52:18] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:18] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:52:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality11823742975208670623.gal : 1 ms
[2024-05-24 02:52:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality17223445315119974418.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/CTLCardinality11823742975208670623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17223445315119974418.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 -...285
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,38647,0.018157,3840,2,428,5,2143,6,0,254,1889,0
Converting to forward existential form...Done !
original formula: AG((EF(((p22==0)||(p97==1))) + EX((p110==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX((p110==1)))) * !(E(TRUE U ((p22==0)||(p97==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t23, ...263
(forward)formula 0,1,0.071947,6268,1,0,126,12441,163,62,1663,10269,152
FORMULA HealthRecord-PT-02-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 60 transition count 108
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 60 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 53 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 53 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 53 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 50 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 50 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 47 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 47 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 99 place count 47 transition count 74
Applied a total of 99 rules in 13 ms. Remains 47 /94 variables (removed 47) and now considering 74/175 (removed 101) transitions.
[2024-05-24 02:52:19] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
// Phase 1: matrix 73 rows 47 cols
[2024-05-24 02:52:19] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:52:19] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 02:52:19] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2024-05-24 02:52:19] [INFO ] Invariant cache hit.
[2024-05-24 02:52:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-24 02:52:19] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2024-05-24 02:52:19] [INFO ] Invariant cache hit.
[2024-05-24 02:52:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-24 02:52:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:52:19] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:52:19] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 72/119 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 58 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1104 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-24 02:52:20] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:52:20] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 72/119 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 73/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/120 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 133 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1665 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 5/5 constraints]
After SMT, in 2787ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2788ms
Starting structural reductions in LTL mode, iteration 1 : 47/94 places, 74/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2886 ms. Remains : 47/94 places, 74/175 transitions.
[2024-05-24 02:52:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:21] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-24 02:52:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14116797291025133556.gal : 1 ms
[2024-05-24 02:52:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality17184281376107941921.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/CTLCardinality14116797291025133556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17184281376107941921.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 -...285
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,62865,0.018906,4176,2,480,5,2835,6,0,260,2840,0
Converting to forward existential form...Done !
original formula: EX(EF((EG((p38==0)) * (AF(((p82==0)&&(p77==1))) + ((p0==0)&&(p66==1))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),TRUE) * EG((p38==0))) * !(EG(!(((p82==0)&&(p77==1))))))] != FALSE + [((FwdU(EY(Init),TRUE) * E...201
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t17, t18, t19, t20, t22, t24, t...307
(forward)formula 0,1,0.974885,39444,1,0,386,216752,175,190,1792,219300,440
FORMULA HealthRecord-PT-02-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 119 edges and 94 vertex of which 8 / 94 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 33 place count 57 transition count 107
Iterating global reduction 0 with 32 rules applied. Total rules applied 65 place count 57 transition count 107
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 72 place count 50 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 79 place count 50 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 81 place count 50 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 48 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 48 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 46 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 46 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 46 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 46 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 44 transition count 75
Applied a total of 95 rules in 20 ms. Remains 44 /94 variables (removed 50) and now considering 75/175 (removed 100) transitions.
[2024-05-24 02:52:22] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
// Phase 1: matrix 70 rows 44 cols
[2024-05-24 02:52:22] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:52:23] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 02:52:23] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
[2024-05-24 02:52:23] [INFO ] Invariant cache hit.
[2024-05-24 02:52:23] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-24 02:52:23] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-24 02:52:23] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
[2024-05-24 02:52:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-24 02:52:23] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-24 02:52:23] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-24 02:52:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:52:23] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-24 02:52:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 69/113 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 56 constraints, problems are : Problem set: 0 solved, 61 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-24 02:52:24] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 69/113 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 61/118 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 118 constraints, problems are : Problem set: 0 solved, 61 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 1755ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1755ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/94 places, 75/175 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1864 ms. Remains : 44/94 places, 75/175 transitions.
[2024-05-24 02:52:24] [INFO ] Flatten gal took : 7 ms
[2024-05-24 02:52:24] [INFO ] Flatten gal took : 11 ms
[2024-05-24 02:52:24] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-24 02:52:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality12411078995813760586.gal : 1 ms
[2024-05-24 02:52:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality4701562421177954141.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/CTLCardinality12411078995813760586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4701562421177954141.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,16640,0.016555,3860,2,389,5,2100,6,0,242,1952,0
Converting to forward existential form...Done !
original formula: EG(((p80==1) + E(EG(EF((p67==1))) U (!(A(((p77==0)||(p109==1)) U ((p106==0)||(p44==1)))) * (EG((p106==1)) + !(AF((p94==0))))))))
=> equivalent forward existential formula: [FwdG(Init,((p80==1) + E(EG(E(TRUE U (p67==1))) U (!(!((E(!(((p106==0)||(p44==1))) U (!(((p77==0)||(p109==1))) *...272
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21, t2...301
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.195809,12624,1,0,321,49803,199,196,1825,49927,379
FORMULA HealthRecord-PT-02-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 127 edges and 94 vertex of which 10 / 94 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 55 transition count 104
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 55 transition count 104
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 76 place count 46 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 85 place count 46 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 89 place count 46 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 43 transition count 73
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 43 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 41 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 41 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 41 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 41 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 39 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 37 transition count 58
Applied a total of 112 rules in 12 ms. Remains 37 /94 variables (removed 57) and now considering 58/175 (removed 117) transitions.
[2024-05-24 02:52:25] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
// Phase 1: matrix 53 rows 37 cols
[2024-05-24 02:52:25] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:52:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 02:52:25] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-05-24 02:52:25] [INFO ] Invariant cache hit.
[2024-05-24 02:52:25] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-24 02:52:25] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-24 02:52:25] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
[2024-05-24 02:52:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-24 02:52:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:52:25] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-24 02:52:25] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-24 02:52:25] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 52/89 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/90 variables, and 48 constraints, problems are : Problem set: 0 solved, 44 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-24 02:52:25] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 52/89 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 44/93 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/90 variables, and 93 constraints, problems are : Problem set: 0 solved, 44 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints]
After SMT, in 1234ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1235ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/94 places, 58/175 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1319 ms. Remains : 37/94 places, 58/175 transitions.
[2024-05-24 02:52:26] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:52:26] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:26] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-24 02:52:26] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:26] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality11879050103069213026.gal : 1 ms
[2024-05-24 02:52:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality16766540144450151733.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/CTLCardinality11879050103069213026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16766540144450151733.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 -...285
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,18148,0.015445,4044,2,455,5,2374,6,0,198,2199,0
Converting to forward existential form...Done !
original formula: EF(((p61==1) * AG(AF((EF((p115==0)) + (p27==0))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p61==1)) * !(E(TRUE U !(!(EG(!((E(TRUE U (p115==0)) + (p27==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t39, t49...255
(forward)formula 0,1,0.070569,6684,1,0,122,14734,140,54,1338,13689,127
FORMULA HealthRecord-PT-02-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 57 transition count 102
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 57 transition count 102
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 48 transition count 84
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 48 transition count 84
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 48 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 45 transition count 72
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 45 transition count 72
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 42 transition count 66
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 42 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 42 transition count 63
Applied a total of 110 rules in 3 ms. Remains 42 /94 variables (removed 52) and now considering 63/175 (removed 112) transitions.
[2024-05-24 02:52:26] [INFO ] Flow matrix only has 62 transitions (discarded 1 similar events)
// Phase 1: matrix 62 rows 42 cols
[2024-05-24 02:52:26] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:52:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 02:52:26] [INFO ] Flow matrix only has 62 transitions (discarded 1 similar events)
[2024-05-24 02:52:26] [INFO ] Invariant cache hit.
[2024-05-24 02:52:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:26] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-24 02:52:26] [INFO ] Flow matrix only has 62 transitions (discarded 1 similar events)
[2024-05-24 02:52:26] [INFO ] Invariant cache hit.
[2024-05-24 02:52:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-24 02:52:26] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-24 02:52:26] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 61/103 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 1/104 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 52 constraints, problems are : Problem set: 0 solved, 62 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-24 02:52:27] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:52:27] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 61/103 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 62/115 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 1/104 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 116 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1267 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints]
After SMT, in 2183ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2184ms
Starting structural reductions in LTL mode, iteration 1 : 42/94 places, 63/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2262 ms. Remains : 42/94 places, 63/175 transitions.
[2024-05-24 02:52:28] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:52:28] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:52:28] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-24 02:52:28] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:28] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality648051950840256548.gal : 1 ms
[2024-05-24 02:52:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2564786031371409547.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/CTLCardinality648051950840256548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2564786031371409547.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,32085,0.017295,3788,2,402,5,1754,6,0,229,1602,0
Converting to forward existential form...Done !
original formula: EF(EX(EF((p78==1))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),TRUE) * (p78==1))] != FALSE
(forward)formula 0,1,0.021473,4104,1,0,7,1754,9,1,443,1602,4
FORMULA HealthRecord-PT-02-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 126 edges and 94 vertex of which 12 / 94 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 56 transition count 107
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 56 transition count 107
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 73 place count 46 transition count 87
Iterating global reduction 0 with 10 rules applied. Total rules applied 83 place count 46 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 87 place count 46 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 43 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 43 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 41 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 41 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 41 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 41 transition count 63
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 2 with 4 rules applied. Total rules applied 108 place count 39 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 37 transition count 59
Applied a total of 110 rules in 15 ms. Remains 37 /94 variables (removed 57) and now considering 59/175 (removed 116) transitions.
[2024-05-24 02:52:28] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
// Phase 1: matrix 53 rows 37 cols
[2024-05-24 02:52:28] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:52:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 02:52:28] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-05-24 02:52:28] [INFO ] Invariant cache hit.
[2024-05-24 02:52:28] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-24 02:52:28] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-24 02:52:28] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-05-24 02:52:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-24 02:52:29] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-24 02:52:29] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 5 ms to minimize.
[2024-05-24 02:52:29] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-24 02:52:29] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 52/89 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/90 variables, and 48 constraints, problems are : Problem set: 0 solved, 45 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 52/89 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 45/93 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/90 variables, and 93 constraints, problems are : Problem set: 0 solved, 45 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
After SMT, in 1119ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1120ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/94 places, 59/175 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1206 ms. Remains : 37/94 places, 59/175 transitions.
[2024-05-24 02:52:30] [INFO ] Flatten gal took : 7 ms
[2024-05-24 02:52:30] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:30] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-24 02:52:30] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:30] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality17191927516169139970.gal : 1 ms
[2024-05-24 02:52:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality13327668772596866202.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/CTLCardinality17191927516169139970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13327668772596866202.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 -...285
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,19444,0.018637,4036,2,372,5,3149,6,0,197,3304,0
Converting to forward existential form...Done !
original formula: AG(!(E(((p45==0)||(p61==1)) U !(EF((p38==0))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),((p45==0)||(p61==1))) * !(E(TRUE U (p38==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...295
(forward)formula 0,1,0.066023,6412,1,0,124,15896,132,50,1314,12643,124
FORMULA HealthRecord-PT-02-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 61 transition count 110
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 61 transition count 110
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 53 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 53 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 53 transition count 90
Applied a total of 86 rules in 2 ms. Remains 53 /94 variables (removed 41) and now considering 90/175 (removed 85) transitions.
[2024-05-24 02:52:30] [INFO ] Flow matrix only has 89 transitions (discarded 1 similar events)
// Phase 1: matrix 89 rows 53 cols
[2024-05-24 02:52:30] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:52:30] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 02:52:30] [INFO ] Flow matrix only has 89 transitions (discarded 1 similar events)
[2024-05-24 02:52:30] [INFO ] Invariant cache hit.
[2024-05-24 02:52:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:30] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-24 02:52:30] [INFO ] Flow matrix only has 89 transitions (discarded 1 similar events)
[2024-05-24 02:52:30] [INFO ] Invariant cache hit.
[2024-05-24 02:52:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:52:30] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:52:30] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:52:30] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:52:30] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:52:30] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 88/141 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:52:31] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 67 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2061 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:52:32] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:52:32] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 88/141 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 89/157 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/142 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 158 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2376 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 8/8 constraints]
After SMT, in 4463ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4464ms
Starting structural reductions in LTL mode, iteration 1 : 53/94 places, 90/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4544 ms. Remains : 53/94 places, 90/175 transitions.
[2024-05-24 02:52:34] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:52:34] [INFO ] Flatten gal took : 7 ms
[2024-05-24 02:52:34] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-24 02:52:34] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:34] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality3760497960054915137.gal : 1 ms
[2024-05-24 02:52:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality1267740621944511522.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/CTLCardinality3760497960054915137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1267740621944511522.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,99477,0.023341,4468,2,528,5,3447,6,0,300,3409,0
Converting to forward existential form...Done !
original formula: ((EX(TRUE) * AG(EF(((p93==0)&&(p44==1))))) + (AX(((p57==0)||(p87==1))) * AX(AX((((p71==0)&&(p24==1))&&(p94==0))))))
=> equivalent forward existential formula: ([(EY((Init * !((EX(TRUE) * !(E(TRUE U !(E(TRUE U ((p93==0)&&(p44==1)))))))))) * !(((p57==0)||(p87==1))))] = FAL...290
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...337
(forward)formula 0,0,0.163343,10276,1,0,189,35509,201,88,2090,26957,210
FORMULA HealthRecord-PT-02-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 62 transition count 112
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 62 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 56 transition count 100
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 56 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 80 place count 56 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 55 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 55 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 54 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 54 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 54 transition count 90
Applied a total of 85 rules in 3 ms. Remains 54 /94 variables (removed 40) and now considering 90/175 (removed 85) transitions.
[2024-05-24 02:52:34] [INFO ] Flow matrix only has 89 transitions (discarded 1 similar events)
// Phase 1: matrix 89 rows 54 cols
[2024-05-24 02:52:34] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:52:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 02:52:34] [INFO ] Flow matrix only has 89 transitions (discarded 1 similar events)
[2024-05-24 02:52:34] [INFO ] Invariant cache hit.
[2024-05-24 02:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:34] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-24 02:52:34] [INFO ] Flow matrix only has 89 transitions (discarded 1 similar events)
[2024-05-24 02:52:34] [INFO ] Invariant cache hit.
[2024-05-24 02:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:52:35] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:52:35] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:52:35] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 88/142 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/143 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 65 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1528 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:52:36] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:52:36] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 88/142 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 89/155 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 156 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2315 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 5/5 constraints]
After SMT, in 3860ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 3862ms
Starting structural reductions in LTL mode, iteration 1 : 54/94 places, 90/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3949 ms. Remains : 54/94 places, 90/175 transitions.
[2024-05-24 02:52:38] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:52:38] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:38] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-24 02:52:38] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:52:38] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality352986780641421234.gal : 0 ms
[2024-05-24 02:52:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality84231479798504671.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/CTLCardinality352986780641421234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality84231479798504671.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 -...280
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,80442,0.027934,4468,2,626,5,4125,6,0,304,4202,0
Converting to forward existential form...Done !
original formula: EF((((EX((((p86==1)||(p85==1)) * AG((p102!=0)))) * EX(((p41==0)||(p89==1)))) * ((p7==1)&&(p114==0))) * (p28==1)))
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * (p28==1)) * ((p7==1)&&(p114==0))) * EX((((p86==1)||(p85==1)) * !(E(TRUE U !((p102!=0))...195
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...348
(forward)formula 0,0,0.103128,8164,1,0,173,20520,202,79,2044,15899,192
FORMULA HealthRecord-PT-02-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 61 transition count 110
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 61 transition count 110
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 53 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 53 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 85 place count 53 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 50 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 50 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 47 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 47 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 100 place count 47 transition count 73
Applied a total of 100 rules in 15 ms. Remains 47 /94 variables (removed 47) and now considering 73/175 (removed 102) transitions.
[2024-05-24 02:52:38] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
// Phase 1: matrix 72 rows 47 cols
[2024-05-24 02:52:38] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:52:39] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-24 02:52:39] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
[2024-05-24 02:52:39] [INFO ] Invariant cache hit.
[2024-05-24 02:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:39] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-24 02:52:39] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
[2024-05-24 02:52:39] [INFO ] Invariant cache hit.
[2024-05-24 02:52:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 02:52:39] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 02:52:39] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-24 02:52:39] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 71/118 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 58 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1370 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 02:52:40] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 71/118 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 72/130 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 131 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1537 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints]
After SMT, in 2957ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2958ms
Starting structural reductions in LTL mode, iteration 1 : 47/94 places, 73/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3129 ms. Remains : 47/94 places, 73/175 transitions.
[2024-05-24 02:52:42] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:42] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:42] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-24 02:52:42] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:42] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality16300963029256511087.gal : 1 ms
[2024-05-24 02:52:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality15199361345315756787.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/CTLCardinality16300963029256511087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15199361345315756787.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 -...285
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,60759,0.022583,4160,2,488,5,2878,6,0,259,2839,0
Converting to forward existential form...Done !
original formula: AG(A(((p62==0)||(p44==1)) U (AX((p105==1)) + EX(EF((p63==0))))))
=> equivalent forward existential formula: ([(EY(((FwdU(FwdU(Init,TRUE),!((!(EX(!((p105==1)))) + EX(E(TRUE U (p63==0)))))) * !(((p62==0)||(p44==1)))) * !(E...289
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t21, t23, t24, t...287
(forward)formula 0,1,0.09566,7592,1,0,155,17405,179,75,1781,16145,172
FORMULA HealthRecord-PT-02-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 66 transition count 120
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 66 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 59 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 59 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 72 place count 59 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 57 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 57 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 55 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 55 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 55 transition count 92
Applied a total of 82 rules in 5 ms. Remains 55 /94 variables (removed 39) and now considering 92/175 (removed 83) transitions.
[2024-05-24 02:52:42] [INFO ] Flow matrix only has 91 transitions (discarded 1 similar events)
// Phase 1: matrix 91 rows 55 cols
[2024-05-24 02:52:42] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:52:42] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-24 02:52:42] [INFO ] Flow matrix only has 91 transitions (discarded 1 similar events)
[2024-05-24 02:52:42] [INFO ] Invariant cache hit.
[2024-05-24 02:52:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:42] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 02:52:42] [INFO ] Flow matrix only has 91 transitions (discarded 1 similar events)
[2024-05-24 02:52:42] [INFO ] Invariant cache hit.
[2024-05-24 02:52:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:52:42] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:52:42] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:52:42] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:52:42] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:52:42] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 90/145 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/146 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/146 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 70 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2497 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:52:45] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
[2024-05-24 02:52:45] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 90/145 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 91/162 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/146 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2312 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 9/9 constraints]
After SMT, in 4831ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4832ms
Starting structural reductions in LTL mode, iteration 1 : 55/94 places, 92/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4985 ms. Remains : 55/94 places, 92/175 transitions.
[2024-05-24 02:52:47] [INFO ] Flatten gal took : 7 ms
[2024-05-24 02:52:47] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:47] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 02:52:47] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:47] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality5615437752590771478.gal : 0 ms
[2024-05-24 02:52:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality9375459169953780345.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/CTLCardinality5615437752590771478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9375459169953780345.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,181378,0.045372,5256,2,816,5,7184,6,0,310,8430,0
Converting to forward existential form...Done !
original formula: (EF(AX(((p38!=0)&&(p108!=1)))) * AF(((AG(((p111==0)&&(p66==1))) + (!(A(((p21==0)||(p3==1)) U (p48==1))) * A((p61==1) U ((p98==0)||(p5==1)...185
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(((p38!=0)&&(p108!=1))))))))] = FALSE * [FwdG(Init,!(((!(E(TRUE U !(((p111==0)&&(p66=...388
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...408
(forward)formula 0,1,1.50993,56524,1,0,401,337794,233,195,2138,297003,459
FORMULA HealthRecord-PT-02-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 60 transition count 108
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 60 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 52 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 52 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 87 place count 52 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 50 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 50 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 49 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 49 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 49 transition count 80
Applied a total of 94 rules in 6 ms. Remains 49 /94 variables (removed 45) and now considering 80/175 (removed 95) transitions.
[2024-05-24 02:52:48] [INFO ] Flow matrix only has 79 transitions (discarded 1 similar events)
// Phase 1: matrix 79 rows 49 cols
[2024-05-24 02:52:48] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 02:52:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 02:52:48] [INFO ] Flow matrix only has 79 transitions (discarded 1 similar events)
[2024-05-24 02:52:48] [INFO ] Invariant cache hit.
[2024-05-24 02:52:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:48] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-24 02:52:48] [INFO ] Flow matrix only has 79 transitions (discarded 1 similar events)
[2024-05-24 02:52:48] [INFO ] Invariant cache hit.
[2024-05-24 02:52:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 02:52:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:52:49] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 78/127 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 59 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 02:52:50] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-24 02:52:50] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 78/127 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 79/139 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 140 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1830 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints]
After SMT, in 3069ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3071ms
Starting structural reductions in LTL mode, iteration 1 : 49/94 places, 80/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3158 ms. Remains : 49/94 places, 80/175 transitions.
[2024-05-24 02:52:51] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:52:51] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:51] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-24 02:52:51] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:51] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality2618317102653494720.gal : 1 ms
[2024-05-24 02:52:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality6171604276951020428.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/CTLCardinality2618317102653494720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6171604276951020428.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,67077,0.023616,4144,2,435,5,2351,6,0,274,2101,0
Converting to forward existential form...Done !
original formula: EX(EF((EX((p79==1)) * E(((p100==0)||(p54==1)) U (p34==0)))))
=> equivalent forward existential formula: [(FwdU((FwdU(EY(Init),TRUE) * EX((p79==1))),((p100==0)||(p54==1))) * (p34==0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...292
Hit Full ! (commute/partial/dont) 74/0/6
(forward)formula 0,1,0.085405,7048,1,0,149,14113,183,69,1966,12192,172
FORMULA HealthRecord-PT-02-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 113 edges and 94 vertex of which 12 / 94 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 30 place count 58 transition count 111
Iterating global reduction 0 with 29 rules applied. Total rules applied 59 place count 58 transition count 111
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 68 place count 49 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 77 place count 49 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 80 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 46 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 46 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 43 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 43 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 43 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 99 place count 43 transition count 68
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 2 with 4 rules applied. Total rules applied 103 place count 41 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 39 transition count 64
Applied a total of 105 rules in 15 ms. Remains 39 /94 variables (removed 55) and now considering 64/175 (removed 111) transitions.
[2024-05-24 02:52:52] [INFO ] Flow matrix only has 58 transitions (discarded 6 similar events)
// Phase 1: matrix 58 rows 39 cols
[2024-05-24 02:52:52] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:52:52] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 02:52:52] [INFO ] Flow matrix only has 58 transitions (discarded 6 similar events)
[2024-05-24 02:52:52] [INFO ] Invariant cache hit.
[2024-05-24 02:52:52] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-24 02:52:52] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-24 02:52:52] [INFO ] Flow matrix only has 58 transitions (discarded 6 similar events)
[2024-05-24 02:52:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-24 02:52:52] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-24 02:52:52] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-24 02:52:52] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:52:52] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:52:52] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-24 02:52:52] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:52:52] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-24 02:52:52] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 57/96 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/97 variables, and 54 constraints, problems are : Problem set: 0 solved, 50 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 57/96 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 50/104 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/97 variables, and 104 constraints, problems are : Problem set: 0 solved, 50 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 8/8 constraints]
After SMT, in 1583ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1583ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/94 places, 64/175 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1682 ms. Remains : 39/94 places, 64/175 transitions.
[2024-05-24 02:52:53] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:52:53] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:53] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-24 02:52:53] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:53] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality18361977273411687397.gal : 1 ms
[2024-05-24 02:52:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality9003090769975994367.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/CTLCardinality18361977273411687397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9003090769975994367.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,18940,0.031777,4592,2,758,5,4648,6,0,210,5731,0
Converting to forward existential form...Done !
original formula: EF((AG((((p63==0)||(p14==1))||(p15!=0))) + AF(EG(((p73==0) + A((p13==0) U ((p64==0)||(p63==1))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((((p63==0)||(p14==1))||(p15!=0))))))] != FALSE + [(FwdU(Init,TRUE) * !(EG(!(EG...288
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t17, t18, t19, t20, t28...310
(forward)formula 0,1,0.107013,8024,1,0,149,22236,143,58,1389,18656,139
FORMULA HealthRecord-PT-02-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 58 transition count 104
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 58 transition count 104
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 49 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 49 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 49 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 47 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 47 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 46 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 46 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 46 transition count 73
Applied a total of 101 rules in 7 ms. Remains 46 /94 variables (removed 48) and now considering 73/175 (removed 102) transitions.
[2024-05-24 02:52:53] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
// Phase 1: matrix 72 rows 46 cols
[2024-05-24 02:52:53] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:52:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 02:52:53] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
[2024-05-24 02:52:53] [INFO ] Invariant cache hit.
[2024-05-24 02:52:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:53] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-24 02:52:53] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
[2024-05-24 02:52:53] [INFO ] Invariant cache hit.
[2024-05-24 02:52:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 02:52:54] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
[2024-05-24 02:52:54] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 71/117 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/118 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 02:52:54] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/118 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 57 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1521 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 02:52:55] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 71/117 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 72/129 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/118 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 130 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1475 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints]
After SMT, in 3008ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3008ms
Starting structural reductions in LTL mode, iteration 1 : 46/94 places, 73/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3095 ms. Remains : 46/94 places, 73/175 transitions.
[2024-05-24 02:52:56] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:52:56] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:52:56] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-24 02:52:56] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:52:56] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:52:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality9008696823032970431.gal : 0 ms
[2024-05-24 02:52:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5163707105642894692.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/CTLCardinality9008696823032970431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5163707105642894692.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,40833,0.018285,3856,2,383,5,1814,6,0,255,1572,0
Converting to forward existential form...Done !
original formula: A(AF(!(AG(EX(TRUE)))) U (EX(EG(AG((p100==0)))) + (p89==1)))
=> equivalent forward existential formula: [((Init * !(EG(!((EX(EG(!(E(TRUE U !((p100==0)))))) + (p89==1)))))) * !(E(!((EX(EG(!(E(TRUE U !((p100==0)))))) +...276
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...262
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.298188,16232,1,0,283,77731,181,175,1837,72165,312
FORMULA HealthRecord-PT-02-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2024-05-24 02:52:57] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:52:57] [INFO ] Flatten gal took : 4 ms
Total runtime 80027 ms.
BK_STOP 1716519177305
--------------------
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-02"
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-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640604000705"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-02.tgz
mv HealthRecord-PT-02 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;