About the Execution of ITS-Tools for ShieldRVs-PT-003A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1104.191 | 258901.00 | 300167.00 | 705.20 | TTFTTTTTTFFTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761700738.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-003A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761700738
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 26K 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 9.3K Apr 12 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 17:16 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 19K 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-003A-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-003A-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717032913086
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-003A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:35:14] [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:35:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:35:14] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-30 01:35:14] [INFO ] Transformed 45 places.
[2024-05-30 01:35:14] [INFO ] Transformed 60 transitions.
[2024-05-30 01:35:14] [INFO ] Found NUPN structural information;
[2024-05-30 01:35:14] [INFO ] Parsed PT model containing 45 places and 60 transitions and 276 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 43 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 19 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 45 cols
[2024-05-30 01:35:14] [INFO ] Computed 13 invariants in 8 ms
[2024-05-30 01:35:14] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-30 01:35:14] [INFO ] Invariant cache hit.
[2024-05-30 01:35:14] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:35:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 7 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 2 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:35:15] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:16] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:35:16] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:16] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:35:16] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1966 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:17] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1428 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3460ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3478ms
Finished structural reductions in LTL mode , in 1 iterations and 3793 ms. Remains : 45/45 places, 60/60 transitions.
Support contains 43 out of 45 places after structural reductions.
[2024-05-30 01:35:18] [INFO ] Flatten gal took : 26 ms
[2024-05-30 01:35:18] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:35:18] [INFO ] Input system was already deterministic with 60 transitions.
Reduction of identical properties reduced properties to check from 51 to 49
RANDOM walk for 40000 steps (765 resets) in 1097 ms. (36 steps per ms) remains 1/49 properties
BEST_FIRST walk for 40003 steps (248 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
[2024-05-30 01:35:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp40 is UNSAT
After SMT solving in domain Real declared 15/105 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Domain max(s): 5/45 constraints, Positive P Invariants (semi-flows): 4/13 constraints, State Equation: 0/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-30 01:35:19] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:35:19] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:35:19] [INFO ] Input system was already deterministic with 60 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 01:35:19] [INFO ] Invariant cache hit.
[2024-05-30 01:35:19] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:35:19] [INFO ] Invariant cache hit.
[2024-05-30 01:35:19] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:35:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:35:19] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
[2024-05-30 01:35:20] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 7 ms to minimize.
[2024-05-30 01:35:20] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:35:20] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:20] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:35:20] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:20] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:35:20] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1726 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:21] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1340 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3102ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3103ms
Finished structural reductions in LTL mode , in 1 iterations and 3186 ms. Remains : 45/45 places, 60/60 transitions.
[2024-05-30 01:35:22] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:35:22] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:35:22] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:35:22] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:35:22] [INFO ] Flatten gal took : 21 ms
[2024-05-30 01:35:22] [INFO ] Time to serialize gal into /tmp/CTLFireability8035889594217625377.gal : 2 ms
[2024-05-30 01:35:22] [INFO ] Time to serialize properties into /tmp/CTLFireability13812915986660144327.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/CTLFireability8035889594217625377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13812915986660144327.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.075192,6208,2,922,5,9992,6,0,242,18837,0
Converting to forward existential form...Done !
original formula: E((!((!(AX((((p34==1)&&(p35==1))&&(p40==1)))) + (((p17==1)&&(p34==1))&&(p44==1)))) + ((p8==1)&&(p13==1))) U !(((A((p43==1) U !((((p17==1)...356
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,(!((!(!(EX(!((((p34==1)&&(p35==1))&&(p40==1)))))) + (((p17==1)&&(p34==1))&&(p44==1)))) + ((p...1004
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...380
(forward)formula 0,1,18.4443,602068,1,0,1249,2.65169e+06,186,601,2068,5.30475e+06,1292
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-00 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 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 01:35:41] [INFO ] Invariant cache hit.
[2024-05-30 01:35:41] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 01:35:41] [INFO ] Invariant cache hit.
[2024-05-30 01:35:41] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:35:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:35:41] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:35:42] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:35:42] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 3 ms to minimize.
[2024-05-30 01:35:42] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:42] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:35:42] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:42] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:35:42] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1806 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:43] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1264 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3095ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3099ms
Finished structural reductions in LTL mode , in 1 iterations and 3207 ms. Remains : 45/45 places, 60/60 transitions.
[2024-05-30 01:35:44] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:35:44] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:35:44] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:35:44] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:35:44] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:35:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12880001452608644039.gal : 3 ms
[2024-05-30 01:35:44] [INFO ] Time to serialize properties into /tmp/CTLFireability1893316391783923509.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/CTLFireability12880001452608644039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1893316391783923509.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.065938,6284,2,922,5,9992,6,0,242,18837,0
Converting to forward existential form...Done !
original formula: (AX(EF((p43==1))) * AF((AX(((((p15==0)&&(p2==1))&&((p6==1)&&(p16==1)))&&(((p2==1)&&(p6==1))&&((p16==1)&&(((p33==0)||(p35==0))||(p39==0)))...180
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U (p43==1))))] = FALSE * [FwdG(Init,!((!(EX(!(((((p15==0)&&(p2==1))&&((p6==1)&&(p16==1)))...277
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...380
(forward)formula 0,1,1.06626,42372,1,0,288,177273,150,104,2057,302303,262
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 01:35:45] [INFO ] Invariant cache hit.
[2024-05-30 01:35:45] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:35:45] [INFO ] Invariant cache hit.
[2024-05-30 01:35:45] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:35:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:45] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:35:45] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:35:45] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:35:45] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:35:45] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:35:45] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:35:45] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:35:45] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:35:45] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:35:45] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:35:46] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:35:46] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:35:46] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:35:46] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:35:46] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:46] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:35:46] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:46] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:35:46] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1682 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:47] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1367 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3063ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3064ms
Finished structural reductions in LTL mode , in 1 iterations and 3158 ms. Remains : 45/45 places, 60/60 transitions.
[2024-05-30 01:35:48] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:35:48] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:35:48] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:35:48] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:35:48] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:35:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8033344865316709772.gal : 1 ms
[2024-05-30 01:35:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14060742183087404462.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/CTLFireability8033344865316709772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14060742183087404462.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.067632,6280,2,922,5,9992,6,0,242,18837,0
Converting to forward existential form...Done !
original formula: AX(AG(AX(EX((p24==0)))))
=> equivalent forward existential formula: [(EY(FwdU(EY(Init),TRUE)) * !(EX((p24==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...380
(forward)formula 0,0,0.313026,15520,1,0,180,65032,137,65,2065,82055,131
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 0 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 01:35:48] [INFO ] Invariant cache hit.
[2024-05-30 01:35:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 01:35:48] [INFO ] Invariant cache hit.
[2024-05-30 01:35:48] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:35:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 6 ms to minimize.
[2024-05-30 01:35:49] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:50] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:35:50] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:50] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:35:50] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1726 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:35:51] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1394 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3140ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3143ms
Finished structural reductions in LTL mode , in 1 iterations and 3222 ms. Remains : 45/45 places, 60/60 transitions.
[2024-05-30 01:35:52] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:35:52] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:35:52] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:35:52] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:35:52] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:35:52] [INFO ] Time to serialize gal into /tmp/CTLFireability18386263994029439456.gal : 3 ms
[2024-05-30 01:35:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7097245785497456269.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/CTLFireability18386263994029439456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7097245785497456269.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.075501,6284,2,922,5,9992,6,0,242,18837,0
Converting to forward existential form...Done !
original formula: A(EF(EG(((((p2==1)&&(p4==1))&&(p16==1))||((p40==1)&&(p44==1))))) U ((EG(((((((p2==1)&&(p4==1))&&((p15==1)&&(p19==1)))&&(((p21==1)&&(p25==...522
=> equivalent forward existential formula: [((Init * !(EG(!(((EG(((((((p2==1)&&(p4==1))&&((p15==1)&&(p19==1)))&&(((p21==1)&&(p25==1))&&(p18!=1)))||(p28!=1)...1846
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...380
Detected timeout of ITS tools.
[2024-05-30 01:36:22] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:36:22] [INFO ] Applying decomposition
[2024-05-30 01:36:22] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8448266976045700510.txt' '-o' '/tmp/graph8448266976045700510.bin' '-w' '/tmp/graph8448266976045700510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8448266976045700510.bin' '-l' '-1' '-v' '-w' '/tmp/graph8448266976045700510.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:36:22] [INFO ] Decomposing Gal with order
[2024-05-30 01:36:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:36:22] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-30 01:36:22] [INFO ] Flatten gal took : 32 ms
[2024-05-30 01:36:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 5 ms.
[2024-05-30 01:36:22] [INFO ] Time to serialize gal into /tmp/CTLFireability614917305326943447.gal : 2 ms
[2024-05-30 01:36:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12031509614976301451.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/CTLFireability614917305326943447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12031509614976301451.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.206719,13344,340,29,16882,76,108,62407,31,366,0
Converting to forward existential form...Done !
original formula: A(EF(EG(((((i0.u0.p2==1)&&(i0.u1.p4==1))&&(i0.u4.p16==1))||((i3.u11.p40==1)&&(i3.u12.p44==1))))) U ((EG(((((((i0.u0.p2==1)&&(i0.u1.p4==1)...744
=> equivalent forward existential formula: [((Init * !(EG(!(((EG(((((((i0.u0.p2==1)&&(i0.u1.p4==1))&&((i0.u4.p15==1)&&(i1.u5.p19==1)))&&(((i1.u6.p21==1)&&(...2544
Reverse transition relation is NOT exact ! Due to transitions t26, t30, t37, t42, t47, u9.t12, u9.t13, u9.t19, i0.t55, i0.t34, i0.u1.t0, i0.u1.t1, i0.u3.t2...410
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 60/60 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 44 transition count 59
Applied a total of 2 rules in 11 ms. Remains 44 /45 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 44 cols
[2024-05-30 01:36:52] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:36:52] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:36:52] [INFO ] Invariant cache hit.
[2024-05-30 01:36:52] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-30 01:36:52] [INFO ] Redundant transitions in 22 ms returned [18]
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 57 sub problems to find dead transitions.
// Phase 1: matrix 58 rows 44 cols
[2024-05-30 01:36:52] [INFO ] Computed 13 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:52] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 9 ms to minimize.
[2024-05-30 01:36:52] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:36:52] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:36:52] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:36:52] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:36:52] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:36:52] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:53] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:54] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:36:54] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
[2024-05-30 01:36:54] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/102 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:54] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:36:54] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:36:54] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:36:54] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:36:54] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:36:54] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/102 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:54] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:36:55] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 17 (OVERLAPS) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 135 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2907 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 34/91 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:36:55] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:36:55] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:36:55] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 2 ms to minimize.
[2024-05-30 01:36:55] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 57/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 196 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1365 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 38/38 constraints]
After SMT, in 4293ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 4294ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/45 places, 58/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4420 ms. Remains : 44/45 places, 58/60 transitions.
[2024-05-30 01:36:56] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:36:56] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:36:56] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-30 01:36:56] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:36:56] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:36:56] [INFO ] Time to serialize gal into /tmp/CTLFireability4259142722525891360.gal : 2 ms
[2024-05-30 01:36:56] [INFO ] Time to serialize properties into /tmp/CTLFireability4222425208523641170.ctl : 3 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/CTLFireability4259142722525891360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4222425208523641170.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.096e+06,0.068794,6300,2,896,5,9693,6,0,236,18411,0
Converting to forward existential form...Done !
original formula: EF(EG((((AF(E((((p19==1)&&(p21==1))&&(p26==1)) U (((p19==1)&&(p21==1))&&(p25==1)))) + AG((p24==0))) + (AF((p32==1)) + AF((((p19==1)&&(p21...369
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((!(EG(!(E((((p19==1)&&(p21==1))&&(p26==1)) U (((p19==1)&&(p21==1))&&(p25==1)))))) + !(E(...449
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t19, t20, t22, t23...370
Using saturation style SCC detection
(forward)formula 0,1,19.5806,601260,1,0,1318,2.81422e+06,173,659,2030,5.1485e+06,1387
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 60/60 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 44 transition count 59
Applied a total of 2 rules in 13 ms. Remains 44 /45 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 44 cols
[2024-05-30 01:37:16] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:37:16] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 01:37:16] [INFO ] Invariant cache hit.
[2024-05-30 01:37:16] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-30 01:37:16] [INFO ] Redundant transitions in 19 ms returned [18]
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 57 sub problems to find dead transitions.
// Phase 1: matrix 58 rows 44 cols
[2024-05-30 01:37:16] [INFO ] Computed 13 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:37:16] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:37:16] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:37:16] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:37:17] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:37:18] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:37:18] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:37:18] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:37:18] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/102 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:37:18] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:37:18] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:37:18] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:37:18] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:37:18] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:37:19] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/102 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:37:19] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:37:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 17 (OVERLAPS) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 135 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2887 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 34/91 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:37:19] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:37:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:37:19] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:37:19] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 57/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 196 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1329 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 38/38 constraints]
After SMT, in 4241ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 4242ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/45 places, 58/60 transitions.
Applied a total of 0 rules in 8 ms. Remains 44 /44 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4383 ms. Remains : 44/45 places, 58/60 transitions.
[2024-05-30 01:37:20] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:37:20] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:37:20] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-30 01:37:20] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:37:20] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:37:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1471761138905851449.gal : 1 ms
[2024-05-30 01:37:20] [INFO ] Time to serialize properties into /tmp/CTLFireability3183025993079339527.ctl : 14 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/CTLFireability1471761138905851449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3183025993079339527.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.096e+06,0.09814,6300,2,896,5,9693,6,0,236,18411,0
Converting to forward existential form...Done !
original formula: EG(((((p24==0)||(p28==0))||(p37==0)) * ((EG(((p18==0)&&(p24==0))) + (p33==0)) + ((p35==0)||(p40==0)))))
=> equivalent forward existential formula: [FwdG(Init,((((p24==0)||(p28==0))||(p37==0)) * ((EG(((p18==0)&&(p24==0))) + (p33==0)) + ((p35==0)||(p40==0)))))]...164
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t19, t20, t22, t23...370
(forward)formula 0,1,9.82326,331524,1,0,681,1.47246e+06,145,319,1965,2.86279e+06,643
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 45 cols
[2024-05-30 01:37:30] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:37:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 01:37:30] [INFO ] Invariant cache hit.
[2024-05-30 01:37:30] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:37:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:37:31] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:32] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:37:32] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:32] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:37:32] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1707 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:33] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1368 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3088ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3089ms
Finished structural reductions in LTL mode , in 1 iterations and 3184 ms. Remains : 45/45 places, 60/60 transitions.
[2024-05-30 01:37:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:37:34] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:37:34] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:37:34] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:37:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:37:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6401305054101207679.gal : 3 ms
[2024-05-30 01:37:34] [INFO ] Time to serialize properties into /tmp/CTLFireability1804405817317674949.ctl : 16 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/CTLFireability6401305054101207679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1804405817317674949.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.072234,6312,2,922,5,9992,6,0,242,18837,0
Converting to forward existential form...Done !
original formula: EX(EG((((p19==0)||(p21==0))||(p26==0))))
=> equivalent forward existential formula: [FwdG(EY(Init),(((p19==0)||(p21==0))||(p26==0)))] != FALSE
Hit Full ! (commute/partial/dont) 45/0/15
(forward)formula 0,1,0.912374,35140,1,0,51,130340,19,4,1498,211589,49
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 01:37:35] [INFO ] Invariant cache hit.
[2024-05-30 01:37:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 01:37:35] [INFO ] Invariant cache hit.
[2024-05-30 01:37:35] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:37:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:37:35] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:36] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:37:36] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:36] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:37:36] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1722 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:37] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1396 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3132ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3133ms
Finished structural reductions in LTL mode , in 1 iterations and 3242 ms. Remains : 45/45 places, 60/60 transitions.
[2024-05-30 01:37:38] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:37:38] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:37:38] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:37:38] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:37:38] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:37:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2307920200286784393.gal : 1 ms
[2024-05-30 01:37:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11132942425157680202.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/CTLFireability2307920200286784393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11132942425157680202.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.064987,6316,2,922,5,9992,6,0,242,18837,0
Converting to forward existential form...Done !
original formula: EX(((EX(EG(((((p2==0)||(p4==0))||(p16==0))&&(p18==0)))) * (p40==1)) * (p44==1)))
=> equivalent forward existential formula: [FwdG(EY(((EY(Init) * (p44==1)) * (p40==1))),((((p2==0)||(p4==0))||(p16==0))&&(p18==0)))] != FALSE
Hit Full ! (commute/partial/dont) 43/17/17
(forward)formula 0,1,1.94734,76588,1,0,54,255507,21,6,1506,513078,52
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 60/60 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 43 transition count 58
Applied a total of 2 rules in 10 ms. Remains 43 /45 variables (removed 2) and now considering 58/60 (removed 2) transitions.
// Phase 1: matrix 58 rows 43 cols
[2024-05-30 01:37:40] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 01:37:40] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 01:37:40] [INFO ] Invariant cache hit.
[2024-05-30 01:37:40] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-30 01:37:40] [INFO ] Redundant transitions in 27 ms returned [17]
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 56 sub problems to find dead transitions.
// Phase 1: matrix 57 rows 43 cols
[2024-05-30 01:37:40] [INFO ] Computed 13 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:37:40] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:37:41] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:37:41] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:37:41] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:37:41] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:37:42] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:37:42] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 57/100 variables, 43/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:37:42] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (OVERLAPS) 0/100 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 120 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2615 ms.
Refiners :[Domain max(s): 43/43 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/100 variables, 43/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 56/176 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 176 constraints, problems are : Problem set: 0 solved, 56 unsolved in 796 ms.
Refiners :[Domain max(s): 43/43 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 21/21 constraints]
After SMT, in 3455ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 3456ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/45 places, 57/60 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 57/57 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 3598 ms. Remains : 43/45 places, 57/60 transitions.
[2024-05-30 01:37:43] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:37:43] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:37:43] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-30 01:37:43] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:37:43] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:37:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10225111072179470950.gal : 1 ms
[2024-05-30 01:37:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7632714881779518938.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/CTLFireability10225111072179470950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7632714881779518938.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.096e+06,0.079702,6352,2,855,5,9630,6,0,232,18382,0
Converting to forward existential form...Done !
original formula: (EG((p38==0)) + AF((EG((((p2==0)||(p4==0))||(p15==0))) * (p28==0))))
=> equivalent forward existential formula: [FwdG((Init * !(EG((p38==0)))),!((EG((((p2==0)||(p4==0))||(p15==0))) * (p28==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t21, t22...370
(forward)formula 0,1,13.7419,422932,1,0,859,1.92117e+06,146,361,1897,3.64598e+06,907
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 45 cols
[2024-05-30 01:37:57] [INFO ] Computed 13 invariants in 6 ms
[2024-05-30 01:37:57] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 01:37:57] [INFO ] Invariant cache hit.
[2024-05-30 01:37:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:37:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 7 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:37:58] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:59] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:37:59] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:37:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:37:59] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1854 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:00] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1348 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3240ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3242ms
Finished structural reductions in LTL mode , in 1 iterations and 3377 ms. Remains : 45/45 places, 60/60 transitions.
[2024-05-30 01:38:01] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:01] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:01] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:38:01] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:01] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11439152145305489537.gal : 1 ms
[2024-05-30 01:38:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12026819295908177973.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/CTLFireability11439152145305489537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12026819295908177973.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.066631,6312,2,922,5,9992,6,0,242,18837,0
Converting to forward existential form...Done !
original formula: AG(EF(AG(EX((((p19==1)&&(p21==1))&&(p25==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(EX((((p19==1)&&(p21==1))&&(p25==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...380
(forward)formula 0,0,0.262911,13968,1,0,183,61189,141,68,2011,69656,137
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 01:38:01] [INFO ] Invariant cache hit.
[2024-05-30 01:38:01] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 01:38:01] [INFO ] Invariant cache hit.
[2024-05-30 01:38:01] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:38:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:01] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:38:01] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:38:01] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:38:01] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:38:01] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:38:01] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:02] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 4 ms to minimize.
[2024-05-30 01:38:03] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1961 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:03] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1339 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3347ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3348ms
Finished structural reductions in LTL mode , in 1 iterations and 3445 ms. Remains : 45/45 places, 60/60 transitions.
[2024-05-30 01:38:04] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:38:04] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:04] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:38:04] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:38:04] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:04] [INFO ] Time to serialize gal into /tmp/CTLFireability1777285666480667375.gal : 14 ms
[2024-05-30 01:38:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5099523071421596112.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/CTLFireability1777285666480667375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5099523071421596112.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.067873,6312,2,922,5,9992,6,0,242,18837,0
Converting to forward existential form...Done !
original formula: (AF(E((p5==1) U (((AF((((p12==1)&&(p14==1))&&(p23==1))) + EF((((p17==1)&&(p32==1))&&(p44==1)))) * AX((p43==1))) + !(AF((((p34==1)&&(p35==...363
=> equivalent forward existential formula: ([FwdG(Init,!(E((p5==1) U (((!(EG(!((((p12==1)&&(p14==1))&&(p23==1))))) + E(TRUE U (((p17==1)&&(p32==1))&&(p44==...458
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...380
(forward)formula 0,0,13.147,395284,1,0,700,1.69873e+06,157,327,2054,3.36637e+06,663
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 01:38:18] [INFO ] Invariant cache hit.
[2024-05-30 01:38:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 01:38:18] [INFO ] Invariant cache hit.
[2024-05-30 01:38:18] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:38:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:38:19] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:38:19] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:38:19] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:38:19] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:19] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:38:19] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:38:19] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1882 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:20] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1632 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3556ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3557ms
Finished structural reductions in LTL mode , in 1 iterations and 3642 ms. Remains : 45/45 places, 60/60 transitions.
[2024-05-30 01:38:21] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:38:21] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:21] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:38:21] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:38:21] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:38:21] [INFO ] Time to serialize gal into /tmp/CTLFireability2327099735407499514.gal : 8 ms
[2024-05-30 01:38:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7045392393332301124.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/CTLFireability2327099735407499514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7045392393332301124.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.06723,6312,2,922,5,9992,6,0,242,18837,0
Converting to forward existential form...Done !
original formula: !(E(AG(EF((((p24==1)&&(p30==1))&&((p37==1)&&(p33==1))))) U A(EF(!(((((p17==1)&&(p32==1))&&(p44==1))||(p24==1)))) U (E(((p4==1)||(((p3==1)...240
=> equivalent forward existential formula: [((FwdU(Init,!(E(TRUE U !(E(TRUE U (((p24==1)&&(p30==1))&&((p37==1)&&(p33==1)))))))) * !(EG(!((E(((p4==1)||(((p3...546
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...380
(forward)formula 0,1,7.65969,247344,1,0,634,1.1e+06,153,258,2054,1.9875e+06,656
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 60/60 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 43 transition count 58
Applied a total of 2 rules in 5 ms. Remains 43 /45 variables (removed 2) and now considering 58/60 (removed 2) transitions.
// Phase 1: matrix 58 rows 43 cols
[2024-05-30 01:38:29] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 01:38:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-30 01:38:29] [INFO ] Invariant cache hit.
[2024-05-30 01:38:29] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-30 01:38:29] [INFO ] Redundant transitions in 18 ms returned [17]
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 56 sub problems to find dead transitions.
// Phase 1: matrix 57 rows 43 cols
[2024-05-30 01:38:29] [INFO ] Computed 13 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:38:29] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:38:30] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 57/100 variables, 43/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 01:38:31] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 11 (OVERLAPS) 0/100 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 120 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1886 ms.
Refiners :[Domain max(s): 43/43 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/100 variables, 43/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 56/176 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 176 constraints, problems are : Problem set: 0 solved, 56 unsolved in 774 ms.
Refiners :[Domain max(s): 43/43 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 21/21 constraints]
After SMT, in 2697ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2698ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/45 places, 57/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 57/57 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2884 ms. Remains : 43/45 places, 57/60 transitions.
[2024-05-30 01:38:32] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:32] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:38:32] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-30 01:38:32] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:38:32] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:38:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10937879481012783470.gal : 1 ms
[2024-05-30 01:38:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9825509665285254032.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/CTLFireability10937879481012783470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9825509665285254032.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.096e+06,0.067366,6352,2,855,5,9630,6,0,232,18382,0
Converting to forward existential form...Done !
original formula: EG(AF((p38==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p38==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t21, t22...370
(forward)formula 0,0,7.09121,235508,1,0,561,1.05476e+06,141,223,1868,1.97634e+06,567
FORMULA ShieldRVs-PT-003A-CTLFireability-2023-12 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 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 45 cols
[2024-05-30 01:38:39] [INFO ] Computed 13 invariants in 8 ms
[2024-05-30 01:38:39] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 01:38:39] [INFO ] Invariant cache hit.
[2024-05-30 01:38:39] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:38:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:39] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:38:39] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:38:40] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:41] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:38:41] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1844 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:42] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1421 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3296ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3297ms
Finished structural reductions in LTL mode , in 1 iterations and 3391 ms. Remains : 45/45 places, 60/60 transitions.
[2024-05-30 01:38:42] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:38:42] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:38:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:38:42] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:43] [INFO ] Time to serialize gal into /tmp/CTLFireability3549230516693897997.gal : 1 ms
[2024-05-30 01:38:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3558078577845019594.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/CTLFireability3549230516693897997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3558078577845019594.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.065311,6316,2,922,5,9992,6,0,242,18837,0
Converting to forward existential form...Done !
original formula: EX(EF((AX((AG((p0==1)) + (p11==0))) * AX((p0==1)))))
=> equivalent forward existential formula: [((FwdU(EY(Init),TRUE) * !(EX(!((!(E(TRUE U !((p0==1)))) + (p11==0)))))) * !(EX(!((p0==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...380
(forward)formula 0,1,0.324508,17284,1,0,187,72255,144,71,2081,99096,142
FORMULA ShieldRVs-PT-003A-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 01:38:43] [INFO ] Invariant cache hit.
[2024-05-30 01:38:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:38:43] [INFO ] Invariant cache hit.
[2024-05-30 01:38:43] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-30 01:38:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:43] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:38:43] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:38:43] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:38:43] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 60/105 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:38:44] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:45] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:38:45] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/105 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 123 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2050 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:38:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1312 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 21/21 constraints]
After SMT, in 3391ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3392ms
Finished structural reductions in LTL mode , in 1 iterations and 3501 ms. Remains : 45/45 places, 60/60 transitions.
[2024-05-30 01:38:46] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:38:46] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:46] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:38:46] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:38:46] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:46] [INFO ] Time to serialize gal into /tmp/CTLFireability6651789164180788882.gal : 1 ms
[2024-05-30 01:38:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1478032045223907821.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/CTLFireability6651789164180788882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1478032045223907821.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.069148,6312,2,922,5,9992,6,0,242,18837,0
Converting to forward existential form...Done !
original formula: EG(EX((!(A((p32==1) U (((p10==1)&&(p14==1))&&(p23==1)))) * AF(EG((((p19==1)&&(p21==1))&&(p26==1)))))))
=> equivalent forward existential formula: [FwdG(Init,EX((!(!((E(!((((p10==1)&&(p14==1))&&(p23==1))) U (!((p32==1)) * !((((p10==1)&&(p14==1))&&(p23==1)))))...262
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...380
(forward)formula 0,0,4.65372,171700,1,0,536,725985,158,217,2048,1.36323e+06,537
FORMULA ShieldRVs-PT-003A-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 60/60 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 44 transition count 59
Applied a total of 2 rules in 5 ms. Remains 44 /45 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 44 cols
[2024-05-30 01:38:51] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:38:51] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 01:38:51] [INFO ] Invariant cache hit.
[2024-05-30 01:38:51] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-30 01:38:51] [INFO ] Redundant transitions in 18 ms returned [18]
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 57 sub problems to find dead transitions.
// Phase 1: matrix 58 rows 44 cols
[2024-05-30 01:38:51] [INFO ] Computed 13 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:38:51] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:38:51] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:38:52] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:38:53] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:38:53] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:38:53] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:38:53] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:38:53] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/102 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:38:53] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:38:53] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:38:54] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:38:54] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:38:54] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:38:54] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/102 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:38:54] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:38:54] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 17 (OVERLAPS) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 135 constraints, problems are : Problem set: 0 solved, 57 unsolved in 3045 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 34/91 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:38:54] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:38:54] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:38:55] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:38:55] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 58/102 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 57/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 196 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1320 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 38/38 constraints]
After SMT, in 4407ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 4408ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/45 places, 58/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4563 ms. Remains : 44/45 places, 58/60 transitions.
[2024-05-30 01:38:56] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:38:56] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:56] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-30 01:38:56] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:38:56] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:38:56] [INFO ] Time to serialize gal into /tmp/CTLFireability12046085915744681778.gal : 1 ms
[2024-05-30 01:38:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16071716830107569484.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/CTLFireability12046085915744681778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16071716830107569484.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.096e+06,0.066046,6300,2,896,5,9693,6,0,236,18411,0
Converting to forward existential form...Done !
original formula: EG(EF(((A((p15==1) U (((EG((((p19==1)&&(p21==1))&&(p25==1))) * (p40==1)) * ((p42==1)&&(p6==1))) * ((p7==1)&&(p11==1)))) * (p6==1)) * ((p7...173
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!((E(!((((EG((((p19==1)&&(p21==1))&&(p25==1))) * (p40==1)) * ((p42==1)&&(p6==1))) * ((p7==...445
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t19, t20, t22, t23...370
(forward)formula 0,0,4.4308,155076,1,0,490,663440,155,198,2002,1.21417e+06,493
FORMULA ShieldRVs-PT-003A-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 01:39:00] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:39:00] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:39:00] [INFO ] Applying decomposition
[2024-05-30 01:39:00] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12206880410316131132.txt' '-o' '/tmp/graph12206880410316131132.bin' '-w' '/tmp/graph12206880410316131132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12206880410316131132.bin' '-l' '-1' '-v' '-w' '/tmp/graph12206880410316131132.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:39:00] [INFO ] Decomposing Gal with order
[2024-05-30 01:39:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:39:00] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-30 01:39:00] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:39:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 2 ms.
[2024-05-30 01:39:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8699095857667897130.gal : 2 ms
[2024-05-30 01:39:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5238025812874408984.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/CTLFireability8699095857667897130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5238025812874408984.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5305e+06,0.218868,13368,340,29,17031,76,108,61069,31,354,0
Converting to forward existential form...Done !
original formula: A(EF(EG(((((i0.u0.p2==1)&&(i0.u1.p4==1))&&(i0.u4.p16==1))||((i3.u11.p40==1)&&(i3.u12.p44==1))))) U ((EG(((((((i0.u0.p2==1)&&(i0.u1.p4==1)...744
=> equivalent forward existential formula: [((Init * !(EG(!(((EG(((((((i0.u0.p2==1)&&(i0.u1.p4==1))&&((i0.u4.p15==1)&&(i1.u5.p19==1)))&&(((i1.u6.p21==1)&&(...2544
Reverse transition relation is NOT exact ! Due to transitions t26, t30, t37, t42, t47, u9.t12, u9.t13, u9.t19, i0.t55, i0.t34, i0.u1.t0, i0.u1.t1, i0.u3.t2...410
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,31.0509,771528,1,0,866794,179,749,5.59346e+06,129,417,388140
FORMULA ShieldRVs-PT-003A-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 257668 ms.
BK_STOP 1717033171987
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-003A"
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-003A, 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-171683761700738"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-003A.tgz
mv ShieldRVs-PT-003A 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 '
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 ;