fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of ITS-Tools for CANInsertWithFailure-PT-005

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1353.867 351196.00 402831.00 824.90 FFTFTTFTFFFTTTFF 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.r070-tall-171620505100090.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 CANInsertWithFailure-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505100090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 07:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 07:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Apr 12 07:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 202K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2023-12
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2023-13
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2023-14
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716235482169

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-20 20:04:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 20:04:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 20:04:43] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-20 20:04:43] [INFO ] Transformed 114 places.
[2024-05-20 20:04:43] [INFO ] Transformed 180 transitions.
[2024-05-20 20:04:43] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 77 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 25 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2024-05-20 20:04:43] [INFO ] Computed 7 invariants in 15 ms
[2024-05-20 20:04:43] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-20 20:04:43] [INFO ] Invariant cache hit.
[2024-05-20 20:04:43] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 20:04:43] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-20 20:04:43] [INFO ] Invariant cache hit.
[2024-05-20 20:04:43] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:04:44] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 12 ms to minimize.
[2024-05-20 20:04:44] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:04:44] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:04:45] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:04:45] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:04:45] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:04:45] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:04:45] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:04:45] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 180/292 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:04:48] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/293 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 175 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9926 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:04:54] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:04:54] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
[2024-05-20 20:04:54] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:04:54] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:04:54] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:04:54] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:04:54] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:04:55] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/137 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9625 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 18/18 constraints]
After SMT, in 19633ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 19653ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20066 ms. Remains : 113/114 places, 180/180 transitions.
Support contains 77 out of 113 places after structural reductions.
[2024-05-20 20:05:03] [INFO ] Flatten gal took : 41 ms
[2024-05-20 20:05:03] [INFO ] Flatten gal took : 29 ms
[2024-05-20 20:05:03] [INFO ] Input system was already deterministic with 180 transitions.
RANDOM walk for 40000 steps (405 resets) in 2148 ms. (18 steps per ms) remains 12/70 properties
BEST_FIRST walk for 40004 steps (92 resets) in 145 ms. (274 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (113 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (103 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (104 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (98 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (76 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (109 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (90 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (95 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (103 resets) in 72 ms. (547 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (89 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (86 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
[2024-05-20 20:05:05] [INFO ] Invariant cache hit.
[2024-05-20 20:05:05] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 79/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 20:05:05] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-20 20:05:05] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 8 ms to minimize.
[2024-05-20 20:05:05] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:05:05] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 20:05:05] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:05:05] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/113 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 20:05:05] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:05:05] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 180/293 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 45/173 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-20 20:05:06] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 1/174 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/293 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 174 constraints, problems are : Problem set: 1 solved, 11 unsolved in 1730 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 80/112 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 9/15 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-20 20:05:06] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-20 20:05:07] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-20 20:05:07] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/113 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 180/293 variables, 113/132 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp43 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 45/177 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 7/184 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/184 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/293 variables, 0/184 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 184 constraints, problems are : Problem set: 5 solved, 7 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 7/12 constraints, Known Traps: 12/12 constraints]
After SMT, in 2380ms problems are : Problem set: 5 solved, 7 unsolved
Parikh walk visited 0 properties in 592 ms.
Support contains 23 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 113 transition count 158
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 46 place count 91 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 89 transition count 156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 48 place count 89 transition count 154
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 87 transition count 154
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 66 place count 80 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 80 transition count 143
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 80 transition count 139
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 78 place count 76 transition count 139
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 104 place count 76 transition count 139
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 109 place count 76 transition count 139
Applied a total of 109 rules in 68 ms. Remains 76 /113 variables (removed 37) and now considering 139/180 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 76/113 places, 139/180 transitions.
RANDOM walk for 40000 steps (1003 resets) in 314 ms. (126 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (195 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (271 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (180 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (193 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (208 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (191 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (251 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
Probably explored full state space saw : 28253 states, properties seen :0
Probabilistic random walk after 156842 steps, saw 28253 distinct states, run finished after 496 ms. (steps per millisecond=316 ) properties seen :0
Explored full state space saw : 28253 states, properties seen :0
Exhaustive walk after 156842 steps, saw 28253 distinct states, run finished after 451 ms. (steps per millisecond=347 ) properties seen :0
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-20 20:05:09] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-20 20:05:09] [INFO ] Flatten gal took : 10 ms
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-20 20:05:09] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:05:09] [INFO ] Input system was already deterministic with 180 transitions.
Computed a total of 22 stabilizing places and 35 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-20 20:05:09] [INFO ] Invariant cache hit.
[2024-05-20 20:05:09] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-20 20:05:09] [INFO ] Invariant cache hit.
[2024-05-20 20:05:09] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 20:05:09] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-20 20:05:09] [INFO ] Invariant cache hit.
[2024-05-20 20:05:09] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:05:10] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:05:10] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:05:10] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:05:10] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:05:10] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 5 ms to minimize.
[2024-05-20 20:05:10] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:05:11] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:05:11] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 3 ms to minimize.
[2024-05-20 20:05:11] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 180/292 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:05:13] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/293 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 175 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9521 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:05:19] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:05:19] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:05:19] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:05:20] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:05:20] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:05:20] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:05:20] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:05:20] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/137 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9153 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 18/18 constraints]
After SMT, in 18701ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 18703ms
Finished structural reductions in LTL mode , in 1 iterations and 18931 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-20 20:05:28] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:05:28] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:05:28] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-20 20:05:28] [INFO ] Flatten gal took : 7 ms
[2024-05-20 20:05:28] [INFO ] Flatten gal took : 8 ms
[2024-05-20 20:05:28] [INFO ] Time to serialize gal into /tmp/CTLFireability782258096930417581.gal : 4 ms
[2024-05-20 20:05:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6868690925934234099.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability782258096930417581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6868690925934234099.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.395654,17832,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: (AG(!(A((Node3ResZone>=1) U AX(FALSE)))) * EG((EF((EF((Node2GiveAnswer3<1)) + (Node3GiveAnswer2>=1))) + (Node0GiveAnswer1<1))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!((Node3ResZone>=1)) * !(!(EX(!(FAL...295
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
Using saturation style SCC detection
(forward)formula 0,0,8.05924,256720,1,0,446,1.46406e+06,394,227,3921,1.10631e+06,465
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 80 transition count 146
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 68 place count 79 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 75 transition count 142
Applied a total of 76 rules in 23 ms. Remains 75 /113 variables (removed 38) and now considering 142/180 (removed 38) transitions.
// Phase 1: matrix 142 rows 75 cols
[2024-05-20 20:05:36] [INFO ] Computed 7 invariants in 3 ms
[2024-05-20 20:05:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-20 20:05:36] [INFO ] Invariant cache hit.
[2024-05-20 20:05:36] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 20:05:36] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-20 20:05:36] [INFO ] Redundant transitions in 4 ms returned []
Running 137 sub problems to find dead transitions.
[2024-05-20 20:05:36] [INFO ] Invariant cache hit.
[2024-05-20 20:05:36] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 2 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-05-20 20:05:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 142/216 variables, 74/99 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 1/217 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 149 constraints, problems are : Problem set: 0 solved, 137 unsolved in 4758 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-20 20:05:41] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-20 20:05:41] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-20 20:05:42] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:05:42] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:05:42] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 142/216 variables, 74/104 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 49/153 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 137/290 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 1/217 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 0/217 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 291 constraints, problems are : Problem set: 0 solved, 137 unsolved in 4883 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 23/23 constraints]
After SMT, in 9666ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 9668ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/113 places, 142/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9867 ms. Remains : 75/113 places, 142/180 transitions.
[2024-05-20 20:05:46] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:05:46] [INFO ] Flatten gal took : 5 ms
[2024-05-20 20:05:46] [INFO ] Input system was already deterministic with 142 transitions.
[2024-05-20 20:05:46] [INFO ] Flatten gal took : 5 ms
[2024-05-20 20:05:46] [INFO ] Flatten gal took : 5 ms
[2024-05-20 20:05:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3651693251183840641.gal : 3 ms
[2024-05-20 20:05:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11716308865049774040.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/CTLFireability3651693251183840641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11716308865049774040.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,37052,0.236678,14000,2,4625,5,37299,6,0,426,37345,0


Converting to forward existential form...Done !
original formula: !(E(AG((EF((Node3GiveAnswer0>=1)) + AF((Node3GiveAnswer2>=1)))) U ((Node2IsInserted>=1)&&(Node3Request>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !((E(TRUE U (Node3GiveAnswer0>=1)) + !(EG(!((Node3GiveAnswer2>=1))))))))) * ((Node2IsInse...193
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t7, t8, t9, t11, t12, t14, t16, t17, t18, t20, t22, t23, t24, t26, t2...654
(forward)formula 0,1,7.09157,247516,1,0,511,1.5166e+06,318,235,2797,1.39517e+06,497
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2024-05-20 20:05:53] [INFO ] Computed 7 invariants in 6 ms
[2024-05-20 20:05:53] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-20 20:05:53] [INFO ] Invariant cache hit.
[2024-05-20 20:05:53] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 20:05:53] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-20 20:05:53] [INFO ] Invariant cache hit.
[2024-05-20 20:05:53] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:05:54] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:05:54] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:05:54] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:05:54] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:05:54] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:05:55] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:05:55] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:05:55] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:05:55] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 180/292 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:05:57] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/293 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 175 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9245 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:06:03] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:06:03] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:06:03] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:06:03] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:06:03] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:06:04] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-05-20 20:06:04] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:06:04] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/137 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9488 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 18/18 constraints]
After SMT, in 18768ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 18771ms
Finished structural reductions in LTL mode , in 1 iterations and 18918 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-20 20:06:12] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:06:12] [INFO ] Flatten gal took : 6 ms
[2024-05-20 20:06:12] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-20 20:06:12] [INFO ] Flatten gal took : 18 ms
[2024-05-20 20:06:12] [INFO ] Flatten gal took : 6 ms
[2024-05-20 20:06:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10632372194121580067.gal : 1 ms
[2024-05-20 20:06:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2392332568136006865.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/CTLFireability10632372194121580067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2392332568136006865.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,200157,0.350548,17904,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: (EG(EX(AG((AF(((TankCounter>=1)&&(Node3requestsent4>=1))) * E((Node2GiveAnswer1>=1) U (Node4GiveAnswer3>=1)))))) + ((EF(AG((Node4ResZone>...495
=> equivalent forward existential formula: (([((Init * !(EG(EX(!(E(TRUE U !((!(EG(!(((TankCounter>=1)&&(Node3requestsent4>=1))))) * E((Node2GiveAnswer1>=1)...1039
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
Using saturation style SCC detection
(forward)formula 0,0,23.1067,715664,1,0,1307,4.64713e+06,431,657,3928,4.23481e+06,1386
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 80 place count 73 transition count 140
Applied a total of 80 rules in 9 ms. Remains 73 /113 variables (removed 40) and now considering 140/180 (removed 40) transitions.
// Phase 1: matrix 140 rows 73 cols
[2024-05-20 20:06:36] [INFO ] Computed 7 invariants in 5 ms
[2024-05-20 20:06:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-20 20:06:36] [INFO ] Invariant cache hit.
[2024-05-20 20:06:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-20 20:06:36] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-20 20:06:36] [INFO ] Redundant transitions in 3 ms returned []
Running 135 sub problems to find dead transitions.
[2024-05-20 20:06:36] [INFO ] Invariant cache hit.
[2024-05-20 20:06:36] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 3 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:06:36] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-20 20:06:37] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-20 20:06:37] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:06:37] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:06:37] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-20 20:06:37] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 140/212 variables, 72/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 50/154 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 1/213 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 155 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4749 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 140/212 variables, 72/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 50/154 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 135/289 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 1/213 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 290 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4077 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 25/25 constraints]
After SMT, in 8846ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 8848ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/113 places, 140/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8984 ms. Remains : 73/113 places, 140/180 transitions.
[2024-05-20 20:06:45] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:06:45] [INFO ] Flatten gal took : 6 ms
[2024-05-20 20:06:45] [INFO ] Input system was already deterministic with 140 transitions.
[2024-05-20 20:06:45] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:06:45] [INFO ] Flatten gal took : 5 ms
[2024-05-20 20:06:45] [INFO ] Time to serialize gal into /tmp/CTLFireability6549599148306639385.gal : 1 ms
[2024-05-20 20:06:45] [INFO ] Time to serialize properties into /tmp/CTLFireability404664968532699.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/CTLFireability6549599148306639385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability404664968532699.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 -...279
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,34352,0.244443,14524,2,4325,5,37975,6,0,416,40137,0


Converting to forward existential form...Done !
original formula: EF(EG((Node4requestsent0>=1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(Node4requestsent0>=1))] != FALSE
Hit Full ! (commute/partial/dont) 137/0/3
(forward)formula 0,1,0.953445,37176,1,0,11,178198,19,2,2057,111467,10
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2024-05-20 20:06:46] [INFO ] Computed 7 invariants in 5 ms
[2024-05-20 20:06:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-20 20:06:46] [INFO ] Invariant cache hit.
[2024-05-20 20:06:46] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 20:06:46] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-20 20:06:46] [INFO ] Invariant cache hit.
[2024-05-20 20:06:46] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:06:46] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:06:46] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:06:46] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:06:47] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:06:47] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:06:47] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:06:47] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:06:47] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:06:47] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 180/292 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:06:50] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/293 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 175 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9653 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:06:56] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:06:56] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:06:56] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:06:56] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:06:56] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:06:56] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:06:56] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:06:56] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/137 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9468 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 18/18 constraints]
After SMT, in 19142ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 19146ms
Finished structural reductions in LTL mode , in 1 iterations and 19317 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-20 20:07:05] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:07:05] [INFO ] Flatten gal took : 5 ms
[2024-05-20 20:07:05] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-20 20:07:05] [INFO ] Flatten gal took : 5 ms
[2024-05-20 20:07:05] [INFO ] Flatten gal took : 5 ms
[2024-05-20 20:07:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2176249948061122643.gal : 2 ms
[2024-05-20 20:07:05] [INFO ] Time to serialize properties into /tmp/CTLFireability1589087340049616627.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/CTLFireability2176249948061122643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1589087340049616627.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,200157,0.338292,17904,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: AX((EF(((Node1requestsent0<1)&&((Node4GiveAnswer1>=1)||((Node0IsInserted>=1)&&(Node4requestsent0>=1))))) * (AF(((Node0IsInserted<1)||(Nod...218
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U ((Node1requestsent0<1)&&((Node4GiveAnswer1>=1)||((Node0IsInserted>=1)&&(Node4requestsen...304
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,1,3.8384,137056,1,0,414,709649,392,194,3768,638366,413
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 113 transition count 159
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 92 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 90 transition count 157
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 46 place count 90 transition count 153
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 54 place count 86 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 85 transition count 152
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 64 place count 85 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 67 place count 82 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 82 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 73 place count 82 transition count 146
Applied a total of 73 rules in 27 ms. Remains 82 /113 variables (removed 31) and now considering 146/180 (removed 34) transitions.
// Phase 1: matrix 146 rows 82 cols
[2024-05-20 20:07:09] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 20:07:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-20 20:07:09] [INFO ] Invariant cache hit.
[2024-05-20 20:07:09] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-20 20:07:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-20 20:07:09] [INFO ] Redundant transitions in 8 ms returned []
Running 141 sub problems to find dead transitions.
[2024-05-20 20:07:09] [INFO ] Invariant cache hit.
[2024-05-20 20:07:09] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-20 20:07:09] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-20 20:07:10] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:07:11] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:07:11] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-20 20:07:11] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:07:11] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-20 20:07:11] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 146/227 variables, 81/106 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 51/157 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 158 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6298 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 146/227 variables, 81/106 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 51/157 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 141/298 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 1/228 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 299 constraints, problems are : Problem set: 0 solved, 141 unsolved in 4838 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 18/18 constraints]
After SMT, in 11153ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 11154ms
Starting structural reductions in SI_CTL mode, iteration 1 : 82/113 places, 146/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11325 ms. Remains : 82/113 places, 146/180 transitions.
[2024-05-20 20:07:20] [INFO ] Flatten gal took : 7 ms
[2024-05-20 20:07:20] [INFO ] Flatten gal took : 6 ms
[2024-05-20 20:07:20] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-20 20:07:20] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:07:20] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:07:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14597194292718106328.gal : 1 ms
[2024-05-20 20:07:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7950961267994370166.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/CTLFireability14597194292718106328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7950961267994370166.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,58162,0.358283,18272,2,5644,5,53836,6,0,458,52707,0


Converting to forward existential form...Done !
original formula: AG((EF((Node4Bootstrap>=1)) * ((AF((((Node2Request<1)||(Node4IsInserted<1))||((Node0WaitAnswer<1)||(Node0OKshare<1)))) + (((EF((Node2Boot...426
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (Node4Bootstrap>=1))))] = FALSE * ((([(((FwdU(Init,TRUE) * !(((Node2GiveAnswer1<...1226
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t6, t8, t9, t12, t15, t16, t18, t21, t22, t25, t27, t28, t29, t31, t33, t...620
(forward)formula 0,0,2.18228,82344,1,0,384,377662,335,168,2997,368403,356
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2024-05-20 20:07:22] [INFO ] Computed 7 invariants in 3 ms
[2024-05-20 20:07:22] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-20 20:07:22] [INFO ] Invariant cache hit.
[2024-05-20 20:07:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 20:07:22] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-20 20:07:22] [INFO ] Invariant cache hit.
[2024-05-20 20:07:22] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:07:23] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:07:23] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:07:23] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:07:23] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:07:24] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:07:24] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:07:24] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:07:24] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:07:24] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 180/292 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:07:26] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/293 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 175 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9291 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:07:32] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:07:32] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:07:32] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:07:33] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:07:33] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:07:33] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:07:33] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:07:33] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/137 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9349 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 18/18 constraints]
After SMT, in 18660ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 18661ms
Finished structural reductions in LTL mode , in 1 iterations and 18813 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-20 20:07:41] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:07:41] [INFO ] Flatten gal took : 7 ms
[2024-05-20 20:07:41] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-20 20:07:41] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:07:41] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:07:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4349562875763489505.gal : 1 ms
[2024-05-20 20:07:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13673618082205618991.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/CTLFireability4349562875763489505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13673618082205618991.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,200157,0.346806,18164,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: EX(A(EF(!(EF(((Node1Request>=1)&&(Node2IsInserted>=1))))) U (Node4requestsent1>=1)))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((Node4requestsent1>=1))))) * !(E(!((Node4requestsent1>=1)) U (!(E(TRUE U !(E(TRUE U ((Node1...235
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,0,14.7892,499832,1,0,682,3.17809e+06,389,332,3810,2.84592e+06,706
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 80 transition count 146
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 68 place count 79 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 75 transition count 142
Applied a total of 76 rules in 18 ms. Remains 75 /113 variables (removed 38) and now considering 142/180 (removed 38) transitions.
// Phase 1: matrix 142 rows 75 cols
[2024-05-20 20:07:56] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 20:07:56] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-20 20:07:56] [INFO ] Invariant cache hit.
[2024-05-20 20:07:56] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 20:07:56] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-20 20:07:56] [INFO ] Redundant transitions in 2 ms returned []
Running 137 sub problems to find dead transitions.
[2024-05-20 20:07:56] [INFO ] Invariant cache hit.
[2024-05-20 20:07:56] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-20 20:07:57] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-20 20:07:57] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-20 20:07:57] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-20 20:07:57] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:07:57] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-20 20:07:57] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:07:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:07:58] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-20 20:07:59] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 142/216 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 49/150 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 1/217 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 14 (OVERLAPS) 0/217 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 151 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6007 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 142/216 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 49/150 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 137/287 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 1/217 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 0/217 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 288 constraints, problems are : Problem set: 0 solved, 137 unsolved in 4593 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 20/20 constraints]
After SMT, in 10617ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 10618ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/113 places, 142/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10767 ms. Remains : 75/113 places, 142/180 transitions.
[2024-05-20 20:08:07] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:08:07] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:08:07] [INFO ] Input system was already deterministic with 142 transitions.
[2024-05-20 20:08:07] [INFO ] Flatten gal took : 3 ms
[2024-05-20 20:08:07] [INFO ] Flatten gal took : 3 ms
[2024-05-20 20:08:07] [INFO ] Time to serialize gal into /tmp/CTLFireability7499109834264160481.gal : 1 ms
[2024-05-20 20:08:07] [INFO ] Time to serialize properties into /tmp/CTLFireability4751293649250291451.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/CTLFireability7499109834264160481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4751293649250291451.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,37378,0.230967,14276,2,4819,5,39011,6,0,426,38671,0


