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.r180-tall-171640602600066.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 FlexibleBarrier-PT-12a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602600066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 09:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 09:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 09:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 128K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716420393132

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 23:26:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:26:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:26:34] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-22 23:26:34] [INFO ] Transformed 147 places.
[2024-05-22 23:26:34] [INFO ] Transformed 448 transitions.
[2024-05-22 23:26:34] [INFO ] Found NUPN structural information;
[2024-05-22 23:26:34] [INFO ] Parsed PT model containing 147 places and 448 transitions and 2045 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 326/326 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 147 transition count 314
Applied a total of 12 rules in 31 ms. Remains 147 /147 variables (removed 0) and now considering 314/326 (removed 12) transitions.
// Phase 1: matrix 314 rows 147 cols
[2024-05-22 23:26:34] [INFO ] Computed 14 invariants in 18 ms
[2024-05-22 23:26:34] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-22 23:26:34] [INFO ] Invariant cache hit.
[2024-05-22 23:26:35] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-05-22 23:26:35] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-05-22 23:26:35] [INFO ] Invariant cache hit.
[2024-05-22 23:26:35] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 501 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10993 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 313/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 814 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10157 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
After SMT, in 21371ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 21395ms
Starting structural reductions in LTL mode, iteration 1 : 147/147 places, 314/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21965 ms. Remains : 147/147 places, 314/326 transitions.
Support contains 56 out of 147 places after structural reductions.
[2024-05-22 23:26:56] [INFO ] Flatten gal took : 46 ms
[2024-05-22 23:26:56] [INFO ] Flatten gal took : 23 ms
[2024-05-22 23:26:56] [INFO ] Input system was already deterministic with 314 transitions.
Reduction of identical properties reduced properties to check from 63 to 61
RANDOM walk for 40000 steps (8 resets) in 1399 ms. (28 steps per ms) remains 3/61 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/2 properties
[2024-05-22 23:26:57] [INFO ] Invariant cache hit.
[2024-05-22 23:26:57] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp31 is UNSAT
After SMT solving in domain Real declared 13/461 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Domain max(s): 2/147 constraints, Positive P Invariants (semi-flows): 1/14 constraints, State Equation: 0/147 constraints, ReadFeed: 0/193 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-22 23:26:57] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:26:57] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:26:57] [INFO ] Input system was already deterministic with 314 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:26:57] [INFO ] Invariant cache hit.
[2024-05-22 23:26:57] [INFO ] Implicit Places using invariants in 120 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 146/147 places, 314/314 transitions.
[2024-05-22 23:26:57] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:26:57] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:26:57] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:26:57] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:26:57] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:26:57] [INFO ] Time to serialize gal into /tmp/CTLFireability16276062596091098443.gal : 6 ms
[2024-05-22 23:26:57] [INFO ] Time to serialize properties into /tmp/CTLFireability3593273181391401305.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/CTLFireability16276062596091098443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3593273181391401305.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,8.9161e+12,1.42492,49840,2,6456,5,333491,6,0,898,133893,0


