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.r356-tall-171683761700722.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 ShieldRVs-PT-002A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761700722
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 17:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:43 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 ShieldRVs-PT-002A-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717032463216

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-002A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:27:44] [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-30 01:27:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:27:44] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-05-30 01:27:44] [INFO ] Transformed 31 places.
[2024-05-30 01:27:44] [INFO ] Transformed 41 transitions.
[2024-05-30 01:27:44] [INFO ] Found NUPN structural information;
[2024-05-30 01:27:44] [INFO ] Parsed PT model containing 31 places and 41 transitions and 184 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-002A-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 9 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 31 cols
[2024-05-30 01:27:44] [INFO ] Computed 9 invariants in 8 ms
[2024-05-30 01:27:44] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-30 01:27:44] [INFO ] Invariant cache hit.
[2024-05-30 01:27:44] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:27:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:45] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 6 ms to minimize.
[2024-05-30 01:27:45] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:27:45] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
[2024-05-30 01:27:45] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:27:45] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:27:45] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:27:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:27:45] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:45] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 995 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:46] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:27:46] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:46] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 901 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1949ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1963ms
Finished structural reductions in LTL mode , in 1 iterations and 2242 ms. Remains : 31/31 places, 41/41 transitions.
Support contains 31 out of 31 places after structural reductions.
[2024-05-30 01:27:47] [INFO ] Flatten gal took : 21 ms
[2024-05-30 01:27:47] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:27:47] [INFO ] Input system was already deterministic with 41 transitions.
Reduction of identical properties reduced properties to check from 57 to 47
RANDOM walk for 40000 steps (1037 resets) in 916 ms. (43 steps per ms) remains 2/47 properties
BEST_FIRST walk for 40004 steps (472 resets) in 273 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (457 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
[2024-05-30 01:27:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp42 is UNSAT
After SMT solving in domain Real declared 19/72 variables, and 12 constraints, problems are : Problem set: 2 solved, 0 unsolved in 28 ms.
Refiners :[Domain max(s): 7/31 constraints, Positive P Invariants (semi-flows): 5/9 constraints, State Equation: 0/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 33ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-05-30 01:27:47] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:27:47] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:27:47] [INFO ] Input system was already deterministic with 41 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-30 01:27:47] [INFO ] Invariant cache hit.
[2024-05-30 01:27:47] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 01:27:47] [INFO ] Invariant cache hit.
[2024-05-30 01:27:47] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-30 01:27:47] [INFO ] Redundant transitions in 18 ms returned [15]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 39 sub problems to find dead transitions.
// Phase 1: matrix 40 rows 31 cols
[2024-05-30 01:27:47] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:27:47] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:27:47] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:27:47] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:27:47] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:27:48] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:27:48] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:27:48] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:27:48] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 40/71 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 79 constraints, problems are : Problem set: 0 solved, 39 unsolved in 679 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 40/71 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:27:48] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:27:48] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:27:48] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/71 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 121 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1047 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 11/11 constraints]
After SMT, in 1739ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1740ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/31 places, 40/41 transitions.
Applied a total of 0 rules in 9 ms. Remains 31 /31 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1867 ms. Remains : 31/31 places, 40/41 transitions.
[2024-05-30 01:27:49] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:27:49] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:49] [INFO ] Input system was already deterministic with 40 transitions.
[2024-05-30 01:27:49] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:27:49] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7601819789493124747.gal : 2 ms
[2024-05-30 01:27:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16623111477607867177.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/CTLFireability7601819789493124747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16623111477607867177.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,16021,0.035279,4476,2,424,5,3959,6,0,166,6424,0


Converting to forward existential form...Done !
original formula: AF((AF(E(((p18!=1) + E(((p26==1)&&(p30==1)) U (p25==1))) U (AG((((p3==1)&&(p18==1))&&(p30==1))) + EG((p11==1))))) * (EF((AF((p19==1)) * E...227
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(E(((p18!=1) + E(((p26==1)&&(p30==1)) U (p25==1))) U (!(E(TRUE U !((((p3==1)&&(p18==1))&&(p3...302
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t16, t18, t20, t21, t22, t23, t26...295
(forward)formula 0,0,0.55026,25476,1,0,429,107320,129,181,1389,162156,474
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 31 cols
[2024-05-30 01:27:50] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:27:50] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:27:50] [INFO ] Invariant cache hit.
[2024-05-30 01:27:50] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:27:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:50] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:27:50] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:27:50] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:27:50] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:27:50] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:27:50] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:27:50] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:27:50] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:50] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 776 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:51] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:27:51] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:51] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 879 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1679ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1680ms
Finished structural reductions in LTL mode , in 1 iterations and 1772 ms. Remains : 31/31 places, 41/41 transitions.
[2024-05-30 01:27:51] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:27:51] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:51] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:27:51] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:51] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:51] [INFO ] Time to serialize gal into /tmp/CTLFireability7868803359753778164.gal : 1 ms
[2024-05-30 01:27:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2401519670497911790.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/CTLFireability7868803359753778164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2401519670497911790.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,16021,0.025292,4556,2,424,5,3971,6,0,167,6428,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.025707,4556,1,0,6,3971,7,1,236,6428,1
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-30 01:27:51] [INFO ] Invariant cache hit.
[2024-05-30 01:27:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 01:27:51] [INFO ] Invariant cache hit.
[2024-05-30 01:27:52] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:27:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:27:52] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:27:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:27:52] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:27:52] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
[2024-05-30 01:27:52] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:27:52] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:27:52] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:52] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 707 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:52] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:27:53] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:53] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 879 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1597ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1599ms
Finished structural reductions in LTL mode , in 1 iterations and 1673 ms. Remains : 31/31 places, 41/41 transitions.
[2024-05-30 01:27:53] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:27:53] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:27:53] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:27:53] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:53] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17623434810089701491.gal : 1 ms
[2024-05-30 01:27:53] [INFO ] Time to serialize properties into /tmp/CTLFireability681968916266813887.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/CTLFireability17623434810089701491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability681968916266813887.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,16021,0.025416,4560,2,424,5,3971,6,0,167,6428,0


