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.r576-smll-171734919800002.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 MedleyA-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919800002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 18K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717351390566

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 18:03:13] [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-06-02 18:03:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:03:13] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-02 18:03:13] [INFO ] Transformed 61 places.
[2024-06-02 18:03:13] [INFO ] Transformed 53 transitions.
[2024-06-02 18:03:13] [INFO ] Found NUPN structural information;
[2024-06-02 18:03:13] [INFO ] Parsed PT model containing 61 places and 53 transitions and 210 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Support contains 59 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 21 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:14] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
// Phase 1: matrix 52 rows 61 cols
[2024-06-02 18:03:14] [INFO ] Computed 20 invariants in 19 ms
[2024-06-02 18:03:14] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-06-02 18:03:14] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:14] [INFO ] Invariant cache hit.
[2024-06-02 18:03:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 18:03:14] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-02 18:03:14] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:14] [INFO ] Invariant cache hit.
[2024-06-02 18:03:14] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:15] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 16 ms to minimize.
[2024-06-02 18:03:15] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:03:16] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 167 constraints, problems are : Problem set: 0 solved, 52 unsolved in 3451 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:19] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:19] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
[2024-06-02 18:03:19] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 1/113 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (OVERLAPS) 0/113 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 222 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2857 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints]
After SMT, in 6407ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 6428ms
Finished structural reductions in LTL mode , in 1 iterations and 7287 ms. Remains : 61/61 places, 53/53 transitions.
Support contains 59 out of 61 places after structural reductions.
[2024-06-02 18:03:21] [INFO ] Flatten gal took : 38 ms
[2024-06-02 18:03:21] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:03:21] [INFO ] Input system was already deterministic with 53 transitions.
Reduction of identical properties reduced properties to check from 64 to 58
RANDOM walk for 40000 steps (8 resets) in 3474 ms. (11 steps per ms) remains 5/58 properties
BEST_FIRST walk for 40004 steps (8 resets) in 543 ms. (73 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 291 ms. (136 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
[2024-06-02 18:03:23] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:23] [INFO ] Invariant cache hit.
[2024-06-02 18:03:23] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 6/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 43/61 variables, 14/38 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 43/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/163 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/164 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 164 constraints, problems are : Problem set: 1 solved, 2 unsolved in 152 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 17/32 variables, 10/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 17/42 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/61 variables, 10/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 29/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 18:03:23] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:03:23] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 2/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 51/112 variables, 61/144 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 21/165 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 2/167 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 18:03:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/113 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/113 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/113 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 169 constraints, problems are : Problem set: 1 solved, 2 unsolved in 279 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 451ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 1 properties in 123 ms.
Support contains 12 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 53/53 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 61 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 60 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 59 transition count 49
Applied a total of 6 rules in 47 ms. Remains 59 /61 variables (removed 2) and now considering 49/53 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 59/61 places, 49/53 transitions.
RANDOM walk for 40000 steps (8 resets) in 619 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 638483 steps, run visited all 1 properties in 842 ms. (steps per millisecond=758 )
Probabilistic random walk after 638483 steps, saw 90623 distinct states, run finished after 848 ms. (steps per millisecond=752 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-02 18:03:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:03:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:03:24] [INFO ] Input system was already deterministic with 53 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:24] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:24] [INFO ] Invariant cache hit.
[2024-06-02 18:03:25] [INFO ] Implicit Places using invariants in 127 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 60/61 places, 53/53 transitions.
[2024-06-02 18:03:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:03:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:03:25] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:25] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:03:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:03:25] [INFO ] Time to serialize gal into /tmp/CTLFireability18149828513057525090.gal : 4 ms
[2024-06-02 18:03:25] [INFO ] Time to serialize properties into /tmp/CTLFireability10004381282826427952.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/CTLFireability18149828513057525090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10004381282826427952.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.50099e+07,0.072399,5064,2,632,5,7013,6,0,292,7644,0