Converting to forward existential form...Done !
original formula: EF(AX(AG(((p74==1)&&(p146==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(((p74==1)&&(p146==1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,3.4903,86764,1,0,6,552199,15,0,4315,133893,5
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 110 edges and 147 vertex of which 27 / 147 are part of one of the 9 SCC in 6 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 119 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 100 place count 119 transition count 179
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 119 transition count 179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 118 transition count 178
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 118 transition count 178
Applied a total of 104 rules in 66 ms. Remains 118 /147 variables (removed 29) and now considering 178/314 (removed 136) transitions.
[2024-05-22 23:27:01] [INFO ] Flow matrix only has 162 transitions (discarded 16 similar events)
// Phase 1: matrix 162 rows 118 cols
[2024-05-22 23:27:01] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 23:27:01] [INFO ] Implicit Places using invariants in 95 ms returned [117]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 117/147 places, 178/314 transitions.
Graph (trivial) has 141 edges and 117 vertex of which 46 / 117 are part of one of the 11 SCC in 0 ms
Free SCC test removed 35 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 82 transition count 113
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 68 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 67 transition count 112
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 31 place count 67 transition count 100
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 55 place count 55 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 54 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 54 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 65 place count 54 transition count 91
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 46 transition count 83
Applied a total of 81 rules in 13 ms. Remains 46 /117 variables (removed 71) and now considering 83/178 (removed 95) transitions.
[2024-05-22 23:27:01] [INFO ] Flow matrix only has 64 transitions (discarded 19 similar events)
// Phase 1: matrix 64 rows 46 cols
[2024-05-22 23:27:01] [INFO ] Computed 13 invariants in 0 ms
[2024-05-22 23:27:01] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 23:27:01] [INFO ] Flow matrix only has 64 transitions (discarded 19 similar events)
[2024-05-22 23:27:01] [INFO ] Invariant cache hit.
[2024-05-22 23:27:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 23:27:01] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/147 places, 83/314 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 251 ms. Remains : 46/147 places, 83/314 transitions.
[2024-05-22 23:27:01] [INFO ] Flatten gal took : 3 ms
[2024-05-22 23:27:01] [INFO ] Flatten gal took : 3 ms
[2024-05-22 23:27:01] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-22 23:27:01] [INFO ] Flatten gal took : 3 ms
[2024-05-22 23:27:01] [INFO ] Flatten gal took : 2 ms
[2024-05-22 23:27:01] [INFO ] Time to serialize gal into /tmp/CTLFireability3030844289615681815.gal : 1 ms
[2024-05-22 23:27:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13787579036181342800.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/CTLFireability3030844289615681815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13787579036181342800.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,614657,0.01289,3840,2,210,5,1634,6,0,254,1275,0


Converting to forward existential form...Done !
original formula: AG((((p111==1) + EF((p46==1))) + AF((((p23==0)||(p132==0))||(p145==0)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(((p111==1) + E(TRUE U (p46==1))))),!((((p23==0)||(p132==0))||(p145==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.033881,4684,1,0,9,6943,25,1,1258,2591,10
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 147 cols
[2024-05-22 23:27:01] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:27:01] [INFO ] Implicit Places using invariants in 84 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 146/147 places, 314/314 transitions.
[2024-05-22 23:27:01] [INFO ] Flatten gal took : 21 ms
[2024-05-22 23:27:01] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:27:01] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:27:01] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:27:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:27:01] [INFO ] Time to serialize gal into /tmp/CTLFireability6138846547064335616.gal : 3 ms
[2024-05-22 23:27:01] [INFO ] Time to serialize properties into /tmp/CTLFireability18423300462137591016.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/CTLFireability6138846547064335616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18423300462137591016.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,8.9161e+12,0.685309,29056,2,4945,5,144298,6,0,898,87635,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(E((((p24==1)&&(p95==1))&&((p145==1)&&(p101==1))) U ((((p48==1)&&(p71==1))&&((p145==1)&&(p36==1)))&&(p107==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(E((((p24==1)&&(p95==1))&&((p145==1)&&(p101==1))) U ((((p48==1)&&(p71==1))&...206
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 173/379/141
(forward)formula 0,0,1.71678,52352,1,0,8,325123,20,1,4505,87635,7
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:27:03] [INFO ] Invariant cache hit.
[2024-05-22 23:27:03] [INFO ] Implicit Places using invariants in 97 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 146/147 places, 314/314 transitions.
[2024-05-22 23:27:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:27:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:27:03] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:27:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:27:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:27:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13683131012032779347.gal : 2 ms
[2024-05-22 23:27:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12353857281529309479.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/CTLFireability13683131012032779347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12353857281529309479.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,8.9161e+12,0.644333,28808,2,4945,5,144298,6,0,898,87635,0


Converting to forward existential form...Done !
original formula: (AG((EX((((p119==0)||(p132==0))||(p145==0))) + (((((p12==0)||(p47==0))||((p145==0)||(p95==0)))||((p132==0)||(p145==0)))&&(((p12==0)||(p13...196
=> equivalent forward existential formula: [(EY(FwdU((Init * !(!(E(TRUE U !((EX((((p119==0)||(p132==0))||(p145==0))) + (((((p12==0)||(p47==0))||((p145==0)|...265
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.64036,51688,1,0,10,318695,16,2,4293,87635,6
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:27:05] [INFO ] Invariant cache hit.
[2024-05-22 23:27:05] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 23:27:05] [INFO ] Invariant cache hit.
[2024-05-22 23:27:05] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-05-22 23:27:05] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-05-22 23:27:05] [INFO ] Invariant cache hit.
[2024-05-22 23:27:05] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 501 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10407 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 313/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 814 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10040 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
After SMT, in 20585ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 20590ms
Finished structural reductions in LTL mode , in 1 iterations and 20832 ms. Remains : 147/147 places, 314/314 transitions.
[2024-05-22 23:27:26] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:27:26] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:27:26] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:27:26] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:27:26] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:27:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12286261493249810871.gal : 2 ms
[2024-05-22 23:27:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6300171930963867115.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/CTLFireability12286261493249810871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6300171930963867115.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,8.9161e+12,2.22717,68764,2,4613,5,358941,6,0,900,219239,0


Converting to forward existential form...Done !
original formula: (E((p116==1) U ((E((((((p23==1)&&(p48==1))&&((p145==1)&&(p4==1)))&&(p146==1))||((((p11==1)&&(p120==1))&&((p145==1)&&(p108==1)))&&((p131==...745
=> equivalent forward existential formula: (([((FwdU(Init,(p116==1)) * E((((((p23==1)&&(p48==1))&&((p145==1)&&(p4==1)))&&(p146==1))||((((p11==1)&&(p120==1)...918
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 105/0/209
Hit Full ! (commute/partial/dont) 311/0/3
(forward)formula 0,1,22.1513,601084,1,0,304,3.19368e+06,49,201,5128,3.3756e+06,317
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:27:48] [INFO ] Invariant cache hit.
[2024-05-22 23:27:48] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 23:27:48] [INFO ] Invariant cache hit.
[2024-05-22 23:27:49] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-05-22 23:27:49] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-05-22 23:27:49] [INFO ] Invariant cache hit.
[2024-05-22 23:27:49] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 501 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10465 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 313/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 814 constraints, problems are : Problem set: 0 solved, 313 unsolved in 9963 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
After SMT, in 20604ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 20607ms
Finished structural reductions in LTL mode , in 1 iterations and 20941 ms. Remains : 147/147 places, 314/314 transitions.
[2024-05-22 23:28:09] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:28:09] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:28:09] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:28:09] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:28:09] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:28:09] [INFO ] Time to serialize gal into /tmp/CTLFireability7649742939436322276.gal : 2 ms
[2024-05-22 23:28:09] [INFO ] Time to serialize properties into /tmp/CTLFireability397383980581644130.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/CTLFireability7649742939436322276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability397383980581644130.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,8.9161e+12,2.29087,69680,2,4613,5,358941,6,0,900,219239,0


Converting to forward existential form...Done !
original formula: (EG((p15==1)) + (EG(AX((EF((((p48==0)||(p143==0))||(p145==0))) * EX((((p23==0)||(p72==0))||(p145==0)))))) * EF((((E(E(((p19==1)&&(p146==1...331
=> equivalent forward existential formula: ([FwdG(Init,(p15==1))] != FALSE + ([(FwdU(((FwdU((Init * EG(!(EX(!((E(TRUE U (((p48==0)||(p143==0))||(p145==0)))...551
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 251/62/63
(forward)formula 0,1,9.53985,251804,1,0,65,1.38493e+06,41,39,5539,1.10117e+06,72
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:28:19] [INFO ] Invariant cache hit.
[2024-05-22 23:28:19] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-22 23:28:19] [INFO ] Invariant cache hit.
[2024-05-22 23:28:19] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-05-22 23:28:19] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-05-22 23:28:19] [INFO ] Invariant cache hit.
[2024-05-22 23:28:19] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 501 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10411 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 313/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 814 constraints, problems are : Problem set: 0 solved, 313 unsolved in 9726 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
After SMT, in 20265ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 20268ms
Finished structural reductions in LTL mode , in 1 iterations and 20670 ms. Remains : 147/147 places, 314/314 transitions.
[2024-05-22 23:28:40] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:28:40] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:28:40] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:28:40] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:28:40] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:28:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11495653504730323423.gal : 2 ms
[2024-05-22 23:28:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3564211968897045591.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/CTLFireability11495653504730323423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3564211968897045591.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,8.9161e+12,2.2483,69688,2,4613,5,358941,6,0,900,219239,0


Converting to forward existential form...Done !
original formula: (E(EF(((((p24==1)&&(p35==1))&&(p145==1)) + AX((((p12==1)&&(p35==1))&&(p145==1))))) U AG((((p12==1)&&(p119==1))&&(p145==1)))) + AF(AX(AG((...179
=> equivalent forward existential formula: [FwdG((Init * !(E(E(TRUE U ((((p24==1)&&(p35==1))&&(p145==1)) + !(EX(!((((p12==1)&&(p35==1))&&(p145==1))))))) U ...269
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,6.51901,165756,1,0,10,1.0671e+06,24,1,5243,390271,19
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:28:46] [INFO ] Invariant cache hit.
[2024-05-22 23:28:46] [INFO ] Implicit Places using invariants in 128 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 146/147 places, 314/314 transitions.
[2024-05-22 23:28:46] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:28:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:28:46] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:28:47] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:28:47] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:28:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9222971819802595886.gal : 2 ms
[2024-05-22 23:28:47] [INFO ] Time to serialize properties into /tmp/CTLFireability1772580538366950652.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/CTLFireability9222971819802595886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1772580538366950652.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,8.9161e+12,0.66607,28864,2,4945,5,144298,6,0,898,87635,0


Converting to forward existential form...Done !
original formula: AG(((AX(EX(((((p48==0)||(p59==0))||((p145==0)||(p36==0)))||((p119==0)||(p145==0))))) + (p12==0)) + ((p35==0)||(p145==0))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !(((p35==0)||(p145==0)))) * !((p12==0)))) * !(EX(((((p48==0)||(p59==0))||((p145==0)||(p...200
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.69843,50772,1,0,6,320365,10,0,4283,87635,4
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:28:48] [INFO ] Invariant cache hit.
[2024-05-22 23:28:48] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 23:28:48] [INFO ] Invariant cache hit.
[2024-05-22 23:28:48] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-05-22 23:28:49] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-05-22 23:28:49] [INFO ] Invariant cache hit.
[2024-05-22 23:28:49] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 501 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10273 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 313/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 814 constraints, problems are : Problem set: 0 solved, 313 unsolved in 9549 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
After SMT, in 19989ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 19992ms
Finished structural reductions in LTL mode , in 1 iterations and 20272 ms. Remains : 147/147 places, 314/314 transitions.
[2024-05-22 23:29:09] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:29:09] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:29:09] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:29:09] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:29:09] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:29:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3009846586929712162.gal : 14 ms
[2024-05-22 23:29:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13404951115020663572.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/CTLFireability3009846586929712162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13404951115020663572.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,8.9161e+12,2.06392,68968,2,4613,5,358941,6,0,900,219239,0


Converting to forward existential form...Done !
original formula: AF(((((p12==0)||(p59==0))||(p145==0)) * (AG((((p113==1)&&(p146==1))||(p49==0))) + EX(((((p12==1)&&(p143==1))&&((p145==1)&&(p64==1)))&&(p1...166
=> equivalent forward existential formula: [FwdG(Init,!(((((p12==0)||(p59==0))||(p145==0)) * (!(E(TRUE U !((((p113==1)&&(p146==1))||(p49==0))))) + EX(((((p...223
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,25.4601,673180,1,0,294,3.38466e+06,23,198,5034,3.88762e+06,209
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 103 edges and 147 vertex of which 18 / 147 are part of one of the 6 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 126 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 0 with 81 rules applied. Total rules applied 100 place count 126 transition count 197
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 103 place count 126 transition count 197
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 106 place count 123 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 109 place count 123 transition count 194
Applied a total of 109 rules in 50 ms. Remains 123 /147 variables (removed 24) and now considering 194/314 (removed 120) transitions.
[2024-05-22 23:29:34] [INFO ] Flow matrix only has 189 transitions (discarded 5 similar events)
// Phase 1: matrix 189 rows 123 cols
[2024-05-22 23:29:34] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:29:34] [INFO ] Implicit Places using invariants in 87 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 122/147 places, 194/314 transitions.
Graph (trivial) has 141 edges and 122 vertex of which 37 / 122 are part of one of the 11 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 96 transition count 139
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 77 transition count 139
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 39 place count 77 transition count 127
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 63 place count 65 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 65 transition count 122
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 60 transition count 117
Applied a total of 78 rules in 11 ms. Remains 60 /122 variables (removed 62) and now considering 117/194 (removed 77) transitions.
[2024-05-22 23:29:34] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
// Phase 1: matrix 106 rows 60 cols
[2024-05-22 23:29:34] [INFO ] Computed 13 invariants in 0 ms
[2024-05-22 23:29:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 23:29:34] [INFO ] Flow matrix only has 106 transitions (discarded 11 similar events)
[2024-05-22 23:29:34] [INFO ] Invariant cache hit.
[2024-05-22 23:29:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 23:29:34] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 60/147 places, 117/314 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 260 ms. Remains : 60/147 places, 117/314 transitions.
[2024-05-22 23:29:34] [INFO ] Flatten gal took : 3 ms
[2024-05-22 23:29:35] [INFO ] Flatten gal took : 2 ms
[2024-05-22 23:29:35] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-22 23:29:35] [INFO ] Flatten gal took : 2 ms
[2024-05-22 23:29:35] [INFO ] Flatten gal took : 2 ms
[2024-05-22 23:29:35] [INFO ] Time to serialize gal into /tmp/CTLFireability8097563649158059695.gal : 1 ms
[2024-05-22 23:29:35] [INFO ] Time to serialize properties into /tmp/CTLFireability5139797171972872398.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/CTLFireability8097563649158059695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5139797171972872398.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,2.25886e+07,0.037055,4868,2,562,5,6775,6,0,345,5137,0


Converting to forward existential form...Done !
original formula: A((((p36==1)&&(p47==1))&&(p145==1)) U A(EG((((p24==1)&&(p95==1))&&(p145==1))) U EG(E(!((((p120==1)&&(p143==1))&&(p145==1))) U EG((p61==1)...160
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(EG(E(!((((p120==1)&&(p143==1))&&(p145==1))) U EG((p61==1))))) U (!(EG((((p24==1)&&(p95==...890
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 75/0/42
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,0.173058,10412,1,0,20,41573,43,11,1934,20427,23
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 147 cols
[2024-05-22 23:29:35] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:29:35] [INFO ] Implicit Places using invariants in 264 ms returned [145, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 265 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 268 ms. Remains : 145/147 places, 314/314 transitions.
[2024-05-22 23:29:35] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:29:35] [INFO ] Flatten gal took : 22 ms
[2024-05-22 23:29:35] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:29:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:29:35] [INFO ] Flatten gal took : 21 ms
[2024-05-22 23:29:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7494256884035761520.gal : 1 ms
[2024-05-22 23:29:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4739966597906101294.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/CTLFireability7494256884035761520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4739966597906101294.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,8.9161e+12,0.293283,9244,2,3496,5,31644,6,0,896,19345,0


Converting to forward existential form...Done !
original formula: EX(EG(EF((p121==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(TRUE U (p121==1)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.30089,45348,1,0,8,264707,18,1,4697,47816,12
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:29:36] [INFO ] Invariant cache hit.
[2024-05-22 23:29:37] [INFO ] Implicit Places using invariants in 214 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 218 ms. Remains : 146/147 places, 314/314 transitions.
[2024-05-22 23:29:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:29:37] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:29:37] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:29:37] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:29:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:29:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13074937003995069559.gal : 3 ms
[2024-05-22 23:29:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6565460492877150403.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/CTLFireability13074937003995069559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6565460492877150403.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,8.9161e+12,0.716809,29224,2,4945,5,144298,6,0,898,87635,0


Converting to forward existential form...Done !
original formula: AG(((EX((AF((((p24==1)&&(p119==1))&&(p145==1))) + EG((((p12==0)||(p47==0))||(p145==0))))) + (p130==1)) + ((((p23==0)||(p96==0))||(p145==0...196
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((((p23==0)||(p96==0))||(p145==0))&&(((p95==0)||(p108==0))||(p145==0))))) * !((p130==1))...262
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,2.00152,61700,1,0,10,377365,26,2,4629,117464,10
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 80 edges and 147 vertex of which 3 / 147 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 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 142 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 18 place count 142 transition count 298
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 27 place count 142 transition count 298
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 36 place count 133 transition count 289
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 133 transition count 289
Applied a total of 45 rules in 28 ms. Remains 133 /147 variables (removed 14) and now considering 289/314 (removed 25) transitions.
// Phase 1: matrix 289 rows 133 cols
[2024-05-22 23:29:39] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:29:39] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 23:29:39] [INFO ] Invariant cache hit.
[2024-05-22 23:29:39] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-05-22 23:29:39] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-22 23:29:39] [INFO ] Redundant transitions in 12 ms returned []
Running 288 sub problems to find dead transitions.
[2024-05-22 23:29:39] [INFO ] Invariant cache hit.
[2024-05-22 23:29:39] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 288/421 variables, 133/147 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 182/329 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 1/422 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 330 constraints, problems are : Problem set: 0 solved, 288 unsolved in 11075 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 133/133 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 288/421 variables, 133/147 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 182/329 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 288/617 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/422 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 0/422 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 618 constraints, problems are : Problem set: 0 solved, 288 unsolved in 10792 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 133/133 constraints, ReadFeed: 183/183 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 22022ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 22035ms
Starting structural reductions in SI_CTL mode, iteration 1 : 133/147 places, 289/314 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22405 ms. Remains : 133/147 places, 289/314 transitions.
[2024-05-22 23:30:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:30:01] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:30:01] [INFO ] Input system was already deterministic with 289 transitions.
[2024-05-22 23:30:01] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:30:01] [INFO ] Flatten gal took : 12 ms
[2024-05-22 23:30:01] [INFO ] Time to serialize gal into /tmp/CTLFireability4147705203145235056.gal : 1 ms
[2024-05-22 23:30:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4719207200894366277.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/CTLFireability4147705203145235056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4719207200894366277.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,2.56781e+12,1.44886,53560,2,3965,5,280989,6,0,818,163259,0


Converting to forward existential form...Done !
original formula: (AG((((p23==0)||(p36==0))||(p145==0))) + A((((p11==1)&&(p96==1))&&((p145==1)&&(!(((p83==1)&&(p132==1))&&(p145==1))))) U (E((A(((p88==1)&&...494
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!((E((!((E(!((((p23==1)&&(p108==1))&&(p145==1))) U (!(((p88==1)&&(p146==1))) * !((((p23==1...1972
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 161/0/128
Hit Full ! (commute/partial/dont) 159/0/130
Using saturation style SCC detection
(forward)formula 0,0,14.0914,420896,1,0,149,2.55758e+06,60,97,5225,2.02489e+06,114
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 147 cols
[2024-05-22 23:30:15] [INFO ] Computed 14 invariants in 3 ms
[2024-05-22 23:30:15] [INFO ] Implicit Places using invariants in 78 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 146/147 places, 314/314 transitions.
[2024-05-22 23:30:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:30:15] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:30:15] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:30:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 23:30:15] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:30:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15488550230099290934.gal : 1 ms
[2024-05-22 23:30:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5919397709112669282.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/CTLFireability15488550230099290934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5919397709112669282.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,8.9161e+12,0.628162,28892,2,4945,5,144298,6,0,898,87635,0


Converting to forward existential form...Done !
original formula: AX(EG((((AF(AX((p10==1))) * EF((((p12==0)||(p143==0))||(p145==0)))) * (AF((((p36==1)&&(p119==1))&&(p145==1))) * (p96==1))) * ((p119==1)&&...168
=> equivalent forward existential formula: [(EY(Init) * !(EG((((!(EG(!(!(EX(!((p10==1))))))) * E(TRUE U (((p12==0)||(p143==0))||(p145==0)))) * (!(EG(!((((p...239
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.04087,65992,1,0,14,407741,34,3,4875,127504,16
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:30:18] [INFO ] Invariant cache hit.
[2024-05-22 23:30:18] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 23:30:18] [INFO ] Invariant cache hit.
[2024-05-22 23:30:18] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-05-22 23:30:18] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-05-22 23:30:18] [INFO ] Invariant cache hit.
[2024-05-22 23:30:18] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 501 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10247 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 313/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 814 constraints, problems are : Problem set: 0 solved, 313 unsolved in 9484 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
After SMT, in 19898ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 19902ms
Finished structural reductions in LTL mode , in 1 iterations and 20212 ms. Remains : 147/147 places, 314/314 transitions.
[2024-05-22 23:30:38] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:30:38] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:30:38] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:30:38] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:30:38] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:30:38] [INFO ] Time to serialize gal into /tmp/CTLFireability5484053136013013491.gal : 2 ms
[2024-05-22 23:30:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7859373846210766590.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/CTLFireability5484053136013013491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7859373846210766590.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,8.9161e+12,2.05022,68756,2,4613,5,358941,6,0,900,219239,0


Converting to forward existential form...Done !
original formula: AF(EX(!(E((((((p23==1)&&(p132==1))&&((p145==1)&&(p12==1)))&&(((p83==1)&&(p145==1))&&((p33==1)&&(p146==1))))&&(((p72==1)&&(p119==1))&&(p14...206
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E((((((p23==1)&&(p132==1))&&((p145==1)&&(p12==1)))&&(((p83==1)&&(p145==1))&&((p33==1)&&(p146==...257
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 104/1549/210
(forward)formula 0,0,5.56297,140236,1,0,8,862686,25,1,5820,332597,14
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-22 23:30:43] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:30:43] [INFO ] Flatten gal took : 6 ms
Total runtime 249665 ms.

BK_STOP 1716420643990

--------------------
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="FlexibleBarrier-PT-12a"
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 FlexibleBarrier-PT-12a, 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 r180-tall-171640602600066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12a.tgz
mv FlexibleBarrier-PT-12a 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 ;