Converting to forward existential form...Done !
original formula: AX(AG((EF((((p19==1)&&(p21==1))&&(p26==1))) + E(((p22==1)&&(p27==1)) U (((p19==1)&&(p21==1))&&(p26==1))))))
=> equivalent forward existential formula: [((FwdU(EY(Init),TRUE) * !(E(((p22==1)&&(p27==1)) U (((p19==1)&&(p21==1))&&(p26==1))))) * !(E(TRUE U (((p19==1)&...188
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t17, t19, t21, t22, t23, t24...300
(forward)formula 0,0,0.2189,13008,1,0,214,44952,108,94,1397,67873,198
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-30 01:27:53] [INFO ] Invariant cache hit.
[2024-05-30 01:27:53] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 01:27:53] [INFO ] Invariant cache hit.
[2024-05-30 01:27:53] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:27:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:54] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:27:54] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:27:54] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 2 ms to minimize.
[2024-05-30 01:27:54] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 2 ms to minimize.
[2024-05-30 01:27:54] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:27:54] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:27:54] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:27:54] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:54] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 767 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:54] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:27:55] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:55] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 876 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1654ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1656ms
Finished structural reductions in LTL mode , in 1 iterations and 1731 ms. Remains : 31/31 places, 41/41 transitions.
[2024-05-30 01:27:55] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:55] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:55] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:27:55] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:55] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:27:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12324968744174865322.gal : 0 ms
[2024-05-30 01:27:55] [INFO ] Time to serialize properties into /tmp/CTLFireability5112916050667684090.ctl : 4 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/CTLFireability12324968744174865322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5112916050667684090.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,16021,0.026641,4552,2,424,5,3971,6,0,167,6428,0