Converting to forward existential form...Done !
original formula: AG(AF(((Node1Request<1)||(Node3IsInserted<1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((Node1Request<1)||(Node3IsInserted<1))))] = FALSE
Hit Full ! (commute/partial/dont) 128/13/14
(forward)formula 0,0,1.02136,42352,1,0,12,200022,20,2,2124,122671,11
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2024-05-20 20:08:08] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 20:08:08] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-20 20:08:08] [INFO ] Invariant cache hit.
[2024-05-20 20:08:08] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 20:08:08] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-20 20:08:08] [INFO ] Invariant cache hit.
[2024-05-20 20:08:08] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:08:09] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:08:09] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:08:09] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:08:09] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:08:09] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:08:09] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:08:09] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:08:09] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:08:10] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 180/292 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:08:12] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/293 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 175 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9455 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:08:18] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:08:18] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:08:18] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:08:18] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:08:18] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:08:18] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:08:18] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:08:18] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/137 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9078 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 18/18 constraints]
After SMT, in 18559ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 18561ms
Finished structural reductions in LTL mode , in 1 iterations and 18700 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-20 20:08:27] [INFO ] Flatten gal took : 12 ms
[2024-05-20 20:08:27] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:08:27] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-20 20:08:27] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:08:27] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:08:27] [INFO ] Time to serialize gal into /tmp/CTLFireability6100950501449739700.gal : 1 ms
[2024-05-20 20:08:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13073068232366497378.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/CTLFireability6100950501449739700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13073068232366497378.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,200157,0.343147,17900,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: (AG(E(EX(!(EG((Node0GiveAnswer4>=1)))) U !(E(!(((Node3WaitAnswer>=1)&&(Node3OKshare>=1))) U E((Node1GiveAnswer2>=1) U !(((TankCounter<1)|...224
=> equivalent forward existential formula: [FwdG(EY((Init * !(!(E(TRUE U !(E(EX(!(EG((Node0GiveAnswer4>=1)))) U !(E(!(((Node3WaitAnswer>=1)&&(Node3OKshare>...296
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,1,4.93638,165868,1,0,704,931623,405,357,3706,858452,715
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 80 place count 73 transition count 140
Applied a total of 80 rules in 7 ms. Remains 73 /113 variables (removed 40) and now considering 140/180 (removed 40) transitions.
// Phase 1: matrix 140 rows 73 cols
[2024-05-20 20:08:32] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 20:08:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-20 20:08:32] [INFO ] Invariant cache hit.
[2024-05-20 20:08:32] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-20 20:08:32] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-20 20:08:32] [INFO ] Redundant transitions in 1 ms returned []
Running 135 sub problems to find dead transitions.
[2024-05-20 20:08:32] [INFO ] Invariant cache hit.
[2024-05-20 20:08:32] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-20 20:08:32] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-05-20 20:08:33] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:08:33] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-20 20:08:33] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:08:33] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-20 20:08:33] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:08:33] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:08:33] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 140/212 variables, 72/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 50/154 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 1/213 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 155 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4628 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 140/212 variables, 72/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 50/154 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 135/289 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 1/213 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 290 constraints, problems are : Problem set: 0 solved, 135 unsolved in 4290 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 25/25 constraints]
After SMT, in 8935ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 8936ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/113 places, 140/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9077 ms. Remains : 73/113 places, 140/180 transitions.
[2024-05-20 20:08:41] [INFO ] Flatten gal took : 8 ms
[2024-05-20 20:08:41] [INFO ] Flatten gal took : 5 ms
[2024-05-20 20:08:41] [INFO ] Input system was already deterministic with 140 transitions.
[2024-05-20 20:08:41] [INFO ] Flatten gal took : 3 ms
[2024-05-20 20:08:41] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:08:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15952188065591431096.gal : 1 ms
[2024-05-20 20:08:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12607856170072830634.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/CTLFireability15952188065591431096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12607856170072830634.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,34352,0.236517,14520,2,4325,5,37975,6,0,416,40137,0


Converting to forward existential form...Done !
original formula: EF(AG((Node3requestsent2<1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((Node3requestsent2<1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t14, t15, t17, t19, t20, t21, t23, t25, t26...651
(forward)formula 0,1,1.77513,69680,1,0,359,355674,302,152,2647,331704,308
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 113 transition count 159
Reduce places removed 21 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 26 rules applied. Total rules applied 47 place count 92 transition count 154
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 87 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 87 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 86 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 84 transition count 151
Applied a total of 58 rules in 9 ms. Remains 84 /113 variables (removed 29) and now considering 151/180 (removed 29) transitions.
// Phase 1: matrix 151 rows 84 cols
[2024-05-20 20:08:43] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 20:08:43] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-20 20:08:43] [INFO ] Invariant cache hit.
[2024-05-20 20:08:43] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-20 20:08:43] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-20 20:08:43] [INFO ] Redundant transitions in 1 ms returned []
Running 146 sub problems to find dead transitions.
[2024-05-20 20:08:43] [INFO ] Invariant cache hit.
[2024-05-20 20:08:43] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-20 20:08:43] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:08:43] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:08:43] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:08:43] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:08:43] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:08:43] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:08:43] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:08:44] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-20 20:08:44] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-20 20:08:44] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-20 20:08:44] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:08:44] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:08:44] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-20 20:08:45] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-20 20:08:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:08:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:08:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-20 20:08:46] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:08:46] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:08:46] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 151/234 variables, 83/110 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 47/157 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 1/235 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 15 (OVERLAPS) 0/235 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 158 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7655 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 151/234 variables, 83/110 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 47/157 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 146/303 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 1/235 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/235 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 304 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5119 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 20/20 constraints]
After SMT, in 12794ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 12796ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/113 places, 151/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12981 ms. Remains : 84/113 places, 151/180 transitions.
[2024-05-20 20:08:56] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:08:56] [INFO ] Flatten gal took : 3 ms
[2024-05-20 20:08:56] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-20 20:08:56] [INFO ] Flatten gal took : 3 ms
[2024-05-20 20:08:56] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:08:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14956723477228570481.gal : 1 ms
[2024-05-20 20:08:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11023292441974032390.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/CTLFireability14956723477228570481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11023292441974032390.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,50975,0.290184,16696,2,5670,5,47614,6,0,471,48855,0


Converting to forward existential form...Done !
original formula: !(A(AF((EG((Node2GiveAnswer0<1)) + (Node0DHTinfo<1))) U ((!((E((Node1requestsent2>=1) U ((Node1Request>=1)&&(Node2IsInserted>=1))) * AG((...361
=> equivalent forward existential formula: (([((((FwdU(Init,!(((!((E((Node1requestsent2>=1) U ((Node1Request>=1)&&(Node2IsInserted>=1))) * !(E(TRUE U !((No...1774
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t8, t11, t12, t13, t14, t15, t19, t20, t22, t24, t25, t26, t28, t30, t31,...660
(forward)formula 0,1,11.1947,376480,1,0,564,2.30724e+06,344,269,3174,2.08677e+06,579
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2024-05-20 20:09:07] [INFO ] Computed 7 invariants in 0 ms
[2024-05-20 20:09:07] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-20 20:09:07] [INFO ] Invariant cache hit.
[2024-05-20 20:09:07] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 20:09:07] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-20 20:09:07] [INFO ] Invariant cache hit.
[2024-05-20 20:09:07] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:09:08] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:09:08] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:09:08] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:09:08] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:09:08] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 3 ms to minimize.
[2024-05-20 20:09:08] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:09:08] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:09:08] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:09:09] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 180/292 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:09:11] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/293 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 175 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9397 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:09:17] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:09:17] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:09:17] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:09:17] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:09:17] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:09:17] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:09:17] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:09:17] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/137 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8924 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 18/18 constraints]
After SMT, in 18342ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 18344ms
Finished structural reductions in LTL mode , in 1 iterations and 18523 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-20 20:09:25] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:09:25] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:09:25] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-20 20:09:25] [INFO ] Flatten gal took : 7 ms
[2024-05-20 20:09:25] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:09:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17934726607847965407.gal : 1 ms
[2024-05-20 20:09:25] [INFO ] Time to serialize properties into /tmp/CTLFireability3022717550230629509.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/CTLFireability17934726607847965407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3022717550230629509.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,200157,0.363796,17900,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: !(E(!((((Node2JoinMsg>=1)||((Node1ID2>=1)&&(Node3GiveAnswer4>=1)))||((TankCounter>=1)&&(Node2requestsent4>=1)))) U AX(EF((Node1DHTinfo>=1...160
=> equivalent forward existential formula: [(FwdU(Init,!((((Node2JoinMsg>=1)||((Node1ID2>=1)&&(Node3GiveAnswer4>=1)))||((TankCounter>=1)&&(Node2requestsent...214
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
Hit Full ! (commute/partial/dont) 161/26/19
(forward)formula 0,0,3.23343,109944,1,0,394,468888,389,182,3936,512810,376
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-20 20:09:29] [INFO ] Invariant cache hit.
[2024-05-20 20:09:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-20 20:09:29] [INFO ] Invariant cache hit.
[2024-05-20 20:09:29] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-20 20:09:29] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-20 20:09:29] [INFO ] Invariant cache hit.
[2024-05-20 20:09:29] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:09:29] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:09:29] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:09:29] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:09:30] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:09:30] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:09:30] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:09:30] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:09:30] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:09:30] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 180/292 variables, 112/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:09:33] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/293 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 175 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9462 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:09:39] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:09:39] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:09:39] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-20 20:09:39] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:09:39] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:09:39] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:09:39] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:09:39] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/137 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9320 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 18/18 constraints]
After SMT, in 18802ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 18804ms
Finished structural reductions in LTL mode , in 1 iterations and 18941 ms. Remains : 113/113 places, 180/180 transitions.
[2024-05-20 20:09:48] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:09:48] [INFO ] Flatten gal took : 6 ms
[2024-05-20 20:09:48] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-20 20:09:48] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:09:48] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:09:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9096343306010383655.gal : 1 ms
[2024-05-20 20:09:48] [INFO ] Time to serialize properties into /tmp/CTLFireability11309128849054190753.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/CTLFireability9096343306010383655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11309128849054190753.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,200157,0.374691,17900,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: (AX(E(A((Node2requestsent1>=1) U EG(((Node0IsInserted>=1)&&(Node4Request>=1)))) U EF(AG(((Node1IsInserted>=1)&&(Node3requestsent1>=1)))))...359
=> equivalent forward existential formula: ([(EY(Init) * !(E(!((E(!(EG(((Node0IsInserted>=1)&&(Node4Request>=1)))) U (!((Node2requestsent1>=1)) * !(EG(((No...682
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-20 20:10:18] [INFO ] Flatten gal took : 8 ms
[2024-05-20 20:10:18] [INFO ] Applying decomposition
[2024-05-20 20:10:18] [INFO ] Flatten gal took : 3 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/graph4014605152688229609.txt' '-o' '/tmp/graph4014605152688229609.bin' '-w' '/tmp/graph4014605152688229609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4014605152688229609.bin' '-l' '-1' '-v' '-w' '/tmp/graph4014605152688229609.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:10:18] [INFO ] Decomposing Gal with order
[2024-05-20 20:10:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:10:18] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-20 20:10:18] [INFO ] Flatten gal took : 66 ms
[2024-05-20 20:10:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 17 ms.
[2024-05-20 20:10:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15414668002157434146.gal : 3 ms
[2024-05-20 20:10:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10901970969879293008.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/CTLFireability15414668002157434146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10901970969879293008.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,200157,0.376641,18924,1344,532,24485,5195,368,40056,158,42367,0


Converting to forward existential form...Done !
original formula: (AX(E(A((u10.Node2requestsent1>=1) U EG(((i0.u0.Node0IsInserted>=1)&&(u18.Node4Request>=1)))) U EF(AG(((u18.Node1IsInserted>=1)&&(u14.Nod...425
=> equivalent forward existential formula: ([(EY(Init) * !(E(!((E(!(EG(((i0.u0.Node0IsInserted>=1)&&(u18.Node4Request>=1)))) U (!((u10.Node2requestsent1>=1...788
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t57, t63, t69, t75, t79, t81, t87, t...906
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,14.8376,584988,1,0,1.08141e+06,47963,1904,1.41767e+06,847,481270,1270391
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-20 20:10:33] [INFO ] Flatten gal took : 4 ms
[2024-05-20 20:10:33] [INFO ] Flatten gal took : 6 ms
Total runtime 350049 ms.

BK_STOP 1716235833365

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -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="CANInsertWithFailure-PT-005"
export BK_EXAMINATION="CTLFireability"
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 CANInsertWithFailure-PT-005, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505100090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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