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

About the Execution of ITS-Tools for FireWire-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3062.859 684155.00 748084.00 1814.80 FFTFFFFFTTFFFTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898700177.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-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898700177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K 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.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 86K 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-02-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717358928169

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 20:08:49] [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:08:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:08:49] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 20:08:49] [INFO ] Transformed 108 places.
[2024-06-02 20:08:49] [INFO ] Transformed 355 transitions.
[2024-06-02 20:08:49] [INFO ] Found NUPN structural information;
[2024-06-02 20:08:49] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 54 transitions
Reduce redundant transitions removed 54 transitions.
FORMULA FireWire-PT-02-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-02-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 108 transition count 295
Applied a total of 6 rules in 21 ms. Remains 108 /108 variables (removed 0) and now considering 295/301 (removed 6) transitions.
[2024-06-02 20:08:49] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
// Phase 1: matrix 269 rows 108 cols
[2024-06-02 20:08:49] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 20:08:49] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-02 20:08:49] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2024-06-02 20:08:49] [INFO ] Invariant cache hit.
[2024-06-02 20:08:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:08:50] [INFO ] Implicit Places using invariants and state equation in 182 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 442 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 295/301 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 482 ms. Remains : 107/108 places, 295/301 transitions.
Support contains 63 out of 107 places after structural reductions.
[2024-06-02 20:08:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 20:08:50] [INFO ] Flatten gal took : 46 ms
FORMULA FireWire-PT-02-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:08:50] [INFO ] Flatten gal took : 26 ms
[2024-06-02 20:08:50] [INFO ] Input system was already deterministic with 295 transitions.
Support contains 55 out of 107 places (down from 63) after GAL structural reductions.
RANDOM walk for 40000 steps (2245 resets) in 1841 ms. (21 steps per ms) remains 13/37 properties
BEST_FIRST walk for 40004 steps (572 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (592 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (589 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (572 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (582 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (574 resets) in 183 ms. (217 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (568 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (648 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (600 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (570 resets) in 53 ms. (740 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (565 resets) in 55 ms. (714 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (512 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (456 resets) in 61 ms. (645 steps per ms) remains 13/13 properties
[2024-06-02 20:08:51] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
// Phase 1: matrix 269 rows 107 cols
[2024-06-02 20:08:51] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:08:51] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 2 (OVERLAPS) 74/101 variables, 6/33 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 74/107 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-06-02 20:08:51] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 9 ms to minimize.
[2024-06-02 20:08:51] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:08:51] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:08:52] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 4/111 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/103 variables, 1/112 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 2/114 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 265/368 variables, 103/217 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 38/255 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/255 constraints. Problems are: Problem set: 2 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 4/372 variables, 2/257 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 2/259 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 1/260 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-06-02 20:08:52] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 1/261 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-06-02 20:08:52] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 1/262 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/372 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 3/375 variables, 2/264 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/375 variables, 2/266 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/375 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 1/376 variables, 1/267 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/376 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 0/376 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 267 constraints, problems are : Problem set: 2 solved, 11 unsolved in 1575 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 86/101 variables, 6/21 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 86/107 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 6/113 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/113 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/103 variables, 1/114 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 2/116 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 265/368 variables, 103/219 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 38/257 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 10/267 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 4/372 variables, 2/269 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 2/271 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 1/272 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 1/273 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-06-02 20:08:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/372 variables, 1/274 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/372 variables, 0/274 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 3/375 variables, 2/276 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/375 variables, 2/278 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 0/278 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 1/376 variables, 1/279 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/376 variables, 0/279 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 24 (OVERLAPS) 0/376 variables, 0/279 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 279 constraints, problems are : Problem set: 2 solved, 11 unsolved in 1600 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 11/13 constraints, Known Traps: 7/7 constraints]
After SMT, in 3223ms problems are : Problem set: 2 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 3 properties in 1958 ms.
Support contains 12 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 295/295 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 106 transition count 290
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 105 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 11 place count 101 transition count 280
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 101 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 101 transition count 278
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 19 place count 99 transition count 274
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 99 transition count 274
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 97 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 97 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 97 transition count 272
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 97 transition count 274
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 35 place count 96 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 96 transition count 270
Applied a total of 37 rules in 82 ms. Remains 96 /107 variables (removed 11) and now considering 270/295 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 96/107 places, 270/295 transitions.
RANDOM walk for 40000 steps (2460 resets) in 261 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (654 resets) in 93 ms. (425 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (687 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (659 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (601 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (679 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (626 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (624 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
[2024-06-02 20:08:57] [INFO ] Flow matrix only has 243 transitions (discarded 27 similar events)
// Phase 1: matrix 243 rows 96 cols
[2024-06-02 20:08:57] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 20:08:57] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 80/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:08:57] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:08:57] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:08:57] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/94 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:08:57] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 242/336 variables, 94/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 38/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 3/339 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:08:57] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/339 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/339 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/339 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 147 constraints, problems are : Problem set: 0 solved, 7 unsolved in 752 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 80/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/94 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 242/336 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 38/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 3/339 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/339 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/339 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 154 constraints, problems are : Problem set: 0 solved, 7 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 1163ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1126 ms.
Support contains 10 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 270/270 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 268
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 95 transition count 267
Applied a total of 3 rules in 25 ms. Remains 95 /96 variables (removed 1) and now considering 267/270 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 95/96 places, 267/270 transitions.
RANDOM walk for 40000 steps (2433 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (656 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (648 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (665 resets) in 42 ms. (930 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (718 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (595 resets) in 36 ms. (1081 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (704 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (643 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 5491 steps, run visited all 7 properties in 44 ms. (steps per millisecond=124 )
Probabilistic random walk after 5491 steps, saw 3065 distinct states, run finished after 48 ms. (steps per millisecond=114 ) properties seen :7
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2024-06-02 20:08:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 20:08:59] [INFO ] Flatten gal took : 23 ms
FORMULA FireWire-PT-02-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:08:59] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:08:59] [INFO ] Input system was already deterministic with 295 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 105 transition count 293
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 105 transition count 292
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 104 transition count 292
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 10 place count 98 transition count 277
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 98 transition count 277
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 98 transition count 274
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 22 place count 95 transition count 268
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 95 transition count 268
Applied a total of 25 rules in 28 ms. Remains 95 /107 variables (removed 12) and now considering 268/295 (removed 27) transitions.
[2024-06-02 20:09:00] [INFO ] Flow matrix only has 242 transitions (discarded 26 similar events)
// Phase 1: matrix 242 rows 95 cols
[2024-06-02 20:09:00] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:09:00] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-02 20:09:00] [INFO ] Flow matrix only has 242 transitions (discarded 26 similar events)
[2024-06-02 20:09:00] [INFO ] Invariant cache hit.
[2024-06-02 20:09:00] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 20:09:00] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-06-02 20:09:00] [INFO ] Redundant transitions in 11 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 20:09:00] [INFO ] Flow matrix only has 242 transitions (discarded 26 similar events)
[2024-06-02 20:09:00] [INFO ] Invariant cache hit.
[2024-06-02 20:09:00] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 20:09:01] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:09:01] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:09:01] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:09:01] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:09:01] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:09:01] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-06-02 20:09:01] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:09:02] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:09:02] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:09:02] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 241/335 variables, 94/111 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/337 variables, and 147 constraints, problems are : Problem set: 0 solved, 265 unsolved in 8730 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 241/335 variables, 94/111 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 265/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/336 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/337 variables, and 412 constraints, problems are : Problem set: 0 solved, 265 unsolved in 13047 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 10/10 constraints]
After SMT, in 21946ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 21950ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/107 places, 268/295 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22351 ms. Remains : 95/107 places, 268/295 transitions.
[2024-06-02 20:09:22] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:09:22] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:09:22] [INFO ] Input system was already deterministic with 268 transitions.
RANDOM walk for 40000 steps (2629 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
[2024-06-02 20:09:22] [INFO ] Flatten gal took : 68 ms
BEST_FIRST walk for 40004 steps (685 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2560 steps, run visited all 1 properties in 7 ms. (steps per millisecond=365 )
Probabilistic random walk after 2560 steps, saw 1193 distinct states, run finished after 7 ms. (steps per millisecond=365 ) properties seen :1
FORMULA FireWire-PT-02-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 20:09:22] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:09:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality497663456969108536.gal : 16 ms
[2024-06-02 20:09:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13476399993061716414.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality497663456969108536.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13476399993061716414.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 106 transition count 294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 106 transition count 293
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 105 transition count 293
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 10 place count 99 transition count 278
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 99 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 99 transition count 275
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 22 place count 96 transition count 269
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 96 transition count 269
Applied a total of 25 rules in 23 ms. Remains 96 /107 variables (removed 11) and now considering 269/295 (removed 26) transitions.
[2024-06-02 20:09:22] [INFO ] Flow matrix only has 243 transitions (discarded 26 similar events)
// Phase 1: matrix 243 rows 96 cols
[2024-06-02 20:09:22] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:09:22] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 20:09:22] [INFO ] Flow matrix only has 243 transitions (discarded 26 similar events)
[2024-06-02 20:09:22] [INFO ] Invariant cache hit.
[2024-06-02 20:09:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:09:22] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-02 20:09:22] [INFO ] Redundant transitions in 3 ms returned []
Running 268 sub problems to find dead transitions.
[2024-06-02 20:09:22] [INFO ] Flow matrix only has 243 transitions (discarded 26 similar events)
[2024-06-02 20:09:22] [INFO ] Invariant cache hit.
[2024-06-02 20:09:22] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-02 20:09:24] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:09:24] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:09:24] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:09:24] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:09:24] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:09:24] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:09:24] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:09:24] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 242/338 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 36/147 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/339 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/339 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 148 constraints, problems are : Problem set: 0 solved, 268 unsolved in 9891 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 242/338 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 36/147 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 268/415 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-02 20:09:37] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 1/339 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (OVERLAPS) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 417 constraints, problems are : Problem set: 0 solved, 268 unsolved in 23557 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 9/9 constraints]
After SMT, in 33597ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 33600ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/107 places, 269/295 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33826 ms. Remains : 96/107 places, 269/295 transitions.
[2024-06-02 20:09:56] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:09:56] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:09:56] [INFO ] Input system was already deterministic with 269 transitions.
[2024-06-02 20:09:56] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:09:56] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:09:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality10729395821722064259.gal : 3 ms
[2024-06-02 20:09:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality11496094863582796142.ctl : 11 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/CTLCardinality10729395821722064259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11496094863582796142.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.01593e+06,0.973926,34940,2,2457,5,88296,6,0,652,92323,0


Converting to forward existential form...Done !
original formula: AG(EF(EG(((p36==0)&&(p92==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(((p36==0)&&(p92==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...584
(forward)formula 0,0,7.41245,204212,1,0,758,1.06166e+06,562,387,5450,847638,863
FORMULA FireWire-PT-02-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 101 transition count 277
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 99 transition count 273
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 99 transition count 273
Applied a total of 19 rules in 6 ms. Remains 99 /107 variables (removed 8) and now considering 273/295 (removed 22) transitions.
[2024-06-02 20:10:04] [INFO ] Flow matrix only has 247 transitions (discarded 26 similar events)
// Phase 1: matrix 247 rows 99 cols
[2024-06-02 20:10:04] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:10:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 20:10:04] [INFO ] Flow matrix only has 247 transitions (discarded 26 similar events)
[2024-06-02 20:10:04] [INFO ] Invariant cache hit.
[2024-06-02 20:10:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:10:04] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-06-02 20:10:04] [INFO ] Flow matrix only has 247 transitions (discarded 26 similar events)
[2024-06-02 20:10:04] [INFO ] Invariant cache hit.
[2024-06-02 20:10:04] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-06-02 20:10:05] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:10:05] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:10:05] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:10:05] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 4 ms to minimize.
[2024-06-02 20:10:06] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:10:06] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:10:06] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-02 20:10:06] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-06-02 20:10:07] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 246/345 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/346 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 0/346 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 152 constraints, problems are : Problem set: 0 solved, 272 unsolved in 10568 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 246/345 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 272/423 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/346 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 0/346 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 424 constraints, problems are : Problem set: 0 solved, 272 unsolved in 14253 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 9/9 constraints]
After SMT, in 24973ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 24977ms
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 273/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25186 ms. Remains : 99/107 places, 273/295 transitions.
[2024-06-02 20:10:29] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:10:29] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:10:29] [INFO ] Input system was already deterministic with 273 transitions.
[2024-06-02 20:10:29] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:10:29] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:10:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality10708305276216200727.gal : 11 ms
[2024-06-02 20:10:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality15516379593404486580.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/CTLCardinality10708305276216200727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15516379593404486580.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.38249e+06,1.22365,42168,2,2854,5,118740,6,0,668,112298,0


Converting to forward existential form...Done !
original formula: EF(EX((AG(((p101==1)&&(p10!=1))) * ((((p57==0)&&(p79==1))||((p103==0)&&(p34==1)))||((p30==0)&&(p27==1))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * ((((p57==0)&&(p79==1))||((p103==0)&&(p34==1)))||((p30==0)&&(p27==1)))) * !(E(TRUE U !((...189
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...584
(forward)formula 0,1,3.04663,79696,1,0,497,352175,566,257,5622,314845,569
FORMULA FireWire-PT-02-CTLCardinality-2024-02 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 : 107/107 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 101 transition count 277
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 98 transition count 271
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 98 transition count 271
Applied a total of 21 rules in 7 ms. Remains 98 /107 variables (removed 9) and now considering 271/295 (removed 24) transitions.
[2024-06-02 20:10:32] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 20:10:32] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:10:32] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 20:10:32] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:10:32] [INFO ] Invariant cache hit.
[2024-06-02 20:10:32] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:10:32] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 20:10:32] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:10:32] [INFO ] Invariant cache hit.
[2024-06-02 20:10:32] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:10:33] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:10:34] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-06-02 20:10:34] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:10:34] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:10:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-02 20:10:34] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-02 20:10:34] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-02 20:10:34] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:10:34] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 151 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10406 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 270/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 421 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15348 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
After SMT, in 25897ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 25901ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 271/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26190 ms. Remains : 98/107 places, 271/295 transitions.
[2024-06-02 20:10:58] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:10:58] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:10:58] [INFO ] Input system was already deterministic with 271 transitions.
[2024-06-02 20:10:58] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:10:58] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:10:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality7103187293388533809.gal : 2 ms
[2024-06-02 20:10:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality8731296317755047115.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/CTLCardinality7103187293388533809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8731296317755047115.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.34646e+06,1.31405,45088,2,2752,5,126707,6,0,662,117682,0


Converting to forward existential form...Done !
original formula: AG((E(!((!((((p88==0)||(p43==1))||(p34==0))) * EX((p36==0)))) U AF(!(((p19==0)||(p2==1))))) + EG(AX(AF(((p31==0)&&(p94==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(EX(!(!(EG(!(((p31==0)&&(p94==1))))))))))) * !(E(!((!((((p88==0)||(p43==1))||(p34==0)...221
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...584
Detected timeout of ITS tools.
[2024-06-02 20:11:28] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:11:28] [INFO ] Applying decomposition
[2024-06-02 20:11:28] [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/graph598785898991766917.txt' '-o' '/tmp/graph598785898991766917.bin' '-w' '/tmp/graph598785898991766917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph598785898991766917.bin' '-l' '-1' '-v' '-w' '/tmp/graph598785898991766917.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:11:28] [INFO ] Decomposing Gal with order
[2024-06-02 20:11:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:11:28] [INFO ] Removed a total of 377 redundant transitions.
[2024-06-02 20:11:28] [INFO ] Flatten gal took : 44 ms
[2024-06-02 20:11:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 11 ms.
[2024-06-02 20:11:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality11903435210804999369.gal : 3 ms
[2024-06-02 20:11:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality13007432841782585969.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/CTLCardinality11903435210804999369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13007432841782585969.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34646e+06,9.45528,272628,2456,214,419559,8289,560,1.24755e+06,120,45757,0


Converting to forward existential form...Done !
original formula: AG((E(!((!((((i5.i0.u32.p88==0)||(i0.i0.u14.p43==1))||(i3.u10.p34==0))) * EX((i3.u11.p36==0)))) U AF(!(((i0.i1.u5.p19==0)||(i0.i0.u0.p2==...215
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(EX(!(!(EG(!(((i3.u11.p31==0)&&(i5.i1.u27.p94==1))))))))))) * !(E(!((!((((i5.i0.u32.p...290
Reverse transition relation is NOT exact ! Due to transitions t42, t44, t48, t49, t58, t60, t102, t116, t118, t127, t141, t153, t187, t189, t192, t204, t24...873
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 282
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 102 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 100 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 100 transition count 276
Applied a total of 16 rules in 8 ms. Remains 100 /107 variables (removed 7) and now considering 276/295 (removed 19) transitions.
[2024-06-02 20:11:58] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
// Phase 1: matrix 250 rows 100 cols
[2024-06-02 20:11:58] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:11:59] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 20:11:59] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2024-06-02 20:11:59] [INFO ] Invariant cache hit.
[2024-06-02 20:11:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:11:59] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-06-02 20:11:59] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2024-06-02 20:11:59] [INFO ] Invariant cache hit.
[2024-06-02 20:11:59] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:12:00] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:12:00] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:12:00] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:12:00] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:12:00] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:12:01] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:12:01] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:12:01] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:12:01] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 249/349 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 153 constraints, problems are : Problem set: 0 solved, 275 unsolved in 10174 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 249/349 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 275/427 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 10 (OVERLAPS) 0/350 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 428 constraints, problems are : Problem set: 0 solved, 275 unsolved in 15897 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
After SMT, in 26241ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 26245ms
Starting structural reductions in LTL mode, iteration 1 : 100/107 places, 276/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26572 ms. Remains : 100/107 places, 276/295 transitions.
[2024-06-02 20:12:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:12:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:12:25] [INFO ] Input system was already deterministic with 276 transitions.
[2024-06-02 20:12:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:12:25] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:12:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality5225371092304606902.gal : 2 ms
[2024-06-02 20:12:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality5988674137367150072.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/CTLCardinality5225371092304606902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5988674137367150072.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.4595e+06,1.25627,43848,2,2842,5,123295,6,0,675,115602,0


Converting to forward existential form...Done !
original formula: EX(AG((EX(((p85==0)||(p39==1))) + AG(E((p57==1) U ((p5==0)||(p22==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((EX(((p85==0)||(p39==1))) + !(E(TRUE U !(E((p57==1) U ((p5==0)||(p22==1)))))))))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...590
(forward)formula 0,0,16.8033,396568,1,0,634,2.05177e+06,575,328,5747,1.47729e+06,738
FORMULA FireWire-PT-02-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 101 transition count 277
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 98 transition count 271
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 98 transition count 271
Applied a total of 21 rules in 4 ms. Remains 98 /107 variables (removed 9) and now considering 271/295 (removed 24) transitions.
[2024-06-02 20:12:42] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 20:12:42] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 20:12:42] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 20:12:42] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:12:42] [INFO ] Invariant cache hit.
[2024-06-02 20:12:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:12:42] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 20:12:42] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:12:42] [INFO ] Invariant cache hit.
[2024-06-02 20:12:42] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:12:44] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:12:44] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-06-02 20:12:44] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 20:12:44] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:12:44] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:12:44] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:12:44] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:12:45] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:12:45] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 151 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10437 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 270/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 421 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15113 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
After SMT, in 25694ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 25697ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 271/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26067 ms. Remains : 98/107 places, 271/295 transitions.
[2024-06-02 20:13:08] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:13:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:13:08] [INFO ] Input system was already deterministic with 271 transitions.
[2024-06-02 20:13:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:13:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:13:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality12519229183681591753.gal : 2 ms
[2024-06-02 20:13:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality11372564786614960524.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/CTLCardinality12519229183681591753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11372564786614960524.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.34646e+06,1.23905,45112,2,2752,5,126707,6,0,662,117682,0


Converting to forward existential form...Done !
original formula: AF(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...584
(forward)formula 0,1,2.16527,54896,1,0,481,239011,560,249,5548,249376,548
FORMULA FireWire-PT-02-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 282
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 102 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 99 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 99 transition count 274
Applied a total of 18 rules in 5 ms. Remains 99 /107 variables (removed 8) and now considering 274/295 (removed 21) transitions.
[2024-06-02 20:13:10] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
// Phase 1: matrix 248 rows 99 cols
[2024-06-02 20:13:10] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:13:10] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:13:11] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
[2024-06-02 20:13:11] [INFO ] Invariant cache hit.
[2024-06-02 20:13:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:13:11] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2024-06-02 20:13:11] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
[2024-06-02 20:13:11] [INFO ] Invariant cache hit.
[2024-06-02 20:13:11] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-02 20:13:12] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:13:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:13:12] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:13:12] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:13:12] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:13:12] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:13:13] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:13:13] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/114 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-02 20:13:14] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 1/347 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 152 constraints, problems are : Problem set: 0 solved, 273 unsolved in 11549 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 273/424 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 1/347 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 425 constraints, problems are : Problem set: 0 solved, 273 unsolved in 17969 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 9/9 constraints]
After SMT, in 29668ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 29671ms
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 274/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29873 ms. Remains : 99/107 places, 274/295 transitions.
[2024-06-02 20:13:40] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:13:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:13:40] [INFO ] Input system was already deterministic with 274 transitions.
[2024-06-02 20:13:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:13:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:13:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality4950402809952350938.gal : 1 ms
[2024-06-02 20:13:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality12606151672205916188.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/CTLCardinality4950402809952350938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12606151672205916188.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.36514e+06,1.27212,44360,2,2772,5,125405,6,0,669,111360,0


Converting to forward existential form...Done !
original formula: E((p66==1) U ((AF(EX(TRUE)) * EG(AG((p79==0)))) * ((((p27==0)||(p50==1))||((p58==0)||(p23==1))) + (AG((p51==1)) * (A(((p45==0)||(p77==1))...209
=> equivalent forward existential formula: ([((FwdU(Init,(p66==1)) * (!(EG(!(EX(TRUE)))) * EG(!(E(TRUE U !((p79==0))))))) * (((p27==0)||(p50==1))||((p58==0...569
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...589
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 272/0/2
(forward)formula 0,0,20.9699,530104,1,0,1019,3.02888e+06,605,551,5813,2.69477e+06,1115
FORMULA FireWire-PT-02-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 282
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 102 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 99 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 99 transition count 274
Applied a total of 18 rules in 3 ms. Remains 99 /107 variables (removed 8) and now considering 274/295 (removed 21) transitions.
[2024-06-02 20:14:02] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
// Phase 1: matrix 248 rows 99 cols
[2024-06-02 20:14:02] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:14:02] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 20:14:02] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
[2024-06-02 20:14:02] [INFO ] Invariant cache hit.
[2024-06-02 20:14:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:14:02] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2024-06-02 20:14:02] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
[2024-06-02 20:14:02] [INFO ] Invariant cache hit.
[2024-06-02 20:14:02] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-02 20:14:03] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:14:03] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:14:03] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-02 20:14:03] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:14:03] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:14:03] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:14:04] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:14:04] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/114 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-02 20:14:06] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 1/347 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 152 constraints, problems are : Problem set: 0 solved, 273 unsolved in 11518 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 273/424 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 1/347 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 425 constraints, problems are : Problem set: 0 solved, 273 unsolved in 15247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 9/9 constraints]
After SMT, in 26915ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 26918ms
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 274/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27113 ms. Remains : 99/107 places, 274/295 transitions.
[2024-06-02 20:14:29] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:14:29] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:14:29] [INFO ] Input system was already deterministic with 274 transitions.
[2024-06-02 20:14:29] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:14:29] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:14:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15339338870630353844.gal : 1 ms
[2024-06-02 20:14:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality3713498660792489574.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/CTLCardinality15339338870630353844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3713498660792489574.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.42347e+06,1.16321,43688,2,2798,5,123391,6,0,669,116127,0


Converting to forward existential form...Done !
original formula: AG(((!(A(EF((p78==1)) U AX((p39==1)))) + !(E(AG(((p101==0)||(p43==1))) U !(((p27==0)||(p97==1)))))) + !(A((p62!=1) U AF((p64==1))))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(!(!((E(!(!(EG(!((p64==1))))) U (!((p62!=1)) * !(!(EG(!((p64==1))))))) + EG(!(!(EG(!...366
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...590
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 20:14:59] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:14:59] [INFO ] Applying decomposition
[2024-06-02 20:14:59] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10540206523534755478.txt' '-o' '/tmp/graph10540206523534755478.bin' '-w' '/tmp/graph10540206523534755478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10540206523534755478.bin' '-l' '-1' '-v' '-w' '/tmp/graph10540206523534755478.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:14:59] [INFO ] Decomposing Gal with order
[2024-06-02 20:14:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:14:59] [INFO ] Removed a total of 382 redundant transitions.
[2024-06-02 20:14:59] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:14:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 20 ms.
[2024-06-02 20:14:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3796118237333059423.gal : 4 ms
[2024-06-02 20:14:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality12259334173098524421.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/CTLCardinality3796118237333059423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12259334173098524421.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.42347e+06,3.70281,114212,1392,211,150916,3454,512,615443,124,23253,0


Converting to forward existential form...Done !
original formula: AG(((!(A(EF((i6.u32.p78==1)) U AX((i1.i0.u13.p39==1)))) + !(E(AG(((i0.u31.p101==0)||(i1.i0.u14.p43==1))) U !(((i2.u9.p27==0)||(i0.u29.p97...212
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(!(!((E(!(!(EG(!((i6.u32.p64==1))))) U (!((i5.u20.p62!=1)) * !(!(EG(!((i6.u32.p64==1...461
Reverse transition relation is NOT exact ! Due to transitions t1, t42, t44, t48, t49, t51, t58, t60, t64, t102, t118, t123, t128, t132, t133, t138, t141, t...786
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
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,25.6034,685356,1,0,935307,23393,2918,3.95252e+06,630,147864,1705918
FORMULA FireWire-PT-02-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 105 transition count 293
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 105 transition count 292
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 104 transition count 292
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 100 transition count 282
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 100 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 100 transition count 280
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 98 transition count 276
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 98 transition count 276
Applied a total of 18 rules in 22 ms. Remains 98 /107 variables (removed 9) and now considering 276/295 (removed 19) transitions.
[2024-06-02 20:15:25] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
// Phase 1: matrix 250 rows 98 cols
[2024-06-02 20:15:25] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:15:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 20:15:25] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2024-06-02 20:15:25] [INFO ] Invariant cache hit.
[2024-06-02 20:15:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:15:25] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-06-02 20:15:25] [INFO ] Redundant transitions in 3 ms returned []
Running 273 sub problems to find dead transitions.
[2024-06-02 20:15:25] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2024-06-02 20:15:25] [INFO ] Invariant cache hit.
[2024-06-02 20:15:25] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-02 20:15:26] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:15:26] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:15:26] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:15:26] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:15:26] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:15:26] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:15:26] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-06-02 20:15:26] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (OVERLAPS) 249/346 variables, 97/112 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 1/347 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/348 variables, and 149 constraints, problems are : Problem set: 0 solved, 273 unsolved in 8793 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (OVERLAPS) 249/346 variables, 97/112 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 273/421 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 1/347 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-02 20:15:45] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/347 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 11 (OVERLAPS) 0/347 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/348 variables, and 423 constraints, problems are : Problem set: 0 solved, 273 unsolved in 22458 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 9/9 constraints]
After SMT, in 31382ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 31385ms
Starting structural reductions in SI_CTL mode, iteration 1 : 98/107 places, 276/295 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31622 ms. Remains : 98/107 places, 276/295 transitions.
[2024-06-02 20:15:56] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:15:56] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:15:56] [INFO ] Input system was already deterministic with 276 transitions.
[2024-06-02 20:15:56] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:15:56] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:15:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality2278678538063467245.gal : 1 ms
[2024-06-02 20:15:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality14386485352997943416.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/CTLCardinality2278678538063467245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14386485352997943416.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.05337e+06,1.08986,40296,2,2447,5,109728,6,0,667,104588,0


Converting to forward existential form...Done !
original formula: E(!(AG(!(AG(!(((p20==0)||(p58==1))))))) U !(A(EG(A(((p77==0)||(p11==1)) U (p70==1))) U AG(((p74==0)||(p87==1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,!(!(E(TRUE U !(!(!(E(TRUE U !(!(((p20==0)||(p58==1)))))))))))),!(!(E(TRUE U !(((p74==0)|...436
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...601
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 20:16:26] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:16:26] [INFO ] Applying decomposition
[2024-06-02 20:16:26] [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/graph10593830705318929058.txt' '-o' '/tmp/graph10593830705318929058.bin' '-w' '/tmp/graph10593830705318929058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10593830705318929058.bin' '-l' '-1' '-v' '-w' '/tmp/graph10593830705318929058.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:16:26] [INFO ] Decomposing Gal with order
[2024-06-02 20:16:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:16:26] [INFO ] Removed a total of 396 redundant transitions.
[2024-06-02 20:16:26] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:16:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 8 ms.
[2024-06-02 20:16:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality13617084821641198296.gal : 2 ms
[2024-06-02 20:16:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality11054050479540747517.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/CTLCardinality13617084821641198296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11054050479540747517.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05337e+06,17.7315,477748,1911,214,351190,3326,574,4.57602e+06,99,31968,0


Converting to forward existential form...Done !
original formula: E(!(AG(!(AG(!(((i4.i1.u6.p20==0)||(i2.u19.p58==1))))))) U !(A(EG(A(((i4.i2.u23.p77==0)||(i4.i0.u3.p11==1)) U (i5.i0.u32.p70==1))) U AG(((...196
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,!(!(E(TRUE U !(!(!(E(TRUE U !(!(((i4.i1.u6.p20==0)||(i2.u19.p58==1)))))))))))),!(!(E(TRU...574
Reverse transition relation is NOT exact ! Due to transitions t0, t41, t43, t47, t48, t55, t56, t57, t58, t60, t61, t62, t106, t108, t124, t129, t134, t139...747
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 295/295 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 280
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 101 transition count 277
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 98 transition count 271
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 98 transition count 271
Applied a total of 21 rules in 3 ms. Remains 98 /107 variables (removed 9) and now considering 271/295 (removed 24) transitions.
[2024-06-02 20:16:56] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
// Phase 1: matrix 245 rows 98 cols
[2024-06-02 20:16:56] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:16:57] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:16:57] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:16:57] [INFO ] Invariant cache hit.
[2024-06-02 20:16:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:16:57] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 20:16:57] [INFO ] Flow matrix only has 245 transitions (discarded 26 similar events)
[2024-06-02 20:16:57] [INFO ] Invariant cache hit.
[2024-06-02 20:16:57] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:16:58] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 0 ms to minimize.
[2024-06-02 20:16:58] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:16:58] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:16:58] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:16:59] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:16:59] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-02 20:16:59] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:16:59] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:16:59] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 151 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10308 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 270/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 421 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15194 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
After SMT, in 25629ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 25632ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 271/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25928 ms. Remains : 98/107 places, 271/295 transitions.
[2024-06-02 20:17:22] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:17:22] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:17:22] [INFO ] Input system was already deterministic with 271 transitions.
[2024-06-02 20:17:22] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:17:22] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:17:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality16168458088790750549.gal : 1 ms
[2024-06-02 20:17:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4388942585495875247.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/CTLCardinality16168458088790750549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4388942585495875247.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.34646e+06,1.23836,45040,2,2752,5,126707,6,0,662,117682,0


Converting to forward existential form...Done !
original formula: EX(EX(EF(AX(((p34==0)||(p2==1))))))
=> equivalent forward existential formula: [(FwdU(EY(EY(Init)),TRUE) * !(EX(!(((p34==0)||(p2==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...584
(forward)formula 0,1,3.49358,93580,1,0,484,355075,557,248,5676,351559,550
FORMULA FireWire-PT-02-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 20:17:26] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:17:26] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:17:26] [INFO ] Applying decomposition
[2024-06-02 20:17:26] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14077218458190565488.txt' '-o' '/tmp/graph14077218458190565488.bin' '-w' '/tmp/graph14077218458190565488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14077218458190565488.bin' '-l' '-1' '-v' '-w' '/tmp/graph14077218458190565488.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:17:26] [INFO ] Decomposing Gal with order
[2024-06-02 20:17:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:17:26] [INFO ] Removed a total of 453 redundant transitions.
[2024-06-02 20:17:26] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:17:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 7 ms.
[2024-06-02 20:17:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality3687785887764956705.gal : 2 ms
[2024-06-02 20:17:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality12389775786702329654.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/CTLCardinality3687785887764956705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12389775786702329654.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 2 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.71221e+06,10.1423,254432,1732,75,284851,921,502,1.75347e+06,81,5270,0


Converting to forward existential form...Done !
original formula: AG((E(!((!((((i5.u28.p88==0)||(i6.i1.u13.p43==1))||(i1.u10.p34==0))) * EX((i1.u11.p36==0)))) U AF(!(((i6.i0.u6.p19==0)||(i2.u0.p2==1)))))...206
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(EX(!(!(EG(!(((i1.u11.p31==0)&&(i2.u30.p94==1))))))))))) * !(E(!((!((((i5.u28.p88==0)...281
Reverse transition relation is NOT exact ! Due to transitions t1, t42, t48, t49, t59, t64, t103, t104, t105, t107, t109, t125, t130, t135, t140, t145, t151...760
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 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,56.1291,1117636,1,0,1.0433e+06,2022,2717,8.66107e+06,370,8397,1415486
FORMULA FireWire-PT-02-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(!(AG(!(AG(!(((i6.i0.u7.p20==0)||(i4.u18.p58==1))))))) U !(A(EG(A(((i6.i2.u23.p77==0)||(i6.i0.u3.p11==1)) U (i5.u21.p70==1))) U AG(((i6....191
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,!(!(E(TRUE U !(!(!(E(TRUE U !(!(((i6.i0.u7.p20==0)||(i4.u18.p58==1)))))))))))),!(!(E(TRU...559
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 1,1,165.184,2204096,1,0,2.00568e+06,2337,2081,1.67824e+07,249,10937,1238374
FORMULA FireWire-PT-02-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 682954 ms.

BK_STOP 1717359612324

--------------------
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-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898700177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;