Converting to forward existential form...Done !
original formula: AG((((AG((((p3==0)||(p20==0))||(p30==0))) + EF((((p2==1)&&(p6==1))&&(p16==1)))) + (AX(((((p17==1)||(p20==0))||((p21==0)||(p25==0)))||(p5=...344
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * !(((!(E(TRUE U !((((p3==0)||(p20==0))||(p30==0))))) + E(TRUE U (((p2==1)&&(p6==1))&&(p...719
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t17, t19, t21, t22, t23, t24...300
(forward)formula 0,0,0.289985,16168,1,0,204,60045,112,94,1399,91506,194
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-30 01:27:55] [INFO ] Invariant cache hit.
[2024-05-30 01:27:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-30 01:27:55] [INFO ] Invariant cache hit.
[2024-05-30 01:27:56] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:27:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:56] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:27:56] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:27:56] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:27:56] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:27:56] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:27:56] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:27:56] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:27:56] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:56] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 765 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:57] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:27:57] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:57] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 875 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1651ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1651ms
Finished structural reductions in LTL mode , in 1 iterations and 1716 ms. Remains : 31/31 places, 41/41 transitions.
[2024-05-30 01:27:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:57] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:27:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14000147082872265885.gal : 1 ms
[2024-05-30 01:27:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9484030996213622636.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/CTLFireability14000147082872265885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9484030996213622636.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,16021,0.024924,4556,2,424,5,3971,6,0,167,6428,0


Converting to forward existential form...Done !
original formula: EF((A((((p2==1)&&(p6==1))&&(p16==1)) U AG(!(AX((((p6==1)&&(p7==1))&&(p11==1)))))) + ((AG((((p3==0)||(p18==0))||(p29==0))) * E(((!(((p2==1...463
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(!(!(EX(!((((p6==1)&&(p7==1))&&(p11==1))))))))))))) * !(E(!(!(E(TRUE U ...1048
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t17, t19, t21, t22, t23, t24...300
(forward)formula 0,1,0.770748,34396,1,0,373,152089,121,177,1389,240730,372
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-30 01:27:58] [INFO ] Invariant cache hit.
[2024-05-30 01:27:58] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:27:58] [INFO ] Invariant cache hit.
[2024-05-30 01:27:58] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:27:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:58] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:27:58] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:27:58] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:27:58] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:27:58] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:27:58] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:27:58] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:27:58] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:59] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 756 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:59] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:27:59] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:27:59] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 923 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1693ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1694ms
Finished structural reductions in LTL mode , in 1 iterations and 1766 ms. Remains : 31/31 places, 41/41 transitions.
[2024-05-30 01:28:00] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:28:00] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:28:00] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:28:00] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:28:00] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:28:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4326742634112883944.gal : 1 ms
[2024-05-30 01:28:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13877914514200403225.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/CTLFireability4326742634112883944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13877914514200403225.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,16021,0.02752,4556,2,424,5,3971,6,0,167,6428,0


Converting to forward existential form...Done !
original formula: EG(AX((p17==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((p17==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t17, t19, t21, t22, t23, t24...300
(forward)formula 0,1,0.107652,7988,1,0,203,24241,105,94,1362,28716,154
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 40
Applied a total of 2 rules in 20 ms. Remains 30 /31 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 30 cols
[2024-05-30 01:28:00] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:28:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-30 01:28:00] [INFO ] Invariant cache hit.
[2024-05-30 01:28:00] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-30 01:28:00] [INFO ] Redundant transitions in 17 ms returned [12]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 38 sub problems to find dead transitions.
// Phase 1: matrix 39 rows 30 cols
[2024-05-30 01:28:00] [INFO ] Computed 9 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:00] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:28:00] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:28:00] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:28:00] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:28:00] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:00] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:00] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:00] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/69 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/69 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 87 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1264 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:01] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 39/69 variables, 30/89 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 38/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:02] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/69 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/69 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 128 constraints, problems are : Problem set: 0 solved, 38 unsolved in 983 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 21/21 constraints]
After SMT, in 2262ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2263ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/31 places, 39/41 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2373 ms. Remains : 30/31 places, 39/41 transitions.
[2024-05-30 01:28:02] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:28:02] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:28:02] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-30 01:28:02] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:02] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7979999023949556547.gal : 1 ms
[2024-05-30 01:28:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17884759685049270525.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/CTLFireability7979999023949556547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17884759685049270525.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,11472,0.028078,4288,2,406,5,3739,6,0,161,6197,0


Converting to forward existential form...Done !
original formula: AG(AF((((p12==0)||(p16==0))||(p23==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((p12==0)||(p16==0))||(p23==0))))] = FALSE
Hit Full ! (commute/partial/dont) 23/27/16
(forward)formula 0,1,0.059488,5344,1,0,21,9162,20,2,1001,8453,21
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 39
Applied a total of 2 rules in 11 ms. Remains 29 /31 variables (removed 2) and now considering 39/41 (removed 2) transitions.
// Phase 1: matrix 39 rows 29 cols
[2024-05-30 01:28:02] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:28:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:28:02] [INFO ] Invariant cache hit.
[2024-05-30 01:28:02] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-30 01:28:02] [INFO ] Redundant transitions in 17 ms returned [11]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 37 sub problems to find dead transitions.
// Phase 1: matrix 38 rows 29 cols
[2024-05-30 01:28:02] [INFO ] Computed 9 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/67 variables, 29/74 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/67 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 01:28:03] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 0/67 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 85 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1392 ms.
Refiners :[Domain max(s): 29/29 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 01:28:04] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/67 variables, 29/86 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 01:28:04] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/67 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 124 constraints, problems are : Problem set: 0 solved, 37 unsolved in 586 ms.
Refiners :[Domain max(s): 29/29 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 20/20 constraints]
After SMT, in 1991ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1992ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/31 places, 38/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2101 ms. Remains : 29/31 places, 38/41 transitions.
[2024-05-30 01:28:04] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:04] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:04] [INFO ] Input system was already deterministic with 38 transitions.
[2024-05-30 01:28:04] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:28:04] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:04] [INFO ] Time to serialize gal into /tmp/CTLFireability877229221099984174.gal : 1 ms
[2024-05-30 01:28:04] [INFO ] Time to serialize properties into /tmp/CTLFireability11301742679991567156.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/CTLFireability877229221099984174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11301742679991567156.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,11471,0.023723,4268,2,379,5,3694,6,0,157,6181,0