Converting to forward existential form...Done !
original formula: EX(EF((((AF((((p19==1)&&(p25==1))||((p50==1)&&(p60==1)))) * (p3==1)) * ((p9==1)&&(p7==1))) * (p53==1))))
=> equivalent forward existential formula: [((((FwdU(EY(Init),TRUE) * (p53==1)) * ((p9==1)&&(p7==1))) * (p3==1)) * !(EG(!((((p19==1)&&(p25==1))||((p50==1)&...180
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
(forward)formula 0,1,0.257833,10860,1,0,125,45325,131,60,1908,35707,123
FORMULA MedleyA-PT-01-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:25] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:25] [INFO ] Invariant cache hit.
[2024-06-02 18:03:25] [INFO ] Implicit Places using invariants in 91 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 60/61 places, 53/53 transitions.
[2024-06-02 18:03:25] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:25] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:25] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:03:25] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:03:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9543416956413451985.gal : 3 ms
[2024-06-02 18:03:25] [INFO ] Time to serialize properties into /tmp/CTLFireability12013265792678708234.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/CTLFireability9543416956413451985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12013265792678708234.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.50099e+07,0.12266,5916,2,286,5,12943,6,0,291,13498,0


Converting to forward existential form...Done !
original formula: EF(((EX(EF((((p42==1)&&(p54==1))&&((p32==1)&&(p59==1))))) * AG(AF(((p34==0)||(p40==0))))) * ((p20==0)||(p21==0))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p20==0)||(p21==0))) * EX(E(TRUE U (((p42==1)&&(p54==1))&&((p32==1)&&(p59==1)))))) * !(E(...208
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
(forward)formula 0,1,0.602011,14628,1,0,161,63323,134,85,1888,65459,186
FORMULA MedleyA-PT-01-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:26] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:26] [INFO ] Invariant cache hit.
[2024-06-02 18:03:26] [INFO ] Implicit Places using invariants in 131 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 60/61 places, 53/53 transitions.
[2024-06-02 18:03:26] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:03:26] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:03:26] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:26] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:26] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:26] [INFO ] Time to serialize gal into /tmp/CTLFireability16186602841665588447.gal : 2 ms
[2024-06-02 18:03:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9893785345726085514.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/CTLFireability16186602841665588447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9893785345726085514.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.50099e+07,0.057019,4856,2,632,5,7013,6,0,292,7644,0


Converting to forward existential form...Done !
original formula: A(E((AG(((p6==1)&&(p13==1))) + EG((AF(((p32==1)&&(p59==1))) + EX(((p2==1)&&(p8==1)))))) U !(EF(AG(((p38==1)&&(p45==1)))))) U !(EF(AG(((!(...226
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U !(((!((p23==1)&&(p53==1)))&&(((p32==1)&&(p59==1))||((p11==1)&&(p57==1))))...557
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
(forward)formula 0,1,0.245543,10400,1,0,122,42909,135,59,1882,31815,120
FORMULA MedleyA-PT-01-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 61 transition count 52
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 60 transition count 52
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 4 place count 59 transition count 51
Applied a total of 4 rules in 16 ms. Remains 59 /61 variables (removed 2) and now considering 51/53 (removed 2) transitions.
[2024-06-02 18:03:26] [INFO ] Flow matrix only has 50 transitions (discarded 1 similar events)
// Phase 1: matrix 50 rows 59 cols
[2024-06-02 18:03:26] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:03:26] [INFO ] Implicit Places using invariants in 95 ms returned [49, 52, 53]
[2024-06-02 18:03:26] [INFO ] Actually due to overlaps returned [52, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 97 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/61 places, 51/53 transitions.
Graph (trivial) has 10 edges and 57 vertex of which 2 / 57 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 53 transition count 46
Applied a total of 7 rules in 23 ms. Remains 53 /57 variables (removed 4) and now considering 46/51 (removed 5) transitions.
[2024-06-02 18:03:26] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 53 cols
[2024-06-02 18:03:26] [INFO ] Computed 18 invariants in 2 ms
[2024-06-02 18:03:26] [INFO ] Implicit Places using invariants in 92 ms returned [7, 22, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 93 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 50/61 places, 46/53 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 47 transition count 43
Applied a total of 6 rules in 8 ms. Remains 47 /50 variables (removed 3) and now considering 43/46 (removed 3) transitions.
[2024-06-02 18:03:26] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
// Phase 1: matrix 40 rows 47 cols
[2024-06-02 18:03:26] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 18:03:26] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 18:03:26] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2024-06-02 18:03:26] [INFO ] Invariant cache hit.
[2024-06-02 18:03:27] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-02 18:03:27] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 47/61 places, 43/53 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 467 ms. Remains : 47/61 places, 43/53 transitions.
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:27] [INFO ] Input system was already deterministic with 43 transitions.
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:27] [INFO ] Time to serialize gal into /tmp/CTLFireability14007155687830391242.gal : 2 ms
[2024-06-02 18:03:27] [INFO ] Time to serialize properties into /tmp/CTLFireability1668192073336935533.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/CTLFireability14007155687830391242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1668192073336935533.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,425921,0.017195,3640,2,145,5,781,6,0,227,590,0


Converting to forward existential form...Done !
original formula: EF(((!(E(!(AG(((p26==1)&&(p30==1)))) U ((p38==1)&&(p45==1)))) * ((p19==0)||(p25==0))) * ((p43==0)||(p57==0))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p43==0)||(p57==0))) * ((p19==0)||(p25==0))) * !(E(!(!(E(TRUE U !(((p26==1)&&(p30==1)))))...192
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
(forward)formula 0,1,0.091768,5804,1,0,98,9652,109,49,1401,8868,108
FORMULA MedleyA-PT-01-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:27] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
// Phase 1: matrix 52 rows 61 cols
[2024-06-02 18:03:27] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 18:03:27] [INFO ] Implicit Places using invariants in 129 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 60/61 places, 53/53 transitions.
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:27] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13748215288058429757.gal : 1 ms
[2024-06-02 18:03:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17649594117912745855.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/CTLFireability13748215288058429757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17649594117912745855.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.50099e+07,0.066337,4856,2,632,5,7013,6,0,292,7644,0


Converting to forward existential form...Done !
original formula: AX(AG((((p27==0)||(p57==0))||((p50==0)||(p53==0)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((((p27==0)||(p57==0))||((p50==0)||(p53==0)))))] = FALSE
(forward)formula 0,0,0.109851,5120,1,0,10,7292,10,2,596,7892,4
FORMULA MedleyA-PT-01-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 61 transition count 52
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 60 transition count 52
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 4 place count 59 transition count 51
Applied a total of 4 rules in 8 ms. Remains 59 /61 variables (removed 2) and now considering 51/53 (removed 2) transitions.
[2024-06-02 18:03:27] [INFO ] Flow matrix only has 50 transitions (discarded 1 similar events)
// Phase 1: matrix 50 rows 59 cols
[2024-06-02 18:03:27] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 18:03:27] [INFO ] Implicit Places using invariants in 66 ms returned [49, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/61 places, 51/53 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 56 transition count 50
Applied a total of 2 rules in 5 ms. Remains 56 /57 variables (removed 1) and now considering 50/51 (removed 1) transitions.
[2024-06-02 18:03:27] [INFO ] Flow matrix only has 49 transitions (discarded 1 similar events)
// Phase 1: matrix 49 rows 56 cols
[2024-06-02 18:03:27] [INFO ] Computed 18 invariants in 3 ms
[2024-06-02 18:03:27] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:03:27] [INFO ] Flow matrix only has 49 transitions (discarded 1 similar events)
[2024-06-02 18:03:27] [INFO ] Invariant cache hit.
[2024-06-02 18:03:27] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-02 18:03:27] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 56/61 places, 50/53 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 244 ms. Remains : 56/61 places, 50/53 transitions.
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:27] [INFO ] Input system was already deterministic with 50 transitions.
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:27] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2049458277945383040.gal : 1 ms
[2024-06-02 18:03:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4219055818258599186.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/CTLFireability2049458277945383040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4219055818258599186.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,7.51315e+06,0.032939,4568,2,464,5,4943,6,0,272,5331,0


Converting to forward existential form...Done !
original formula: EF(((AF(((p24==1)&&(p31==1))) * EG(((p23==1)&&(p53==1)))) * AF((((EF(((p1==1)&&(p12==1))) + (p52==1)) * ((p34==1)||((p27==1)&&(p57==1))))...194
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (!(EG(!(((p24==1)&&(p31==1))))) * EG(((p23==1)&&(p53==1))))) * !(EG(!((((E(TRUE U ((p1==1)&...264
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t13, t14, t15, t24, t32, t40, t47, t48, t49, Intersection with reachable at each...217
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.335781,14720,1,0,142,67963,141,75,1833,67167,158
FORMULA MedleyA-PT-01-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:28] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
// Phase 1: matrix 52 rows 61 cols
[2024-06-02 18:03:28] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:03:28] [INFO ] Implicit Places using invariants in 81 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 60/61 places, 53/53 transitions.
[2024-06-02 18:03:28] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:28] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:28] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:28] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:28] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:28] [INFO ] Time to serialize gal into /tmp/CTLFireability2517526799672539823.gal : 1 ms
[2024-06-02 18:03:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12598117863680762824.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/CTLFireability2517526799672539823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12598117863680762824.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.50099e+07,0.077954,4860,2,632,5,7013,6,0,292,7644,0


Converting to forward existential form...Done !
original formula: (EF(AG(((p26==1)&&(p32==1)))) * EX((AX(EF(((p19==1)&&(p25==1)))) + (((AG((((p18==0)||(p24==0))&&((p26==0)||(p32==0)))) * (((p20==1)&&(p21...307
=> equivalent forward existential formula: ([(EY((Init * E(TRUE U !(E(TRUE U !(((p26==1)&&(p32==1)))))))) * !(EX(!(E(TRUE U ((p19==1)&&(p25==1)))))))] != F...469
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
(forward)formula 0,0,0.849935,22504,1,0,164,108394,132,81,1893,101756,178
FORMULA MedleyA-PT-01-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:29] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:29] [INFO ] Invariant cache hit.
[2024-06-02 18:03:29] [INFO ] Implicit Places using invariants in 61 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 60/61 places, 53/53 transitions.
[2024-06-02 18:03:29] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:29] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:29] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:29] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:29] [INFO ] Time to serialize gal into /tmp/CTLFireability18172878585473485174.gal : 1 ms
[2024-06-02 18:03:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8535414868551960062.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/CTLFireability18172878585473485174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8535414868551960062.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.50099e+07,0.070361,5916,2,286,5,12943,6,0,291,13498,0


Converting to forward existential form...Done !
original formula: (!(E(A(((AX(((p20==1)&&(p21==1))) * (p27==1)) * ((p57==1)&&(!((p16==1)&&(p59==1))))) U ((AX(((p36==1)&&(p37==1))) * (p51==1)) * ((p54==1)...311
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(!((E(!(((!(EX(!(((p36==1)&&(p37==1))))) * (p51==1)) * ((p54==1)&&(!((p11==1)&&(p57==1))))))...650
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
(forward)formula 0,1,0.145813,6972,1,0,123,20905,125,57,1820,16710,118
FORMULA MedleyA-PT-01-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 61 transition count 52
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 60 transition count 52
Applied a total of 2 rules in 5 ms. Remains 60 /61 variables (removed 1) and now considering 52/53 (removed 1) transitions.
[2024-06-02 18:03:29] [INFO ] Flow matrix only has 51 transitions (discarded 1 similar events)
// Phase 1: matrix 51 rows 60 cols
[2024-06-02 18:03:29] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 18:03:29] [INFO ] Implicit Places using invariants in 79 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/61 places, 52/53 transitions.
Graph (trivial) has 7 edges and 58 vertex of which 2 / 58 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 55 transition count 48
Applied a total of 5 rules in 6 ms. Remains 55 /58 variables (removed 3) and now considering 48/52 (removed 4) transitions.
[2024-06-02 18:03:29] [INFO ] Flow matrix only has 47 transitions (discarded 1 similar events)
// Phase 1: matrix 47 rows 55 cols
[2024-06-02 18:03:29] [INFO ] Computed 18 invariants in 1 ms
[2024-06-02 18:03:29] [INFO ] Implicit Places using invariants in 96 ms returned [7, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 97 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/61 places, 48/53 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 52 transition count 47
Applied a total of 2 rules in 5 ms. Remains 52 /53 variables (removed 1) and now considering 47/48 (removed 1) transitions.
[2024-06-02 18:03:29] [INFO ] Flow matrix only has 46 transitions (discarded 1 similar events)
// Phase 1: matrix 46 rows 52 cols
[2024-06-02 18:03:29] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 18:03:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:03:29] [INFO ] Flow matrix only has 46 transitions (discarded 1 similar events)
[2024-06-02 18:03:29] [INFO ] Invariant cache hit.
[2024-06-02 18:03:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 18:03:29] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 52/61 places, 47/53 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 378 ms. Remains : 52/61 places, 47/53 transitions.
[2024-06-02 18:03:29] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:29] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:29] [INFO ] Input system was already deterministic with 47 transitions.
[2024-06-02 18:03:29] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:29] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:29] [INFO ] Time to serialize gal into /tmp/CTLFireability18162124453770895736.gal : 1 ms
[2024-06-02 18:03:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9048638466681031988.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/CTLFireability18162124453770895736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9048638466681031988.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.34534e+06,0.024043,3684,2,174,5,1596,6,0,253,1497,0


Converting to forward existential form...Done !
original formula: E(!(A(!(((p4==1)&&(p5==1))) U ((EG(((p42==1)&&(p46==1))) * (p26==1)) * ((p32==1)&&(!((p3==1)&&(p9==1))))))) U !(E(((p40==1)&&(p47==1)) U ...195
=> equivalent forward existential formula: [(FwdU(Init,!(!((E(!(((EG(((p42==1)&&(p46==1))) * (p26==1)) * ((p32==1)&&(!((p3==1)&&(p9==1)))))) U (!(!(((p4==1...495
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t11, t15, t16, Intersection with reachable at each step enabled. (destroyed/reve...186
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.17625,33976,1,0,340,148014,140,246,1631,252382,390
FORMULA MedleyA-PT-01-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:31] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
// Phase 1: matrix 52 rows 61 cols
[2024-06-02 18:03:31] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 18:03:31] [INFO ] Implicit Places using invariants in 76 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 59/61 places, 53/53 transitions.
[2024-06-02 18:03:31] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:31] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:31] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:31] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:31] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9606132943848435100.gal : 1 ms
[2024-06-02 18:03:31] [INFO ] Time to serialize properties into /tmp/CTLFireability305997100143991512.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/CTLFireability9606132943848435100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability305997100143991512.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((EG(((p42==1)&&(p48==1))) + ((p24==1)&&(p31==1))) * (AX(EX((((p17==1)&&(p28==1))&&(p59==1)))) + ((p27==1)&&(p57==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (EG(((p42==1)&&(p48==1))) + ((p24==1)&&(p31==1)))) * !(EX(!(EX((((p17==1)&&(p28==1))&&(p59...284
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
(forward)formula 0,1,0.098293,6956,1,0,132,20117,129,64,1801,16830,128
FORMULA MedleyA-PT-01-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:31] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:31] [INFO ] Invariant cache hit.
[2024-06-02 18:03:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 18:03:31] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:31] [INFO ] Invariant cache hit.
[2024-06-02 18:03:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 18:03:31] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-02 18:03:31] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:31] [INFO ] Invariant cache hit.
[2024-06-02 18:03:31] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:31] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
[2024-06-02 18:03:31] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-02 18:03:32] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 167 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2338 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:34] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:34] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:03:34] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 1/113 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (OVERLAPS) 0/113 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 222 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2714 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints]
After SMT, in 5073ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 5075ms
Finished structural reductions in LTL mode , in 1 iterations and 5263 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:36] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:36] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:36] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:36] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:36] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2358588243495518447.gal : 6 ms
[2024-06-02 18:03:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4144925944638590104.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/CTLFireability2358588243495518447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4144925944638590104.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.50099e+07,0.139077,6196,2,512,5,14109,6,0,294,15918,0


Converting to forward existential form...Done !
original formula: (AG((AX((EG(((p10==1)&&(p16==1))) + ((p42==1)&&(p48==1)))) * (((EX(((p10==0)||(p54==0))) * (((p48==0)||(p59==0))||((p34==0)||(p40==0)))) ...278
=> equivalent forward existential formula: ([((EY(FwdU((Init * !(EX(TRUE))),TRUE)) * !(((p42==1)&&(p48==1)))) * !(EG(((p10==1)&&(p16==1)))))] = FALSE * ([(...552
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
(forward)formula 0,1,0.471879,12268,1,0,141,52861,148,71,1886,49112,143
FORMULA MedleyA-PT-01-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:37] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:37] [INFO ] Invariant cache hit.
[2024-06-02 18:03:37] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:03:37] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:37] [INFO ] Invariant cache hit.
[2024-06-02 18:03:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 18:03:37] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-02 18:03:37] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:37] [INFO ] Invariant cache hit.
[2024-06-02 18:03:37] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:37] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:03:37] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:03:38] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 167 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2725 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:41] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:03:41] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 1/113 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (OVERLAPS) 0/113 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 222 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2952 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints]
After SMT, in 5704ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 5707ms
Finished structural reductions in LTL mode , in 1 iterations and 5981 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:42] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:42] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:43] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:43] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:43] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10804527411690622903.gal : 1 ms
[2024-06-02 18:03:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8331323860299987811.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/CTLFireability10804527411690622903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8331323860299987811.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.50099e+07,0.141392,6460,2,512,5,14109,6,0,294,15918,0


Converting to forward existential form...Done !
original formula: EF((AX((A(EX(((p50==1)&&(p53==1))) U A(((p43==1)&&(p57==1)) U ((p16==1)&&(p59==1)))) * (((p52==1)&&(p58==1))||((p33==1)&&(p44==1))))) + (...333
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!((!((E(!(!((E(!(((p16==1)&&(p59==1))) U (!(((p43==1)&&(p57==1))) * !(((p16==1)&&(p59=...1096
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.12271,27588,1,0,168,129723,159,91,2001,146960,196
FORMULA MedleyA-PT-01-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:44] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:44] [INFO ] Invariant cache hit.
[2024-06-02 18:03:44] [INFO ] Implicit Places using invariants in 127 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 130 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 59/61 places, 53/53 transitions.
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:44] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5449841439574888586.gal : 2 ms
[2024-06-02 18:03:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14722179917503132063.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/CTLFireability5449841439574888586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14722179917503132063.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.50099e+07,0.023363,4056,2,282,5,3193,6,0,289,3551,0


Converting to forward existential form...Done !
original formula: E(EF(AG(EX(!(((p36==1)&&(p37==1)))))) U ((p10==1)&&(p16==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(E(TRUE U !(EX(!(((p36==1)&&(p37==1))))))))) * ((p10==1)&&(p16==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
(forward)formula 0,1,0.104743,6960,1,0,121,19747,128,58,1873,17059,120
FORMULA MedleyA-PT-01-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:44] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:44] [INFO ] Invariant cache hit.
[2024-06-02 18:03:44] [INFO ] Implicit Places using invariants in 110 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 112 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 59/61 places, 53/53 transitions.
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:44] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:03:44] [INFO ] Time to serialize gal into /tmp/CTLFireability347145931466853770.gal : 1 ms
[2024-06-02 18:03:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4858439677192426816.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/CTLFireability347145931466853770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4858439677192426816.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AX(((p33==1)&&(p44==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((p33==1)&&(p44==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
(forward)formula 0,0,0.08368,5900,1,0,118,16366,121,55,1765,11343,111
FORMULA MedleyA-PT-01-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:44] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:44] [INFO ] Invariant cache hit.
[2024-06-02 18:03:44] [INFO ] Implicit Places using invariants in 66 ms returned [53, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 59/61 places, 53/53 transitions.
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:44] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:44] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17314263680871208648.gal : 1 ms
[2024-06-02 18:03:44] [INFO ] Time to serialize properties into /tmp/CTLFireability9513769962814114369.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/CTLFireability17314263680871208648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9513769962814114369.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.50099e+07,0.024306,4052,2,282,5,3193,6,0,289,3551,0


Converting to forward existential form...Done !
original formula: (EG(E((EF((p0==1)) + !((((p40==1)&&(p47==1)) + A((p18==1) U ((p43==1)&&(p57==1)))))) U ((p35==1)&&(p41==1)))) * AG((EX(!(E(((p22==1)&&(p2...205
=> equivalent forward existential formula: ([(Init * !(EG(E((E(TRUE U (p0==1)) + !((((p40==1)&&(p47==1)) + !((E(!(((p43==1)&&(p57==1))) U (!((p18==1)) * !(...359
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
(forward)formula 0,0,0.274075,11760,1,0,243,48733,125,122,1766,58910,238
FORMULA MedleyA-PT-01-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:45] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:45] [INFO ] Invariant cache hit.
[2024-06-02 18:03:45] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 18:03:45] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:45] [INFO ] Invariant cache hit.
[2024-06-02 18:03:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 18:03:45] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-02 18:03:45] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:45] [INFO ] Invariant cache hit.
[2024-06-02 18:03:45] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:45] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
[2024-06-02 18:03:45] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-02 18:03:45] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 167 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2392 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:48] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:48] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:03:48] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 1/113 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (OVERLAPS) 0/113 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 222 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2643 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints]
After SMT, in 5058ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 5060ms
Finished structural reductions in LTL mode , in 1 iterations and 5339 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:50] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:50] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:50] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:50] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:50] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15452203265302845022.gal : 1 ms
[2024-06-02 18:03:50] [INFO ] Time to serialize properties into /tmp/CTLFireability5033308678684029613.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/CTLFireability15452203265302845022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5033308678684029613.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.50099e+07,0.086538,6200,2,512,5,14109,6,0,294,15918,0


Converting to forward existential form...Done !
original formula: AG(A(EX(A(!(((p26==1)&&(p32==1))) U (((p51==1)&&(p54==1))&&((p2==1)&&(p8==1))))) U !((AF(AG(((p50==1)&&(p56==1)))) + AG(((p50==1)&&(p53==...163
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(!((!(EG(!(!(E(TRUE U !(((p50==1)&&(p56==1)))))))) + !(E(TRUE U !(((p50==1)&&(p53==1)...912
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t10, t11, t12, t18, t20, t21, t22, t32, t40, t48, Intersection with reachable at...222
(forward)formula 0,0,0.350727,13328,1,0,136,55694,135,68,1914,52903,150
FORMULA MedleyA-PT-01-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 18:03:50] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:03:50] [INFO ] Flatten gal took : 3 ms
Total runtime 37409 ms.

BK_STOP 1717351430817

--------------------
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="MedleyA-PT-01"
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 MedleyA-PT-01, 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 r576-smll-171734919800002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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