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.r550-tall-171734898900225.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 FireWire-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898900225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 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 FireWire-PT-08-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717360894067

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 20:41:35] [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-06-02 20:41:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:41:35] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-02 20:41:35] [INFO ] Transformed 127 places.
[2024-06-02 20:41:35] [INFO ] Transformed 397 transitions.
[2024-06-02 20:41:35] [INFO ] Found NUPN structural information;
[2024-06-02 20:41:35] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 87 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 336
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 124 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 124 transition count 329
Applied a total of 13 rules in 30 ms. Remains 124 /127 variables (removed 3) and now considering 329/344 (removed 15) transitions.
[2024-06-02 20:41:35] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
// Phase 1: matrix 303 rows 124 cols
[2024-06-02 20:41:35] [INFO ] Computed 8 invariants in 19 ms
[2024-06-02 20:41:35] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-02 20:41:35] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2024-06-02 20:41:35] [INFO ] Invariant cache hit.
[2024-06-02 20:41:35] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:41:35] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-02 20:41:35] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2024-06-02 20:41:35] [INFO ] Invariant cache hit.
[2024-06-02 20:41:35] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-02 20:41:37] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 8 ms to minimize.
[2024-06-02 20:41:37] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:41:38] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:41:38] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-02 20:41:38] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:41:38] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:41:39] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:41:39] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 302/426 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 42/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 1/427 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (OVERLAPS) 0/427 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 183 constraints, problems are : Problem set: 0 solved, 328 unsolved in 14073 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 302/426 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 42/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 328/510 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 1/427 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (OVERLAPS) 0/427 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 511 constraints, problems are : Problem set: 0 solved, 328 unsolved in 28488 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 8/8 constraints]
After SMT, in 42879ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 42903ms
Starting structural reductions in LTL mode, iteration 1 : 124/127 places, 329/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43365 ms. Remains : 124/127 places, 329/344 transitions.
Support contains 87 out of 124 places after structural reductions.
[2024-06-02 20:42:18] [INFO ] Flatten gal took : 47 ms
[2024-06-02 20:42:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:42:18] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:42:19] [INFO ] Input system was already deterministic with 329 transitions.
Support contains 79 out of 124 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (2160 resets) in 2019 ms. (19 steps per ms) remains 28/60 properties
BEST_FIRST walk for 4001 steps (57 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (44 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (58 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (64 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (53 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (55 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (71 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (61 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (61 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (65 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (56 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (60 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (31 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (59 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (55 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (59 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (65 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (58 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (53 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (56 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (58 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (61 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (56 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (40 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (62 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (48 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (58 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
[2024-06-02 20:42:19] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2024-06-02 20:42:19] [INFO ] Invariant cache hit.
[2024-06-02 20:42:20] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 81/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 302/425 variables, 123/131 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/426 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/427 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/427 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 175 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 81/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:42:21] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 302/425 variables, 123/140 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 42/182 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 26/208 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/426 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 20:42:23] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:42:23] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 1/427 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-02 20:42:24] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/427 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (OVERLAPS) 0/427 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 215 constraints, problems are : Problem set: 0 solved, 28 unsolved in 4489 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 12/12 constraints]
After SMT, in 5548ms problems are : Problem set: 0 solved, 28 unsolved
Parikh walk visited 0 properties in 2172 ms.
Support contains 42 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 329/329 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 123 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 123 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 123 transition count 323
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 10 place count 121 transition count 327
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 14 place count 121 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 121 transition count 321
Applied a total of 16 rules in 49 ms. Remains 121 /124 variables (removed 3) and now considering 321/329 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 121/124 places, 321/329 transitions.
RANDOM walk for 40000 steps (2248 resets) in 527 ms. (75 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (60 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (42 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (73 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (79 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (51 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (54 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (71 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (51 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (63 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (68 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (60 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (59 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (50 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (40 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (45 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (65 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (65 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (37 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (64 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (65 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (51 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (70 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (69 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (60 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (64 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (66 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 521181 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :18 out of 27
Probabilistic random walk after 521181 steps, saw 116630 distinct states, run finished after 3005 ms. (steps per millisecond=173 ) properties seen :18
[2024-06-02 20:42:31] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 121 cols
[2024-06-02 20:42:31] [INFO ] Computed 8 invariants in 7 ms
[2024-06-02 20:42:31] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 103/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 20:42:31] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-06-02 20:42:31] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:42:31] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 295/413 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 44/173 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 3/416 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 20:42:31] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/416 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/416 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 177 constraints, problems are : Problem set: 0 solved, 9 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 103/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 295/413 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 44/175 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:42:32] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 3/416 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/416 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 189 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints]
After SMT, in 1841ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 2221 ms.
Support contains 15 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 321/321 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 315
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 118 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 117 transition count 316
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 117 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 117 transition count 313
Applied a total of 12 rules in 47 ms. Remains 117 /121 variables (removed 4) and now considering 313/321 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 117/121 places, 313/321 transitions.
RANDOM walk for 40000 steps (2169 resets) in 680 ms. (58 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (558 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (555 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (567 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (573 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (580 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (402 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (562 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (570 resets) in 40 ms. (975 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (574 resets) in 44 ms. (888 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 558899 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 9
Probabilistic random walk after 558899 steps, saw 124351 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-06-02 20:42:38] [INFO ] Flow matrix only has 285 transitions (discarded 28 similar events)
// Phase 1: matrix 285 rows 117 cols
[2024-06-02 20:42:38] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:42:38] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 99/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 20:42:38] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:42:38] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 285/399 variables, 114/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 44/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 3/402 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 171 constraints, problems are : Problem set: 0 solved, 9 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 99/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 20:42:39] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 285/399 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 44/169 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 20:42:39] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 3/402 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/402 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 182 constraints, problems are : Problem set: 0 solved, 9 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 3414 ms.
Support contains 15 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 313/313 transitions.
Applied a total of 0 rules in 22 ms. Remains 117 /117 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 117/117 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 313/313 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-02 20:42:43] [INFO ] Flow matrix only has 285 transitions (discarded 28 similar events)
[2024-06-02 20:42:43] [INFO ] Invariant cache hit.
[2024-06-02 20:42:43] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 20:42:43] [INFO ] Flow matrix only has 285 transitions (discarded 28 similar events)
[2024-06-02 20:42:43] [INFO ] Invariant cache hit.
[2024-06-02 20:42:43] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 20:42:43] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-02 20:42:43] [INFO ] Redundant transitions in 15 ms returned []
Running 312 sub problems to find dead transitions.
[2024-06-02 20:42:43] [INFO ] Flow matrix only has 285 transitions (discarded 28 similar events)
[2024-06-02 20:42:43] [INFO ] Invariant cache hit.
[2024-06-02 20:42:43] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:42:45] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:42:45] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:42:45] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:42:45] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 3 ms to minimize.
[2024-06-02 20:42:45] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:42:45] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:42:46] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:42:46] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:42:46] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-06-02 20:42:47] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:42:47] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 285/402 variables, 117/136 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 180 constraints, problems are : Problem set: 0 solved, 312 unsolved in 8941 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 285/402 variables, 117/136 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 312/492 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 492 constraints, problems are : Problem set: 0 solved, 312 unsolved in 16816 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 11/11 constraints]
After SMT, in 25980ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 25983ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26251 ms. Remains : 117/117 places, 313/313 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 117 vertex of which 31 / 117 are part of one of the 5 SCC in 2 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 122 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 129 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 90 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 89 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 89 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 88 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 87 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 87 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 87 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 0 with 2 rules applied. Total rules applied 15 place count 86 transition count 149
Applied a total of 15 rules in 35 ms. Remains 86 /117 variables (removed 31) and now considering 149/313 (removed 164) transitions.
Running SMT prover for 9 properties.
[2024-06-02 20:43:09] [INFO ] Flow matrix only has 147 transitions (discarded 2 similar events)
// Phase 1: matrix 147 rows 86 cols
[2024-06-02 20:43:09] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:43:09] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 20:43:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:43:09] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 20:43:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 20:43:09] [INFO ] After 53ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-06-02 20:43:09] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:43:09] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:43:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2024-06-02 20:43:09] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:43:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
TRAPS : Iteration 1
[2024-06-02 20:43:10] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-06-02 20:43:10] [INFO ] After 594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 697 ms.
[2024-06-02 20:43:10] [INFO ] Flatten gal took : 26 ms
[2024-06-02 20:43:10] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:43:10] [INFO ] Input system was already deterministic with 329 transitions.
Computed a total of 23 stabilizing places and 48 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 109 transition count 293
Applied a total of 32 rules in 39 ms. Remains 109 /124 variables (removed 15) and now considering 293/329 (removed 36) transitions.
[2024-06-02 20:43:10] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
// Phase 1: matrix 267 rows 109 cols
[2024-06-02 20:43:10] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:43:10] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:43:10] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2024-06-02 20:43:10] [INFO ] Invariant cache hit.
[2024-06-02 20:43:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:43:10] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-02 20:43:10] [INFO ] Redundant transitions in 9 ms returned []
Running 292 sub problems to find dead transitions.
[2024-06-02 20:43:10] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2024-06-02 20:43:10] [INFO ] Invariant cache hit.
[2024-06-02 20:43:10] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:43:12] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-02 20:43:13] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-06-02 20:43:13] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/375 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 37/164 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 165 constraints, problems are : Problem set: 0 solved, 292 unsolved in 11114 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/375 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 37/164 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 292/456 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-02 20:43:37] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/376 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 458 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 11/11 constraints]
After SMT, in 41302ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 41305ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/124 places, 293/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41677 ms. Remains : 109/124 places, 293/329 transitions.
[2024-06-02 20:43:52] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:43:52] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:43:52] [INFO ] Input system was already deterministic with 293 transitions.
[2024-06-02 20:43:52] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:43:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:43:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality7814453081129187566.gal : 14 ms
[2024-06-02 20:43:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3293745381421893274.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/CTLCardinality7814453081129187566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3293745381421893274.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,9.34039e+06,1.6652,55548,2,2621,5,190698,6,0,728,184821,0


Converting to forward existential form...Done !
original formula: E(EG(!(((((p85==0)||(p86==1))||(p0==1)) * EF((p9==0))))) U EF(((p89==1)&&(!((p61==0)||(p122==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EG(!(((((p85==0)||(p86==1))||(p0==1)) * E(TRUE U (p9==0)))))),TRUE) * ((p89==1)&&(!((p61==0)||(...177
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...625
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.64525,181972,1,0,715,866057,619,399,6424,790421,773
FORMULA FireWire-PT-08-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 321
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 108 transition count 291
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 107 transition count 290
Applied a total of 35 rules in 36 ms. Remains 107 /124 variables (removed 17) and now considering 290/329 (removed 39) transitions.
[2024-06-02 20:43:58] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 107 cols
[2024-06-02 20:43:58] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:43:58] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 20:43:58] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:43:58] [INFO ] Invariant cache hit.
[2024-06-02 20:43:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:43:59] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-06-02 20:43:59] [INFO ] Redundant transitions in 4 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-02 20:43:59] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:43:59] [INFO ] Invariant cache hit.
[2024-06-02 20:43:59] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:44:00] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:44:00] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:44:00] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:44:00] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:44:01] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:44:01] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:44:01] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:44:01] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (OVERLAPS) 263/370 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/371 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 0/371 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 161 constraints, problems are : Problem set: 0 solved, 289 unsolved in 10096 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/370 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 289/449 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:44:14] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 1/371 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 0/371 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 451 constraints, problems are : Problem set: 0 solved, 289 unsolved in 24561 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 9/9 constraints]
After SMT, in 34803ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 34806ms
Starting structural reductions in SI_CTL mode, iteration 1 : 107/124 places, 290/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35143 ms. Remains : 107/124 places, 290/329 transitions.
[2024-06-02 20:44:33] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:44:33] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:44:34] [INFO ] Input system was already deterministic with 290 transitions.
[2024-06-02 20:44:34] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:44:34] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:44:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality17690676997123178208.gal : 3 ms
[2024-06-02 20:44:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality12187696306254546693.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/CTLCardinality17690676997123178208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12187696306254546693.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,9.81211e+06,4.32218,133700,2,6131,5,352769,6,0,717,461767,0


Converting to forward existential form...Done !
original formula: EG(((p24==0)||(p12==1)))
=> equivalent forward existential formula: [FwdG(Init,((p24==0)||(p12==1)))] != FALSE
Hit Full ! (commute/partial/dont) 279/0/11
(forward)formula 0,1,10.394,234668,1,0,11,781361,19,4,4255,819146,9
FORMULA FireWire-PT-08-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 288
Applied a total of 36 rules in 12 ms. Remains 107 /124 variables (removed 17) and now considering 288/329 (removed 41) transitions.
[2024-06-02 20:44:44] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 107 cols
[2024-06-02 20:44:44] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:44:44] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:44:44] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:44:44] [INFO ] Invariant cache hit.
[2024-06-02 20:44:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:44:44] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-06-02 20:44:44] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 20:44:44] [INFO ] Invariant cache hit.
[2024-06-02 20:44:44] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 20:44:46] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:44:46] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:44:46] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:44:46] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:44:46] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:44:46] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 20:44:51] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:44:51] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 161 constraints, problems are : Problem set: 0 solved, 287 unsolved in 11150 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/447 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 448 constraints, problems are : Problem set: 0 solved, 287 unsolved in 18462 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 8/8 constraints]
After SMT, in 29756ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 29759ms
Starting structural reductions in LTL mode, iteration 1 : 107/124 places, 288/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29974 ms. Remains : 107/124 places, 288/329 transitions.
[2024-06-02 20:45:14] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:45:14] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:45:14] [INFO ] Input system was already deterministic with 288 transitions.
[2024-06-02 20:45:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:45:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:45:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality8092379233276853630.gal : 2 ms
[2024-06-02 20:45:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality17893938777083698050.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/CTLCardinality8092379233276853630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17893938777083698050.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,5.2475,161756,1,0,6,443377,7,1,1102,562005,1
FORMULA FireWire-PT-08-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 321
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 120 transition count 319
Applied a total of 10 rules in 3 ms. Remains 120 /124 variables (removed 4) and now considering 319/329 (removed 10) transitions.
[2024-06-02 20:45:19] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
// Phase 1: matrix 293 rows 120 cols
[2024-06-02 20:45:19] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:45:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 20:45:19] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
[2024-06-02 20:45:19] [INFO ] Invariant cache hit.
[2024-06-02 20:45:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:45:20] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2024-06-02 20:45:20] [INFO ] Flow matrix only has 293 transitions (discarded 26 similar events)
[2024-06-02 20:45:20] [INFO ] Invariant cache hit.
[2024-06-02 20:45:20] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 20:45:21] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:45:21] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:45:21] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:45:21] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:45:22] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:45:22] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:45:22] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-06-02 20:45:23] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (OVERLAPS) 292/412 variables, 120/136 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 42/178 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 179 constraints, problems are : Problem set: 0 solved, 318 unsolved in 10776 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 292/412 variables, 120/136 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 42/178 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 318/496 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 497 constraints, problems are : Problem set: 0 solved, 318 unsolved in 24975 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 8/8 constraints]
After SMT, in 35934ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 35937ms
Starting structural reductions in LTL mode, iteration 1 : 120/124 places, 319/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36209 ms. Remains : 120/124 places, 319/329 transitions.
[2024-06-02 20:45:56] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:45:56] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:45:56] [INFO ] Input system was already deterministic with 319 transitions.
[2024-06-02 20:45:56] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:45:56] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:45:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality6083327536087968372.gal : 3 ms
[2024-06-02 20:45:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality3251406565163702755.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/CTLCardinality6083327536087968372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3251406565163702755.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19214e+07,0.773546,32664,2,2450,5,97152,6,0,798,102613,0


Converting to forward existential form...Done !
original formula: EG(AF(E((AX((p23==1)) * ((p113==0)||(p33==1))) U AG((((p63==1)||(p103==0))||(p101==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E((!(EX(!((p23==1)))) * ((p113==0)||(p33==1))) U !(E(TRUE U !((((p63==1)||(p103==0))||(p101==1...175
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...690
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.8502,346876,1,0,815,1.99054e+06,675,433,6993,1.88674e+06,889
FORMULA FireWire-PT-08-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 302
Applied a total of 24 rules in 7 ms. Remains 113 /124 variables (removed 11) and now considering 302/329 (removed 27) transitions.
[2024-06-02 20:46:08] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 113 cols
[2024-06-02 20:46:08] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:46:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 20:46:08] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 20:46:08] [INFO ] Invariant cache hit.
[2024-06-02 20:46:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:46:08] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-06-02 20:46:08] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 20:46:08] [INFO ] Invariant cache hit.
[2024-06-02 20:46:08] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-06-02 20:46:09] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:46:09] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:46:10] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:46:10] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:46:10] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
[2024-06-02 20:46:10] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:46:10] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:46:10] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:46:10] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:46:10] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 275/388 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 39/170 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 171 constraints, problems are : Problem set: 0 solved, 301 unsolved in 12043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 275/388 variables, 113/131 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 39/170 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 301/471 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (OVERLAPS) 0/389 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 472 constraints, problems are : Problem set: 0 solved, 301 unsolved in 22859 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 10/10 constraints]
After SMT, in 35076ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 35079ms
Starting structural reductions in LTL mode, iteration 1 : 113/124 places, 302/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35340 ms. Remains : 113/124 places, 302/329 transitions.
[2024-06-02 20:46:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:46:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:46:43] [INFO ] Input system was already deterministic with 302 transitions.
[2024-06-02 20:46:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:46:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:46:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality2644918218322411588.gal : 2 ms
[2024-06-02 20:46:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14185530065666971715.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/CTLCardinality2644918218322411588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14185530065666971715.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: !(E(!((EF(EX((p97==1))) + (((p65==0)||(p45==1))&&(((p103==1)||((p125==0)&&((p55==0)||(p99==1))))||(p119==1))))) U EF(((AX((p81==1)) + EF(...222
=> equivalent forward existential formula: [(FwdU((FwdU(FwdU(Init,!((E(TRUE U EX((p97==1))) + (((p65==0)||(p45==1))&&(((p103==1)||((p125==0)&&((p55==0)||(p...290
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...654
Hit Full ! (commute/partial/dont) 290/12/12
(forward)formula 0,0,7.80566,211828,1,0,663,1.07454e+06,640,337,6699,842014,754
FORMULA FireWire-PT-08-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Applied a total of 12 rules in 6 ms. Remains 119 /124 variables (removed 5) and now considering 317/329 (removed 12) transitions.
[2024-06-02 20:46:51] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 119 cols
[2024-06-02 20:46:51] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:46:51] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:46:51] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 20:46:51] [INFO ] Invariant cache hit.
[2024-06-02 20:46:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:46:51] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2024-06-02 20:46:51] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2024-06-02 20:46:51] [INFO ] Invariant cache hit.
[2024-06-02 20:46:51] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 20:46:53] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:46:53] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:46:53] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:46:53] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:46:53] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:46:53] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:46:54] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:46:54] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 178 constraints, problems are : Problem set: 0 solved, 316 unsolved in 12474 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/493 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (OVERLAPS) 0/410 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 494 constraints, problems are : Problem set: 0 solved, 316 unsolved in 26618 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 8/8 constraints]
After SMT, in 39264ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 39268ms
Starting structural reductions in LTL mode, iteration 1 : 119/124 places, 317/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39516 ms. Remains : 119/124 places, 317/329 transitions.
[2024-06-02 20:47:30] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:47:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:47:30] [INFO ] Input system was already deterministic with 317 transitions.
[2024-06-02 20:47:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:47:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:47:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality9062346595066078131.gal : 3 ms
[2024-06-02 20:47:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality16151674513811795377.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/CTLCardinality9062346595066078131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16151674513811795377.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX((EX(((p46==0)&&(p5==1))) + (EF((p75==1)) * ((p106==0)||(p99==1)))))
=> equivalent forward existential formula: ([(EY(EY(Init)) * ((p46==0)&&(p5==1)))] != FALSE + [(FwdU((EY(Init) * ((p106==0)||(p99==1))),TRUE) * (p75==1))] ...164
(forward)formula 0,1,0.754891,21564,1,0,13,64908,11,3,1570,56462,7
FORMULA FireWire-PT-08-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 311
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 115 transition count 310
Applied a total of 18 rules in 15 ms. Remains 115 /124 variables (removed 9) and now considering 310/329 (removed 19) transitions.
[2024-06-02 20:47:31] [INFO ] Flow matrix only has 284 transitions (discarded 26 similar events)
// Phase 1: matrix 284 rows 115 cols
[2024-06-02 20:47:31] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:47:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:47:31] [INFO ] Flow matrix only has 284 transitions (discarded 26 similar events)
[2024-06-02 20:47:31] [INFO ] Invariant cache hit.
[2024-06-02 20:47:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:47:31] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 20:47:31] [INFO ] Redundant transitions in 2 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-02 20:47:31] [INFO ] Flow matrix only has 284 transitions (discarded 26 similar events)
[2024-06-02 20:47:31] [INFO ] Invariant cache hit.
[2024-06-02 20:47:31] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:47:33] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:47:33] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:47:33] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:47:33] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:47:33] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-02 20:47:33] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:47:33] [INFO ] Deduced a trap composed of 42 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:47:33] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 283/397 variables, 114/130 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 40/170 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 1/398 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:47:40] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/399 variables, and 172 constraints, problems are : Problem set: 0 solved, 307 unsolved in 14325 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 283/397 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 40/171 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 307/478 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/399 variables, and 479 constraints, problems are : Problem set: 0 solved, 307 unsolved in 16219 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 9/9 constraints]
After SMT, in 30703ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 30706ms
Starting structural reductions in SI_CTL mode, iteration 1 : 115/124 places, 310/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30971 ms. Remains : 115/124 places, 310/329 transitions.
[2024-06-02 20:48:02] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:48:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:48:02] [INFO ] Input system was already deterministic with 310 transitions.
[2024-06-02 20:48:02] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:48:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:48:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality5133900874366079104.gal : 2 ms
[2024-06-02 20:48:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality8978264534487100385.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/CTLCardinality5133900874366079104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8978264534487100385.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,9.47815e+06,0.475832,21244,2,2231,5,68101,6,0,769,57025,0


Converting to forward existential form...Done !
original formula: EF(((p80==1) + EG(AG(!(E(((p121==0)||(p85==1)) U ((p115==0)||(p43==1))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p80==1))] != FALSE + [FwdG(FwdU(Init,TRUE),!(E(TRUE U !(!(E(((p121==0)||(p85==1)) U ((p115...187
(forward)formula 0,1,0.477052,21508,1,0,7,68101,8,1,772,57025,1
FORMULA FireWire-PT-08-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 321
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 119 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 119 transition count 316
Applied a total of 12 rules in 3 ms. Remains 119 /124 variables (removed 5) and now considering 316/329 (removed 13) transitions.
[2024-06-02 20:48:03] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
// Phase 1: matrix 290 rows 119 cols
[2024-06-02 20:48:03] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:48:03] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:48:03] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2024-06-02 20:48:03] [INFO ] Invariant cache hit.
[2024-06-02 20:48:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:48:03] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2024-06-02 20:48:03] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2024-06-02 20:48:03] [INFO ] Invariant cache hit.
[2024-06-02 20:48:03] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:48:05] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:48:06] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/408 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 1/409 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (OVERLAPS) 0/409 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 176 constraints, problems are : Problem set: 0 solved, 315 unsolved in 12431 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/408 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 315/490 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (OVERLAPS) 1/409 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 10 (OVERLAPS) 0/409 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 491 constraints, problems are : Problem set: 0 solved, 315 unsolved in 25814 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 7/7 constraints]
After SMT, in 38420ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 38423ms
Starting structural reductions in LTL mode, iteration 1 : 119/124 places, 316/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38655 ms. Remains : 119/124 places, 316/329 transitions.
[2024-06-02 20:48:41] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:48:41] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:48:41] [INFO ] Input system was already deterministic with 316 transitions.
[2024-06-02 20:48:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:48:41] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:48:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality9164904273253934366.gal : 2 ms
[2024-06-02 20:48:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality12448074497882605173.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/CTLCardinality9164904273253934366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12448074497882605173.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(((p43==0)||(p78==1)) U E(((p61!=0) + !(AX(((p114==0)||(p77==1))))) U AG(((AX(((p66==0)||(p40==1))) * AF(((p18==0)||(p13==1)))) * !(((p2...176
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((p43==0)||(p78==1))),((p61!=0) + !(!(EX(!(((p114==0)||(p77==1)))))))) * !(E(TRUE U !(((!(EX(!(...253
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...679
Hit Full ! (commute/partial/dont) 306/0/10
(forward)formula 0,1,17.1804,484364,1,0,842,2.37563e+06,675,435,6928,2.40163e+06,924
FORMULA FireWire-PT-08-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 115 transition count 308
Applied a total of 20 rules in 21 ms. Remains 115 /124 variables (removed 9) and now considering 308/329 (removed 21) transitions.
[2024-06-02 20:48:59] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
// Phase 1: matrix 282 rows 115 cols
[2024-06-02 20:48:59] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:48:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 20:48:59] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 20:48:59] [INFO ] Invariant cache hit.
[2024-06-02 20:48:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:48:59] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-06-02 20:48:59] [INFO ] Redundant transitions in 2 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-02 20:48:59] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2024-06-02 20:48:59] [INFO ] Invariant cache hit.
[2024-06-02 20:48:59] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:49:01] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2024-06-02 20:49:01] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-02 20:49:01] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2024-06-02 20:49:01] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
[2024-06-02 20:49:01] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:49:01] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-06-02 20:49:01] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:49:02] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:49:02] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/132 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 173 constraints, problems are : Problem set: 0 solved, 307 unsolved in 11790 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 281/396 variables, 115/132 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 307/479 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 480 constraints, problems are : Problem set: 0 solved, 307 unsolved in 21783 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 9/9 constraints]
After SMT, in 33731ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 33735ms
Starting structural reductions in SI_CTL mode, iteration 1 : 115/124 places, 308/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34093 ms. Remains : 115/124 places, 308/329 transitions.
[2024-06-02 20:49:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:49:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:49:33] [INFO ] Input system was already deterministic with 308 transitions.
[2024-06-02 20:49:33] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:49:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:49:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality14883468168942803265.gal : 1 ms
[2024-06-02 20:49:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality136841937098157104.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/CTLCardinality14883468168942803265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality136841937098157104.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,9.45859e+06,0.736374,28880,2,2214,5,91093,6,0,767,93933,0


Converting to forward existential form...Done !
original formula: AG(EF(!(E(((((p118==1)||(p71==0))||((p64==1)||(p71==0)))||(p73==1)) U (EF(((p78==0)||(p91==1))) * ((p71==0)||(p16==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(((((p118==1)||(p71==0))||((p64==1)||(p71==0)))||(p73==1)) U (E(TRUE U ((p78==...207
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...661
(forward)formula 0,0,21.2234,619332,1,0,903,3.21354e+06,639,459,6515,2.95853e+06,1010
FORMULA FireWire-PT-08-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 323
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 121 transition count 322
Applied a total of 7 rules in 2 ms. Remains 121 /124 variables (removed 3) and now considering 322/329 (removed 7) transitions.
[2024-06-02 20:49:54] [INFO ] Flow matrix only has 296 transitions (discarded 26 similar events)
// Phase 1: matrix 296 rows 121 cols
[2024-06-02 20:49:54] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:49:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 20:49:54] [INFO ] Flow matrix only has 296 transitions (discarded 26 similar events)
[2024-06-02 20:49:54] [INFO ] Invariant cache hit.
[2024-06-02 20:49:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:49:55] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-02 20:49:55] [INFO ] Flow matrix only has 296 transitions (discarded 26 similar events)
[2024-06-02 20:49:55] [INFO ] Invariant cache hit.
[2024-06-02 20:49:55] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-02 20:49:56] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:49:56] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:49:56] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:49:56] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:49:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:49:57] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:49:57] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:49:57] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:49:57] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:49:57] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-06-02 20:49:57] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 295/416 variables, 121/140 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 42/182 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 1/417 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 183 constraints, problems are : Problem set: 0 solved, 321 unsolved in 13399 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 295/416 variables, 121/140 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 42/182 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 321/503 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 1/417 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-02 20:50:24] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 505 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 12/12 constraints]
After SMT, in 43572ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 43576ms
Starting structural reductions in LTL mode, iteration 1 : 121/124 places, 322/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43831 ms. Remains : 121/124 places, 322/329 transitions.
[2024-06-02 20:50:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:50:38] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:50:38] [INFO ] Input system was already deterministic with 322 transitions.
[2024-06-02 20:50:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:50:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:50:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality10316225698987499213.gal : 2 ms
[2024-06-02 20:50:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality12928624716225547023.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/CTLCardinality10316225698987499213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12928624716225547023.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,1.18721e+07,0.480891,21860,2,2395,5,65729,6,0,805,56850,0


Converting to forward existential form...Done !
original formula: A(!(AF(((((!((p72==0)||(p123==1)))||(p91==1))||((p119==0)||(p31==1))) + ((EF(((p60==0)||(p118==1))) * (((p94==1)||(p120==0))||(p45==1))) ...283
=> equivalent forward existential formula: [((Init * !(EG(!((EX(!(EX(!((p69!=1))))) * !(EG(!(E(TRUE U !(!((E(!((p29==1)) U (!((p65==1)) * !((p29==1)))) + E...736
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t8, t12, t13, t15, t16, t17, t19, t21, t25, t26, t28, t29, t30, t32, t34,...697
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
(forward)formula 0,1,20.9094,595488,1,0,941,3.36173e+06,702,495,7035,3.38896e+06,1051
FORMULA FireWire-PT-08-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 323
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 120 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 118 transition count 314
Applied a total of 13 rules in 10 ms. Remains 118 /124 variables (removed 6) and now considering 314/329 (removed 15) transitions.
[2024-06-02 20:50:59] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
// Phase 1: matrix 288 rows 118 cols
[2024-06-02 20:50:59] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:50:59] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:50:59] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2024-06-02 20:50:59] [INFO ] Invariant cache hit.
[2024-06-02 20:50:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:51:00] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-06-02 20:51:00] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
[2024-06-02 20:51:00] [INFO ] Invariant cache hit.
[2024-06-02 20:51:00] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:51:01] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:51:01] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:51:01] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:51:01] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:51:01] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:51:02] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:51:02] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:51:02] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:51:03] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 287/405 variables, 118/135 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 40/175 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/406 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (OVERLAPS) 0/406 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 176 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10358 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 287/405 variables, 118/135 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 40/175 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 313/488 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/406 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (OVERLAPS) 0/406 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 489 constraints, problems are : Problem set: 0 solved, 313 unsolved in 26896 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 9/9 constraints]
After SMT, in 37430ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 37433ms
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 314/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37690 ms. Remains : 118/124 places, 314/329 transitions.
[2024-06-02 20:51:37] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:51:37] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:51:37] [INFO ] Input system was already deterministic with 314 transitions.
[2024-06-02 20:51:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:51:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:51:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality13583171302460778225.gal : 2 ms
[2024-06-02 20:51:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality11177218844317033547.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/CTLCardinality13583171302460778225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11177218844317033547.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,1.21104e+07,0.490781,21012,2,2529,5,68387,6,0,785,55925,0


Converting to forward existential form...Done !
original formula: (!(A(((EX(TRUE) + (p106==0)) + (p83==1)) U (EG(((p54==0)||(p104==1))) * (p116==1)))) * A(((E(!((((p96==1)||(p37==0))||(p107==1))) U (p54=...282
=> equivalent forward existential formula: [(((Init * !(!((E(!((EG(((p54==0)||(p104==1))) * (p116==1))) U (!(((EX(TRUE) + (p106==0)) + (p83==1))) * !((EG((...586
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...673
Detected timeout of ITS tools.
[2024-06-02 20:52:07] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:52:07] [INFO ] Applying decomposition
[2024-06-02 20:52:07] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7417243553176544038.txt' '-o' '/tmp/graph7417243553176544038.bin' '-w' '/tmp/graph7417243553176544038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7417243553176544038.bin' '-l' '-1' '-v' '-w' '/tmp/graph7417243553176544038.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:52:07] [INFO ] Decomposing Gal with order
[2024-06-02 20:52:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:52:07] [INFO ] Removed a total of 488 redundant transitions.
[2024-06-02 20:52:07] [INFO ] Flatten gal took : 102 ms
[2024-06-02 20:52:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 32 ms.
[2024-06-02 20:52:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality1301915669246977734.gal : 21 ms
[2024-06-02 20:52:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality17843487045188998075.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/CTLCardinality1301915669246977734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17843487045188998075.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21104e+07,1.19019,46524,1055,148,65811,1019,616,224426,90,6182,0


Converting to forward existential form...Done !
original formula: (!(A(((EX(TRUE) + (i6.u35.p106==0)) + (i5.u28.p83==1)) U (EG(((i2.u19.p54==0)||(i3.i1.u36.p104==1))) * (i5.u38.p116==1)))) * A(((E(!((((i...403
=> equivalent forward existential formula: [(((Init * !(!((E(!((EG(((i2.u19.p54==0)||(i3.i1.u36.p104==1))) * (i5.u38.p116==1))) U (!(((EX(TRUE) + (i6.u35.p...795
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t59, t64, t65, t69, t74, t79, t83, t94, t97, t99, t138, t139, t1...835
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,27.3868,887768,1,0,1.42049e+06,2925,3384,4.34531e+06,390,14957,2162415
FORMULA FireWire-PT-08-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 315
Applied a total of 14 rules in 8 ms. Remains 117 /124 variables (removed 7) and now considering 315/329 (removed 14) transitions.
[2024-06-02 20:52:35] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
// Phase 1: matrix 289 rows 117 cols
[2024-06-02 20:52:35] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:52:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 20:52:35] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2024-06-02 20:52:35] [INFO ] Invariant cache hit.
[2024-06-02 20:52:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:52:35] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-06-02 20:52:35] [INFO ] Redundant transitions in 2 ms returned []
Running 312 sub problems to find dead transitions.
[2024-06-02 20:52:35] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2024-06-02 20:52:35] [INFO ] Invariant cache hit.
[2024-06-02 20:52:35] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:52:36] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:52:36] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-06-02 20:52:36] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:52:37] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:52:37] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:52:37] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:52:37] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:52:37] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:52:37] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-02 20:52:37] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:52:38] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 288/404 variables, 116/135 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 1/405 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 0/405 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/406 variables, and 177 constraints, problems are : Problem set: 0 solved, 312 unsolved in 13259 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 288/404 variables, 116/135 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 312/488 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:52:52] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 1/405 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (OVERLAPS) 0/405 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/406 variables, and 490 constraints, problems are : Problem set: 0 solved, 312 unsolved in 27604 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 12/12 constraints]
After SMT, in 41046ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 41050ms
Starting structural reductions in SI_CTL mode, iteration 1 : 117/124 places, 315/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41299 ms. Remains : 117/124 places, 315/329 transitions.
[2024-06-02 20:53:16] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:53:16] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:53:16] [INFO ] Input system was already deterministic with 315 transitions.
[2024-06-02 20:53:16] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:53:16] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:53:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality5455609535224885389.gal : 2 ms
[2024-06-02 20:53:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality12499463765511903906.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/CTLCardinality5455609535224885389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12499463765511903906.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,9.51755e+06,0.478825,19992,2,2175,5,60958,6,0,782,54901,0


Converting to forward existential form...Done !
original formula: EG(AG(((p75==0) + EF((p54==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((p75==0) + E(TRUE U (p54==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...684
(forward)formula 0,1,2.15823,70536,1,0,578,294619,653,294,6699,286233,643
FORMULA FireWire-PT-08-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 120 transition count 321
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 119 transition count 320
Applied a total of 9 rules in 15 ms. Remains 119 /124 variables (removed 5) and now considering 320/329 (removed 9) transitions.
[2024-06-02 20:53:19] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
// Phase 1: matrix 294 rows 119 cols
[2024-06-02 20:53:19] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:53:19] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:53:19] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
[2024-06-02 20:53:19] [INFO ] Invariant cache hit.
[2024-06-02 20:53:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:53:19] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-06-02 20:53:19] [INFO ] Redundant transitions in 2 ms returned []
Running 317 sub problems to find dead transitions.
[2024-06-02 20:53:19] [INFO ] Flow matrix only has 294 transitions (discarded 26 similar events)
[2024-06-02 20:53:19] [INFO ] Invariant cache hit.
[2024-06-02 20:53:19] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-02 20:53:20] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:53:20] [INFO ] Deduced a trap composed of 42 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:53:20] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:53:20] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:53:20] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-02 20:53:20] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:53:20] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:53:21] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-02 20:53:21] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:53:21] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (OVERLAPS) 293/411 variables, 118/136 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 41/177 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-02 20:53:24] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 1/412 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-02 20:53:31] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 10 (OVERLAPS) 0/412 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/413 variables, and 180 constraints, problems are : Problem set: 0 solved, 317 unsolved in 17133 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (OVERLAPS) 293/411 variables, 118/138 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 317/496 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 1/412 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (OVERLAPS) 0/412 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/413 variables, and 497 constraints, problems are : Problem set: 0 solved, 317 unsolved in 19116 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 12/12 constraints]
After SMT, in 36432ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 36435ms
Starting structural reductions in SI_CTL mode, iteration 1 : 119/124 places, 320/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36680 ms. Remains : 119/124 places, 320/329 transitions.
[2024-06-02 20:53:55] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:53:55] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:53:55] [INFO ] Input system was already deterministic with 320 transitions.
[2024-06-02 20:53:55] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:53:55] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:53:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality8422425996864559201.gal : 2 ms
[2024-06-02 20:53:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality400514587666208714.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/CTLCardinality8422425996864559201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality400514587666208714.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: !(E((((p59==0)||(p124==1)) * E((p1==1) U ((p92==0)||(p15==1)))) U (!(EF(((p88==0)||(p74==1)))) * !((((p84==0)||(p11==1))||((p119==0)&&(p1...167
=> equivalent forward existential formula: [((FwdU(Init,(((p59==0)||(p124==1)) * E((p1==1) U ((p92==0)||(p15==1))))) * !((((p84==0)||(p11==1))||((p119==0)&...215
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33,...690
Detected timeout of ITS tools.
[2024-06-02 20:54:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:54:25] [INFO ] Applying decomposition
[2024-06-02 20:54:25] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3411368818557866425.txt' '-o' '/tmp/graph3411368818557866425.bin' '-w' '/tmp/graph3411368818557866425.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3411368818557866425.bin' '-l' '-1' '-v' '-w' '/tmp/graph3411368818557866425.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:54:25] [INFO ] Decomposing Gal with order
[2024-06-02 20:54:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:54:25] [INFO ] Removed a total of 499 redundant transitions.
[2024-06-02 20:54:25] [INFO ] Flatten gal took : 31 ms
[2024-06-02 20:54:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 8 ms.
[2024-06-02 20:54:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality3510040681638375488.gal : 2 ms
[2024-06-02 20:54:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality14163237705740700718.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/CTLCardinality3510040681638375488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14163237705740700718.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00815e+07,5.66692,196332,1922,203,258712,9313,663,1.32234e+06,89,69861,0


Converting to forward existential form...Done !
original formula: !(E((((i2.u18.p59==0)||(i0.i1.u3.p124==1)) * E((i5.i2.u35.p1==1) U ((i3.u32.p92==0)||(i0.i0.u5.p15==1)))) U (!(EF(((i0.i1.u30.p88==0)||(i...262
=> equivalent forward existential formula: [((FwdU(Init,(((i2.u18.p59==0)||(i0.i1.u3.p124==1)) * E((i5.i2.u35.p1==1) U ((i3.u32.p92==0)||(i0.i0.u5.p15==1))...310
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t91, t92, t93, t94, t97, t99, t140,...905
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 315
Applied a total of 14 rules in 18 ms. Remains 117 /124 variables (removed 7) and now considering 315/329 (removed 14) transitions.
[2024-06-02 20:54:56] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
// Phase 1: matrix 289 rows 117 cols
[2024-06-02 20:54:56] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:54:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:54:56] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2024-06-02 20:54:56] [INFO ] Invariant cache hit.
[2024-06-02 20:54:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:54:56] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-06-02 20:54:56] [INFO ] Redundant transitions in 2 ms returned []
Running 312 sub problems to find dead transitions.
[2024-06-02 20:54:56] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2024-06-02 20:54:56] [INFO ] Invariant cache hit.
[2024-06-02 20:54:56] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 42 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 3 ms to minimize.
[2024-06-02 20:54:57] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:54:58] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:54:58] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-02 20:54:58] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:54:59] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 288/404 variables, 116/135 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 1/405 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 0/405 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/406 variables, and 177 constraints, problems are : Problem set: 0 solved, 312 unsolved in 13480 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 288/404 variables, 116/135 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 312/488 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:55:13] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 1/405 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (OVERLAPS) 0/405 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/406 variables, and 490 constraints, problems are : Problem set: 0 solved, 312 unsolved in 27031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 12/12 constraints]
After SMT, in 40680ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 40682ms
Starting structural reductions in SI_CTL mode, iteration 1 : 117/124 places, 315/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40923 ms. Remains : 117/124 places, 315/329 transitions.
[2024-06-02 20:55:37] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:55:37] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:55:37] [INFO ] Input system was already deterministic with 315 transitions.
[2024-06-02 20:55:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:55:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:55:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2358677843739259792.gal : 2 ms
[2024-06-02 20:55:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality1912844471620560022.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/CTLCardinality2358677843739259792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1912844471620560022.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,9.51755e+06,0.471265,19988,2,2175,5,60958,6,0,782,54901,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((p75==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (p75==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...684
(forward)formula 0,0,18.4213,506376,1,0,749,2.64878e+06,654,379,6579,1.96209e+06,854
FORMULA FireWire-PT-08-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 105 transition count 286
Applied a total of 38 rules in 27 ms. Remains 105 /124 variables (removed 19) and now considering 286/329 (removed 43) transitions.
[2024-06-02 20:55:55] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
// Phase 1: matrix 260 rows 105 cols
[2024-06-02 20:55:55] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:55:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:55:55] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2024-06-02 20:55:55] [INFO ] Invariant cache hit.
[2024-06-02 20:55:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:55:55] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-02 20:55:55] [INFO ] Redundant transitions in 1 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 20:55:55] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2024-06-02 20:55:55] [INFO ] Invariant cache hit.
[2024-06-02 20:55:55] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:55:56] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:55:56] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:55:56] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
[2024-06-02 20:55:56] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2024-06-02 20:55:57] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:55:57] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:55:57] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 20:55:59] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/365 variables, and 157 constraints, problems are : Problem set: 0 solved, 283 unsolved in 11979 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 283/439 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/365 variables, and 440 constraints, problems are : Problem set: 0 solved, 283 unsolved in 14456 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 8/8 constraints]
After SMT, in 26562ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 26564ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/124 places, 286/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26808 ms. Remains : 105/124 places, 286/329 transitions.
[2024-06-02 20:56:22] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:56:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:56:22] [INFO ] Input system was already deterministic with 286 transitions.
[2024-06-02 20:56:22] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:56:22] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:56:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality13740854698598300071.gal : 1 ms
[2024-06-02 20:56:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality16872359302260856437.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/CTLCardinality13740854698598300071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16872359302260856437.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,9.2827e+06,3.48264,106200,2,5120,5,297236,6,0,705,383219,0


Converting to forward existential form...Done !
original formula: EF(EG(!(E(A((p5==1) U ((p40==0)||(p101==1))) U ((p93==0)||(p26==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(!((E(!(((p40==0)||(p101==1))) U (!((p5==1)) * !(((p40==0)||(p101==1))))) + EG(!(((p40=...210
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...612
(forward)formula 0,1,25.636,643556,1,0,1064,3.86975e+06,604,552,5956,3.61933e+06,1140
FORMULA FireWire-PT-08-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 20:56:48] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:56:48] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:56:48] [INFO ] Applying decomposition
[2024-06-02 20:56:48] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9002276820678226604.txt' '-o' '/tmp/graph9002276820678226604.bin' '-w' '/tmp/graph9002276820678226604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9002276820678226604.bin' '-l' '-1' '-v' '-w' '/tmp/graph9002276820678226604.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:56:48] [INFO ] Decomposing Gal with order
[2024-06-02 20:56:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:56:48] [INFO ] Removed a total of 516 redundant transitions.
[2024-06-02 20:56:48] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:56:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 7 ms.
[2024-06-02 20:56:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality2360050175286293039.gal : 3 ms
[2024-06-02 20:56:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality13450303547160547358.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/CTLCardinality2360050175286293039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13450303547160547358.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32132e+07,1.6758,56408,1446,214,86797,1406,601,194840,90,11873,0


Converting to forward existential form...Done !
original formula: !(E((((i4.u18.p59==0)||(i2.u3.p124==1)) * E((i7.u43.p1==1) U ((i5.u32.p92==0)||(i1.u5.p15==1)))) U (!(EF(((i2.u30.p88==0)||(i6.i1.u24.p74...244
=> equivalent forward existential formula: [((FwdU(Init,(((i4.u18.p59==0)||(i2.u3.p124==1)) * E((i7.u43.p1==1) U ((i5.u32.p92==0)||(i1.u5.p15==1))))) * !((...292
Reverse transition relation is NOT exact ! Due to transitions t43, t45, t46, t49, t50, t52, t58, t60, t65, t70, t75, t80, t84, t92, t93, t94, t95, t98, t10...844
(forward)formula 0,1,47.7208,1091628,1,0,1.67418e+06,6418,3140,3.95171e+06,378,89920,3777243
FORMULA FireWire-PT-08-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 961232 ms.

BK_STOP 1717361856405

--------------------
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="FireWire-PT-08"
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 FireWire-PT-08, 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 r550-tall-171734898900225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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