Converting to forward existential form...Done !
original formula: AG(EF((p14==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p14==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t14, t16, t17, t18, t20, t21, t23, t24, t27...290
(forward)formula 0,0,0.153768,10340,1,0,143,34090,97,57,1232,48963,119
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 31 cols
[2024-05-30 01:28:05] [INFO ] Computed 9 invariants in 3 ms
[2024-05-30 01:28:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 01:28:05] [INFO ] Invariant cache hit.
[2024-05-30 01:28:05] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:05] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:28:05] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:28:05] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:28:05] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:28:05] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:28:05] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:05] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:28:05] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:05] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 722 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:06] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:28:06] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:06] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 873 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1606ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1608ms
Finished structural reductions in LTL mode , in 1 iterations and 1671 ms. Remains : 31/31 places, 41/41 transitions.
[2024-05-30 01:28:06] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:28:06] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:28:06] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:28:06] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:06] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:28:06] [INFO ] Time to serialize gal into /tmp/CTLFireability5351502100362911705.gal : 1 ms
[2024-05-30 01:28:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17919084591580318587.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/CTLFireability5351502100362911705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17919084591580318587.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,16021,0.025461,4560,2,424,5,3971,6,0,167,6428,0


Converting to forward existential form...Done !
original formula: EF((((EG((((p3==1)&&(p18==1))&&(p29==1))) * EG(((((p25==1)&&(p5==1))||(p3==0))||((p20==0)||(p30==0))))) * (E(AG(((p26==1)&&(p30==1))) U A...398
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * ((EG((((p3==1)&&(p18==1))&&(p29==1))) * EG(((((p25==1)&&(p5==1))||(p3==0))||((p20==0)|...1179
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t17, t19, t21, t22, t23, t24...300
(forward)formula 0,0,1.59513,56920,1,0,651,259578,141,284,1408,433288,708
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-30 01:28:08] [INFO ] Invariant cache hit.
[2024-05-30 01:28:08] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:28:08] [INFO ] Invariant cache hit.
[2024-05-30 01:28:08] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:08] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:08] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:28:08] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:08] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:08] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:28:08] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:28:08] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
[2024-05-30 01:28:08] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:09] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 770 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:09] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:28:09] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:09] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 905 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1686ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1687ms
Finished structural reductions in LTL mode , in 1 iterations and 1757 ms. Remains : 31/31 places, 41/41 transitions.
[2024-05-30 01:28:10] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:28:10] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:28:10] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:28:10] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:10] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:10] [INFO ] Time to serialize gal into /tmp/CTLFireability8302510809443667613.gal : 2 ms
[2024-05-30 01:28:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5838053760183843517.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/CTLFireability8302510809443667613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5838053760183843517.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,16021,0.027286,4556,2,424,5,3971,6,0,167,6428,0


Converting to forward existential form...Done !
original formula: (A(!((AF(((p26==1)&&(p28==1))) * (AX((((p20==1)&&(p21==1))&&(p25==1))) + !((((p3==1)&&(p20==1))&&(p30==1)))))) U ((E(AX(EX(((p26==1)&&(p2...318
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!((E(!(((E(!(EX(!(EX(((p26==1)&&(p28==1)))))) U ((!(!(EG(!((((p3==1)&&(p18==1))&&(p30==1)))...738
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t17, t19, t21, t22, t23, t24...300
Hit Full ! (commute/partial/dont) 26/25/15
(forward)formula 0,1,1.07948,46612,1,0,623,201606,138,331,1492,343588,755
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-30 01:28:11] [INFO ] Invariant cache hit.
[2024-05-30 01:28:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 01:28:11] [INFO ] Invariant cache hit.
[2024-05-30 01:28:11] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:11] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:28:11] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:28:11] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:28:11] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:11] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:11] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:28:11] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:28:11] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:11] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 732 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:12] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:28:12] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:12] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 877 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1619ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1619ms
Finished structural reductions in LTL mode , in 1 iterations and 1698 ms. Remains : 31/31 places, 41/41 transitions.
[2024-05-30 01:28:12] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:28:13] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:28:13] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:28:13] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:28:13] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13857138619744346051.gal : 1 ms
[2024-05-30 01:28:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5490310233667597228.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/CTLFireability13857138619744346051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5490310233667597228.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,16021,0.028652,4556,2,424,5,3971,6,0,167,6428,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((A((((p20==1)&&(p21==1))&&(p25==1)) U (((p19==1)&&(p21==1))&&(p26==1))) * AX((p29==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((!((E(!((((p19==1)&&(p21==1))&&(p26==1))) U (!((((p20==1)&&(p21==1))&&(p25...282
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t17, t19, t21, t22, t23, t24...300
(forward)formula 0,1,0.711746,31824,1,0,376,135405,116,169,1377,227597,392
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 40
Applied a total of 2 rules in 7 ms. Remains 30 /31 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 30 cols
[2024-05-30 01:28:13] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:28:13] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-30 01:28:13] [INFO ] Invariant cache hit.
[2024-05-30 01:28:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-30 01:28:13] [INFO ] Redundant transitions in 15 ms returned [12]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 38 sub problems to find dead transitions.
// Phase 1: matrix 39 rows 30 cols
[2024-05-30 01:28:13] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:13] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/69 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:28:14] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/69 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 87 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1158 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:15] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 39/69 variables, 30/89 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 38/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:28:15] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/69 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/69 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 128 constraints, problems are : Problem set: 0 solved, 38 unsolved in 929 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 21/21 constraints]
After SMT, in 2098ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2099ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/31 places, 39/41 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2192 ms. Remains : 30/31 places, 39/41 transitions.
[2024-05-30 01:28:15] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:15] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:15] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-30 01:28:15] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:28:15] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:28:15] [INFO ] Time to serialize gal into /tmp/CTLFireability7762059309109116568.gal : 1 ms
[2024-05-30 01:28:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16540655010855004629.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/CTLFireability7762059309109116568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16540655010855004629.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,11472,0.03014,4544,2,406,5,3739,6,0,161,6197,0


Converting to forward existential form...Done !
original formula: EF(AG((!(A(((p1==1)&&(p9==1)) U (p24==1))) * E((((p5==1)&&(p7==1))&&(p11==1)) U (p11==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(!((E(!((p24==1)) U (!(((p1==1)&&(p9==1))) * !((p24==1)))) + EG(!((p24==1))))...219
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t18, t19, t21, t22, t24, t25, t28...290
(forward)formula 0,0,0.42518,22276,1,0,364,92844,115,158,1305,153191,375
FORMULA ShieldRVs-PT-002A-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 31 cols
[2024-05-30 01:28:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:28:16] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:28:16] [INFO ] Invariant cache hit.
[2024-05-30 01:28:16] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:16] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:28:16] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:28:16] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:16] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:28:16] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:28:16] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:28:16] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:28:16] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:16] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 704 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:17] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:28:17] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:17] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 846 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1559ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1561ms
Finished structural reductions in LTL mode , in 1 iterations and 1633 ms. Remains : 31/31 places, 41/41 transitions.
[2024-05-30 01:28:18] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:28:18] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:18] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:28:18] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:28:18] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:18] [INFO ] Time to serialize gal into /tmp/CTLFireability12783059862275620256.gal : 1 ms
[2024-05-30 01:28:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11059379579819632776.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/CTLFireability12783059862275620256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11059379579819632776.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,16021,0.032846,4556,2,424,5,3971,6,0,167,6428,0


Converting to forward existential form...Done !
original formula: EX(EF(EX(((EF(((p1==1)&&(p9==1))) + (p5==0)) + ((p7==0)||(p11==0))))))
=> equivalent forward existential formula: (([(FwdU(EY(FwdU(EY(Init),TRUE)),TRUE) * ((p1==1)&&(p9==1)))] != FALSE + [(EY(FwdU(EY(Init),TRUE)) * (p5==0))] !...225
(forward)formula 0,1,0.051341,4820,1,0,10,4747,9,1,349,7915,7
FORMULA ShieldRVs-PT-002A-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-30 01:28:18] [INFO ] Invariant cache hit.
[2024-05-30 01:28:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:28:18] [INFO ] Invariant cache hit.
[2024-05-30 01:28:18] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:18] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:28:18] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:28:18] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:18] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:28:18] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:28:18] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:28:18] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:28:18] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:18] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 697 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:19] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:28:19] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:19] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 855 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1561ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1561ms
Finished structural reductions in LTL mode , in 1 iterations and 1626 ms. Remains : 31/31 places, 41/41 transitions.
[2024-05-30 01:28:19] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:28:19] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:28:19] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:28:19] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:19] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13944311937973218896.gal : 2 ms
[2024-05-30 01:28:19] [INFO ] Time to serialize properties into /tmp/CTLFireability14647060598823731598.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/CTLFireability13944311937973218896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14647060598823731598.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,16021,0.03083,4560,2,424,5,3971,6,0,167,6428,0


Converting to forward existential form...Done !
original formula: (EF(((EX((((((((p24==1)&&(p30==1))&&((p19==1)&&(p21==1)))&&(p25==1))||(((p19==1)&&(p21==1))&&(p26==1)))||(p4==1)) * EF((p5==1)))) * (p2==...456
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((EX((((((((p24==1)&&(p30==1))&&((p19==1)&&(p21==1)))&&(p25==1))||(((p19==1)&&(p21==1))&&...574
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t17, t19, t21, t22, t23, t24...300
Using saturation style SCC detection
(forward)formula 0,0,1.06185,43936,1,0,484,195897,139,227,1426,318241,518
FORMULA ShieldRVs-PT-002A-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-30 01:28:20] [INFO ] Invariant cache hit.
[2024-05-30 01:28:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 01:28:20] [INFO ] Invariant cache hit.
[2024-05-30 01:28:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 01:28:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:28:21] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:28:21] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:28:21] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:28:21] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:28:21] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:28:21] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:28:21] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:21] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 80 constraints, problems are : Problem set: 0 solved, 40 unsolved in 701 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 41/72 variables, 31/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:21] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:28:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:28:22] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 123 constraints, problems are : Problem set: 0 solved, 40 unsolved in 874 ms.
Refiners :[Domain max(s): 31/31 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
After SMT, in 1584ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1585ms
Finished structural reductions in LTL mode , in 1 iterations and 1658 ms. Remains : 31/31 places, 41/41 transitions.
[2024-05-30 01:28:22] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:28:22] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:22] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:28:22] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:28:22] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:28:22] [INFO ] Time to serialize gal into /tmp/CTLFireability8575445755420471811.gal : 0 ms
[2024-05-30 01:28:22] [INFO ] Time to serialize properties into /tmp/CTLFireability13457869222655462818.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/CTLFireability8575445755420471811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13457869222655462818.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,16021,0.034885,4560,2,424,5,3971,6,0,167,6428,0


Converting to forward existential form...Done !
original formula: AG(!(A((((p2==1)&&(p4==1))&&(p16==1)) U (AG(AF((p11==1))) * EX(EG((p10==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((!(E(TRUE U !(!(EG(!((p11==1))))))) * EX(EG((p10==1)))))))) * !(E(!((!(E(TRUE U !(!(...306
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t17, t19, t21, t22, t23, t24...300
(forward)formula 0,1,0.197455,11688,1,0,257,43427,113,95,1359,58725,258
FORMULA ShieldRVs-PT-002A-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 01:28:22] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:28:22] [INFO ] Flatten gal took : 3 ms
Total runtime 38333 ms.

BK_STOP 1717032502776

--------------------
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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldRVs-PT-002A"
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 ShieldRVs-PT-002A, 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 r356-tall-171683761700722"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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