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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.6K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 11:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 11:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 10:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 10:51 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 214K 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-16a-CTLFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2023-12
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2023-13
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2023-14
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716424852158

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-16a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-23 00:40:53] [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-23 00:40:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:40:53] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-23 00:40:53] [INFO ] Transformed 195 places.
[2024-05-23 00:40:53] [INFO ] Transformed 724 transitions.
[2024-05-23 00:40:53] [INFO ] Found NUPN structural information;
[2024-05-23 00:40:53] [INFO ] Parsed PT model containing 195 places and 724 transitions and 3489 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 226 transitions
Reduce redundant transitions removed 226 transitions.
Support contains 61 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 498/498 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 195 transition count 482
Applied a total of 16 rules in 33 ms. Remains 195 /195 variables (removed 0) and now considering 482/498 (removed 16) transitions.
// Phase 1: matrix 482 rows 195 cols
[2024-05-23 00:40:53] [INFO ] Computed 18 invariants in 19 ms
[2024-05-23 00:40:53] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-23 00:40:54] [INFO ] Invariant cache hit.
[2024-05-23 00:40:54] [INFO ] State equation strengthened by 321 read => feed constraints.
[2024-05-23 00:40:54] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-23 00:40:54] [INFO ] Invariant cache hit.
[2024-05-23 00:40:54] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 729 constraints, problems are : Problem set: 0 solved, 481 unsolved in 22405 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 481/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (OVERLAPS) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 481 unsolved in 21204 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 44045ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 44068ms
Starting structural reductions in LTL mode, iteration 1 : 195/195 places, 482/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44796 ms. Remains : 195/195 places, 482/498 transitions.
Support contains 61 out of 195 places after structural reductions.
[2024-05-23 00:41:38] [INFO ] Flatten gal took : 74 ms
[2024-05-23 00:41:38] [INFO ] Flatten gal took : 31 ms
[2024-05-23 00:41:38] [INFO ] Input system was already deterministic with 482 transitions.
Support contains 60 out of 195 places (down from 61) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 70 to 67
RANDOM walk for 40000 steps (8 resets) in 1532 ms. (26 steps per ms) remains 1/67 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
[2024-05-23 00:41:39] [INFO ] Invariant cache hit.
[2024-05-23 00:41:39] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 26/677 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Domain max(s): 4/195 constraints, Positive P Invariants (semi-flows): 3/18 constraints, State Equation: 0/195 constraints, ReadFeed: 0/321 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-23 00:41:39] [INFO ] Flatten gal took : 22 ms
[2024-05-23 00:41:39] [INFO ] Flatten gal took : 23 ms
[2024-05-23 00:41:39] [INFO ] Input system was already deterministic with 482 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 158 edges and 195 vertex of which 48 / 195 are part of one of the 16 SCC in 3 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 221 edges and 160 vertex of which 155 / 160 are part of one of the 17 SCC in 0 ms
Free SCC test removed 138 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 22 transition count 343
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 332 transitions
Reduce isomorphic transitions removed 332 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 353 place count 6 transition count 11
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 354 place count 5 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 355 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 357 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 358 place count 4 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 360 place count 4 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 361 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 362 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 362 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 364 place count 2 transition count 3
Applied a total of 364 rules in 25 ms. Remains 2 /195 variables (removed 193) and now considering 3/482 (removed 479) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-23 00:41:39] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 00:41:39] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-23 00:41:39] [INFO ] Invariant cache hit.
[2024-05-23 00:41:39] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-23 00:41:39] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-23 00:41:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 338ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/195 places, 3/482 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 406 ms. Remains : 2/195 places, 3/482 transitions.
[2024-05-23 00:41:39] [INFO ] Flatten gal took : 0 ms
[2024-05-23 00:41:39] [INFO ] Flatten gal took : 0 ms
[2024-05-23 00:41:39] [INFO ] Input system was already deterministic with 3 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 00:41:39] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:41:39] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:41:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1738598371998246931.gal : 1 ms
[2024-05-23 00:41:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8159693553663414084.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1738598371998246931.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8159693553663414084.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 134 edges and 195 vertex of which 21 / 195 are part of one of the 7 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 170 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 0 with 133 rules applied. Total rules applied 156 place count 170 transition count 303
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 161 place count 170 transition count 303
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 166 place count 165 transition count 298
Iterating global reduction 0 with 5 rules applied. Total rules applied 171 place count 165 transition count 298
Applied a total of 171 rules in 69 ms. Remains 165 /195 variables (removed 30) and now considering 298/482 (removed 184) transitions.
[2024-05-23 00:41:40] [INFO ] Flow matrix only has 286 transitions (discarded 12 similar events)
// Phase 1: matrix 286 rows 165 cols
[2024-05-23 00:41:40] [INFO ] Computed 18 invariants in 13 ms
[2024-05-23 00:41:40] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-23 00:41:40] [INFO ] Flow matrix only has 286 transitions (discarded 12 similar events)
[2024-05-23 00:41:40] [INFO ] Invariant cache hit.
[2024-05-23 00:41:40] [INFO ] State equation strengthened by 162 read => feed constraints.
[2024-05-23 00:41:40] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-23 00:41:40] [INFO ] Redundant transitions in 15 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-23 00:41:40] [INFO ] Flow matrix only has 286 transitions (discarded 12 similar events)
[2024-05-23 00:41:40] [INFO ] Invariant cache hit.
[2024-05-23 00:41:40] [INFO ] State equation strengthened by 162 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 285/450 variables, 165/183 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 161/344 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 1/451 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 0/451 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 345 constraints, problems are : Problem set: 0 solved, 297 unsolved in 13064 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 165/165 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 285/450 variables, 165/183 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 161/344 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 297/641 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 1/451 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 0/451 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 642 constraints, problems are : Problem set: 0 solved, 297 unsolved in 12539 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 165/165 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
After SMT, in 25688ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 25692ms
Starting structural reductions in SI_CTL mode, iteration 1 : 165/195 places, 298/482 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26088 ms. Remains : 165/195 places, 298/482 transitions.
[2024-05-23 00:42:06] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:42:06] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:42:06] [INFO ] Input system was already deterministic with 298 transitions.
[2024-05-23 00:42:06] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:42:06] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:42:06] [INFO ] Time to serialize gal into /tmp/CTLFireability665833910512511215.gal : 8 ms
[2024-05-23 00:42:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5060094273877428166.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability665833910512511215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5060094273877428166.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1278e+16,3.87511,117928,2,8062,5,651627,6,0,949,401455,0


Converting to forward existential form...Done !
original formula: AG(((EF(((((p36==1)&&(p191==1))&&((p193==1)&&(((p48==0)||(p119==0))||(p193==0))))&&(p37==0))) + AG((((p132==1)&&(p167==1))&&(p193==1)))) ...348
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((E(E(TRUE U (((p172==1)&&(p194==1))||(((p48==1)&&(p59==1))&&(p193==1)))) U E(!((((p...427
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,6.79647,145308,1,0,8,1.0261e+06,16,1,4627,401455,6
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 5 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2024-05-23 00:42:13] [INFO ] Computed 18 invariants in 4 ms
[2024-05-23 00:42:13] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-23 00:42:13] [INFO ] Invariant cache hit.
[2024-05-23 00:42:13] [INFO ] State equation strengthened by 321 read => feed constraints.
[2024-05-23 00:42:13] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-23 00:42:13] [INFO ] Invariant cache hit.
[2024-05-23 00:42:13] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 729 constraints, problems are : Problem set: 0 solved, 481 unsolved in 21330 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 481/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (OVERLAPS) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 481 unsolved in 21007 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 42587ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 42594ms
Finished structural reductions in LTL mode , in 1 iterations and 42977 ms. Remains : 195/195 places, 482/482 transitions.
[2024-05-23 00:42:56] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:42:56] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:42:56] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-23 00:42:56] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:42:56] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:42:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16283723793184406671.gal : 3 ms
[2024-05-23 00:42:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15919190156705290084.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/CTLFireability16283723793184406671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15919190156705290084.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,11.7299,336992,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: A(E((EX((p37==1)) + A(((p143==1)||(!((p17==1)&&(p194==1)))) U AX((((p72==1)&&(p119==1))&&(p193==1))))) U (((p35==1)&&(p120==1))&&(p193==1...315
=> equivalent forward existential formula: [((Init * !(EG(!((EG((!((E(!(EG((((p35==1)&&(p120==1))&&(p193==1)))) U (!(((((p47==1)&&(p180==1))&&(p193==1))||(...1172
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-23 00:43:26] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:43:26] [INFO ] Applying decomposition
[2024-05-23 00:43:26] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1640683800403618010.txt' '-o' '/tmp/graph1640683800403618010.bin' '-w' '/tmp/graph1640683800403618010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1640683800403618010.bin' '-l' '-1' '-v' '-w' '/tmp/graph1640683800403618010.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:43:26] [INFO ] Decomposing Gal with order
[2024-05-23 00:43:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:43:26] [INFO ] Removed a total of 719 redundant transitions.
[2024-05-23 00:43:26] [INFO ] Flatten gal took : 62 ms
[2024-05-23 00:43:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 17 ms.
[2024-05-23 00:43:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17291308993305873634.gal : 5 ms
[2024-05-23 00:43:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7544268090006769762.ctl : 6 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/CTLFireability17291308993305873634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7544268090006769762.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,0.110485,7564,129,23,8349,348,576,9781,57,593,0


Converting to forward existential form...Done !
original formula: A(E((EX((i2.i1.u9.p37==1)) + A(((i10.u35.p143==1)||(!((i1.u4.p17==1)&&(i2.i0.u6.p194==1)))) U AX((((i5.u17.p72==1)&&(i9.u29.p119==1))&&(i...466
=> equivalent forward existential formula: [((Init * !(EG(!((EG((!((E(!(EG((((i3.u8.p35==1)&&(i9.u29.p120==1))&&(i3.u11.p193==1)))) U (!(((((i3.u11.p47==1)...1641
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,0.230976,7828,1,0,8349,348,2517,12876,245,660,10718
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 159 edges and 195 vertex of which 48 / 195 are part of one of the 16 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 147 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 0 with 120 rules applied. Total rules applied 153 place count 147 transition count 209
Applied a total of 153 rules in 22 ms. Remains 147 /195 variables (removed 48) and now considering 209/482 (removed 273) transitions.
[2024-05-23 00:43:26] [INFO ] Flow matrix only has 194 transitions (discarded 15 similar events)
// Phase 1: matrix 194 rows 147 cols
[2024-05-23 00:43:26] [INFO ] Computed 18 invariants in 0 ms
[2024-05-23 00:43:27] [INFO ] Implicit Places using invariants in 228 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 230 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 146/195 places, 209/482 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 146 transition count 194
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 131 transition count 194
Applied a total of 30 rules in 9 ms. Remains 131 /146 variables (removed 15) and now considering 194/209 (removed 15) transitions.
[2024-05-23 00:43:27] [INFO ] Flow matrix only has 179 transitions (discarded 15 similar events)
// Phase 1: matrix 179 rows 131 cols
[2024-05-23 00:43:27] [INFO ] Computed 17 invariants in 0 ms
[2024-05-23 00:43:27] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 00:43:27] [INFO ] Flow matrix only has 179 transitions (discarded 15 similar events)
[2024-05-23 00:43:27] [INFO ] Invariant cache hit.
[2024-05-23 00:43:27] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-23 00:43:27] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 131/195 places, 194/482 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 449 ms. Remains : 131/195 places, 194/482 transitions.
[2024-05-23 00:43:27] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:43:27] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:43:27] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-23 00:43:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:43:27] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:43:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7738491279583727662.gal : 1 ms
[2024-05-23 00:43:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10161000843167252132.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/CTLFireability7738491279583727662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10161000843167252132.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,3.16659e+14,0.515917,24516,2,1350,5,155138,6,0,702,52744,0


Converting to forward existential form...Done !
original formula: EG(AG(((p137==0)||(p194==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((p137==0)||(p194==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.694273,24516,1,0,7,155138,21,0,3344,52744,8
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 10 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2024-05-23 00:43:28] [INFO ] Computed 18 invariants in 2 ms
[2024-05-23 00:43:28] [INFO ] Implicit Places using invariants in 104 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 194/195 places, 482/482 transitions.
[2024-05-23 00:43:28] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:43:28] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:43:28] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-23 00:43:28] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:43:28] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:43:28] [INFO ] Time to serialize gal into /tmp/CTLFireability6812006846005837651.gal : 3 ms
[2024-05-23 00:43:28] [INFO ] Time to serialize properties into /tmp/CTLFireability9501795045536153924.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6812006846005837651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9501795045536153924.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,6.58326,199796,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: AF(!(E((!(EX((p80==1))) * EF((p49!=1))) U AX((AF((p99==1)) * E((((p11==1)&&(p36==1))&&(p193==1)) U (p155==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((!(EX((p80==1))) * E(TRUE U (p49!=1))) U !(EX(!((!(EG(!((p99==1)))) * E((((p11==1)&&(p36==1))&&...195
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 235/435/247
(forward)formula 0,1,23.2655,551316,1,0,17,3.68626e+06,40,5,7703,1.1734e+06,17
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-05-23 00:43:51] [INFO ] Invariant cache hit.
[2024-05-23 00:43:51] [INFO ] Implicit Places using invariants in 112 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 3 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 194/195 places, 482/482 transitions.
[2024-05-23 00:43:51] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:43:51] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:43:51] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-23 00:43:51] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:43:51] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:43:51] [INFO ] Time to serialize gal into /tmp/CTLFireability2456769397832226435.gal : 3 ms
[2024-05-23 00:43:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1431345637897882027.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/CTLFireability2456769397832226435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1431345637897882027.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,6.64771,201080,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: EF(EG((AG((((p84==0)||(p143==0))||(p193==0))) * EX((((p60==0)||(p179==0))||(p193==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E(TRUE U !((((p84==0)||(p143==0))||(p193==0))))) * EX((((p60==0)||(p179==0))||(p193==0)...169
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,19.4845,460608,1,0,8,2.98165e+06,22,0,7198,794961,10
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 159 edges and 195 vertex of which 48 / 195 are part of one of the 16 SCC in 2 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 221 edges and 160 vertex of which 156 / 160 are part of one of the 16 SCC in 1 ms
Free SCC test removed 140 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 20 transition count 343
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 336 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 357 place count 4 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 357 place count 4 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 359 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 361 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 361 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 363 place count 2 transition count 3
Applied a total of 363 rules in 16 ms. Remains 2 /195 variables (removed 193) and now considering 3/482 (removed 479) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-23 00:44:11] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 00:44:11] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 00:44:11] [INFO ] Invariant cache hit.
[2024-05-23 00:44:11] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-23 00:44:11] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-23 00:44:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 49ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/195 places, 3/482 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 112 ms. Remains : 2/195 places, 3/482 transitions.
[2024-05-23 00:44:11] [INFO ] Flatten gal took : 0 ms
[2024-05-23 00:44:11] [INFO ] Flatten gal took : 0 ms
[2024-05-23 00:44:11] [INFO ] Input system was already deterministic with 3 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 00:44:11] [INFO ] Flatten gal took : 0 ms
[2024-05-23 00:44:11] [INFO ] Flatten gal took : 1 ms
[2024-05-23 00:44:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4614289554089870652.gal : 0 ms
[2024-05-23 00:44:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6693331458730790553.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4614289554089870652.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6693331458730790553.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2024-05-23 00:44:11] [INFO ] Computed 18 invariants in 2 ms
[2024-05-23 00:44:11] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 00:44:11] [INFO ] Invariant cache hit.
[2024-05-23 00:44:11] [INFO ] State equation strengthened by 321 read => feed constraints.
[2024-05-23 00:44:11] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-23 00:44:11] [INFO ] Invariant cache hit.
[2024-05-23 00:44:11] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 729 constraints, problems are : Problem set: 0 solved, 481 unsolved in 21945 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 481/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (OVERLAPS) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 481 unsolved in 21265 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 43476ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 43482ms
Finished structural reductions in LTL mode , in 1 iterations and 43807 ms. Remains : 195/195 places, 482/482 transitions.
[2024-05-23 00:44:55] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:44:55] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:44:55] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-23 00:44:55] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:44:55] [INFO ] Flatten gal took : 21 ms
[2024-05-23 00:44:55] [INFO ] Time to serialize gal into /tmp/CTLFireability7417148302607450287.gal : 3 ms
[2024-05-23 00:44:55] [INFO ] Time to serialize properties into /tmp/CTLFireability9777544831777826098.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/CTLFireability7417148302607450287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9777544831777826098.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,12.0805,337824,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: E(EF(((p167==1) * (EX(((p121==1)||((p40==1)&&(p194==1)))) + ((p170==1)&&(p194==1))))) U AG(A(EX((((p36==1)&&(p47==1))&&(p193==1))) U (p47...162
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((p167==1) * (EX(((p121==1)||((p40==1)&&(p194==1)))) + ((p170==1)&&(p194==1)))))) * !(E(TRU...271
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 451/0/31
(forward)formula 0,0,21.4135,380720,1,0,12,2.33699e+06,25,3,7565,779798,14
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 159 edges and 195 vertex of which 48 / 195 are part of one of the 16 SCC in 2 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 147 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 0 with 120 rules applied. Total rules applied 153 place count 147 transition count 209
Applied a total of 153 rules in 22 ms. Remains 147 /195 variables (removed 48) and now considering 209/482 (removed 273) transitions.
[2024-05-23 00:45:17] [INFO ] Flow matrix only has 194 transitions (discarded 15 similar events)
// Phase 1: matrix 194 rows 147 cols
[2024-05-23 00:45:17] [INFO ] Computed 18 invariants in 1 ms
[2024-05-23 00:45:17] [INFO ] Implicit Places using invariants in 72 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 146/195 places, 209/482 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 146 transition count 194
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 131 transition count 194
Applied a total of 30 rules in 6 ms. Remains 131 /146 variables (removed 15) and now considering 194/209 (removed 15) transitions.
[2024-05-23 00:45:17] [INFO ] Flow matrix only has 179 transitions (discarded 15 similar events)
// Phase 1: matrix 179 rows 131 cols
[2024-05-23 00:45:17] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 00:45:17] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 00:45:17] [INFO ] Flow matrix only has 179 transitions (discarded 15 similar events)
[2024-05-23 00:45:17] [INFO ] Invariant cache hit.
[2024-05-23 00:45:17] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-23 00:45:17] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 131/195 places, 194/482 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 336 ms. Remains : 131/195 places, 194/482 transitions.
[2024-05-23 00:45:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:45:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:45:17] [INFO ] Input system was already deterministic with 194 transitions.
RANDOM walk for 1794 steps (0 resets) in 14 ms. (119 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 00:45:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:45:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:45:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13507438020203502323.gal : 1 ms
[2024-05-23 00:45:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11545444967946099348.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13507438020203502323.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11545444967946099348.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality11545444967946099348.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2024-05-23 00:45:17] [INFO ] Computed 18 invariants in 2 ms
[2024-05-23 00:45:17] [INFO ] Implicit Places using invariants in 348 ms returned [193]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 350 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 1 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 353 ms. Remains : 194/195 places, 482/482 transitions.
[2024-05-23 00:45:17] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:45:17] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:45:17] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-23 00:45:17] [INFO ] Flatten gal took : 24 ms
[2024-05-23 00:45:17] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:45:17] [INFO ] Time to serialize gal into /tmp/CTLFireability18227310941031333997.gal : 2 ms
[2024-05-23 00:45:17] [INFO ] Time to serialize properties into /tmp/CTLFireability567770814392520782.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/CTLFireability18227310941031333997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability567770814392520782.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,12.1648,341380,2,40642,5,2.76725e+06,6,0,1258,911643,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-23 00:45:47] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:45:47] [INFO ] Applying decomposition
[2024-05-23 00:45:47] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17556052268389269255.txt' '-o' '/tmp/graph17556052268389269255.bin' '-w' '/tmp/graph17556052268389269255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17556052268389269255.bin' '-l' '-1' '-v' '-w' '/tmp/graph17556052268389269255.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:45:47] [INFO ] Decomposing Gal with order
[2024-05-23 00:45:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:45:48] [INFO ] Removed a total of 509 redundant transitions.
[2024-05-23 00:45:48] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:45:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 7 ms.
[2024-05-23 00:45:48] [INFO ] Time to serialize gal into /tmp/CTLFireability1664034042536215459.gal : 2 ms
[2024-05-23 00:45:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15310976906321404917.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/CTLFireability1664034042536215459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15310976906321404917.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,0.077432,6664,59,23,6243,313,520,5804,60,527,0


Converting to forward existential form...Done !
original formula: AG(EX(EX(EF(((i6.u20.p81==0)||(i14.u42.p194==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EX(E(TRUE U ((i6.u20.p81==0)||(i14.u42.p194==0)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.090714,6928,1,0,6243,313,1775,5804,218,527,1771
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 4 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-05-23 00:45:48] [INFO ] Invariant cache hit.
[2024-05-23 00:45:48] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-23 00:45:48] [INFO ] Invariant cache hit.
[2024-05-23 00:45:48] [INFO ] State equation strengthened by 321 read => feed constraints.
[2024-05-23 00:45:48] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-23 00:45:48] [INFO ] Invariant cache hit.
[2024-05-23 00:45:48] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 729 constraints, problems are : Problem set: 0 solved, 481 unsolved in 22198 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 481/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (OVERLAPS) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 481 unsolved in 21147 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 43605ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 43611ms
Finished structural reductions in LTL mode , in 1 iterations and 44002 ms. Remains : 195/195 places, 482/482 transitions.
[2024-05-23 00:46:32] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:46:32] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:46:32] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-23 00:46:32] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:46:32] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:46:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11231917595672217829.gal : 2 ms
[2024-05-23 00:46:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2532013418005437250.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/CTLFireability11231917595672217829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2532013418005437250.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,11.9581,337556,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: EX(EG((EF(((p115==1)&&(p194==1))) + AF(AX((((p156==0)||(p167==0))||(p193==0)))))))
=> equivalent forward existential formula: [FwdG(EY(Init),(E(TRUE U ((p115==1)&&(p194==1))) + !(EG(!(!(EX(!((((p156==0)||(p167==0))||(p193==0))))))))))] !=...161
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-23 00:47:02] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:47:02] [INFO ] Applying decomposition
[2024-05-23 00:47:02] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6130958380183048346.txt' '-o' '/tmp/graph6130958380183048346.bin' '-w' '/tmp/graph6130958380183048346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6130958380183048346.bin' '-l' '-1' '-v' '-w' '/tmp/graph6130958380183048346.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:47:02] [INFO ] Decomposing Gal with order
[2024-05-23 00:47:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:47:02] [INFO ] Removed a total of 719 redundant transitions.
[2024-05-23 00:47:02] [INFO ] Flatten gal took : 21 ms
[2024-05-23 00:47:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 8 ms.
[2024-05-23 00:47:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1738552426779339335.gal : 3 ms
[2024-05-23 00:47:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12210807231834495070.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/CTLFireability1738552426779339335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12210807231834495070.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,0.344191,18616,137,23,36769,457,545,31752,57,1352,0


Converting to forward existential form...Done !
original formula: EX(EG((EF(((i8.u28.p115==1)&&(i7.i2.u24.p194==1))) + AF(AX((((i11.u38.p156==0)||(i12.u41.p167==0))||(i3.u11.p193==0)))))))
=> equivalent forward existential formula: [FwdG(EY(Init),(E(TRUE U ((i8.u28.p115==1)&&(i7.i2.u24.p194==1))) + !(EG(!(!(EX(!((((i11.u38.p156==0)||(i12.u41....201
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,0.604759,20728,1,0,41934,521,2640,39434,260,1635,66164
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 5 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-05-23 00:47:03] [INFO ] Invariant cache hit.
[2024-05-23 00:47:03] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-23 00:47:03] [INFO ] Invariant cache hit.
[2024-05-23 00:47:03] [INFO ] State equation strengthened by 321 read => feed constraints.
[2024-05-23 00:47:03] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-23 00:47:03] [INFO ] Invariant cache hit.
[2024-05-23 00:47:03] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 729 constraints, problems are : Problem set: 0 solved, 481 unsolved in 22096 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 481/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (OVERLAPS) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 481 unsolved in 20933 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 43290ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 43296ms
Finished structural reductions in LTL mode , in 1 iterations and 43647 ms. Remains : 195/195 places, 482/482 transitions.
[2024-05-23 00:47:46] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:47:46] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:47:46] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-23 00:47:46] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:47:46] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:47:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16627500953108252103.gal : 3 ms
[2024-05-23 00:47:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15922537943669537989.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/CTLFireability16627500953108252103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15922537943669537989.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,11.806,337088,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: EF(AX((((p91==1)&&(p194==1))&&(((p107==0)||(p168==0))||((p193==0)||(p82==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((((p91==1)&&(p194==1))&&(((p107==0)||(p168==0))||((p193==0)||(p82==1))))))))] != FALS...156
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,19.5245,343336,1,0,6,2.27764e+06,11,0,6531,779798,4
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 4 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-05-23 00:48:06] [INFO ] Invariant cache hit.
[2024-05-23 00:48:06] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 00:48:06] [INFO ] Invariant cache hit.
[2024-05-23 00:48:06] [INFO ] State equation strengthened by 321 read => feed constraints.
[2024-05-23 00:48:06] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-23 00:48:06] [INFO ] Invariant cache hit.
[2024-05-23 00:48:06] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 729 constraints, problems are : Problem set: 0 solved, 481 unsolved in 21710 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 481/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (OVERLAPS) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 481 unsolved in 21320 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 43285ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 43290ms
Finished structural reductions in LTL mode , in 1 iterations and 43628 ms. Remains : 195/195 places, 482/482 transitions.
[2024-05-23 00:48:50] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:48:50] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:48:50] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-23 00:48:50] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:48:50] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:48:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12153270289239407289.gal : 2 ms
[2024-05-23 00:48:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17055704455815644820.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/CTLFireability12153270289239407289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17055704455815644820.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,11.8291,338132,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: EX((((p161==0)||(p194==0)) * (EF((p11==0)) + (EX((p109==1)) * (((EF((((p83==0)||(p156==0))||(p193==0))) + (p60==0)) + ((p143==0)||(p193==...213
=> equivalent forward existential formula: ([(FwdU((EY(Init) * ((p161==0)||(p194==0))),TRUE) * (p11==0))] != FALSE + ((([(FwdU(((EY(Init) * ((p161==0)||(p1...530
(forward)formula 0,1,19.2092,343676,1,0,10,1.96554e+06,10,2,2509,787575,5
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 5 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-05-23 00:49:09] [INFO ] Invariant cache hit.
[2024-05-23 00:49:09] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-23 00:49:09] [INFO ] Invariant cache hit.
[2024-05-23 00:49:09] [INFO ] State equation strengthened by 321 read => feed constraints.
[2024-05-23 00:49:09] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-23 00:49:09] [INFO ] Invariant cache hit.
[2024-05-23 00:49:09] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 729 constraints, problems are : Problem set: 0 solved, 481 unsolved in 22248 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 481/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (OVERLAPS) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 481 unsolved in 21463 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 43971ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 43979ms
Finished structural reductions in LTL mode , in 1 iterations and 44305 ms. Remains : 195/195 places, 482/482 transitions.
[2024-05-23 00:49:53] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:49:53] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:49:53] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-23 00:49:53] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:49:53] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:49:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10960434201232408955.gal : 2 ms
[2024-05-23 00:49:53] [INFO ] Time to serialize properties into /tmp/CTLFireability11818498841060421876.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/CTLFireability10960434201232408955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11818498841060421876.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,11.8288,338224,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: EF((E((((p119==1)&&(p168==1))&&(p193==1)) U ((p81==1)&&(p194==1))) * (A((p132==1) U (((p59==1)&&(p144==1))&&(p193==1))) + AG(((AX((((p84=...280
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * E((((p119==1)&&(p168==1))&&(p193==1)) U ((p81==1)&&(p194==1)))) * !(EG(!((((p59==1)&&(p14...548
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 235/0/247
Hit Full ! (commute/partial/dont) 235/435/247
(forward)formula 0,1,28.2006,603180,1,0,13,4.29049e+06,32,4,7925,1.13049e+06,14
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 1 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-05-23 00:50:22] [INFO ] Invariant cache hit.
[2024-05-23 00:50:22] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-23 00:50:22] [INFO ] Invariant cache hit.
[2024-05-23 00:50:22] [INFO ] State equation strengthened by 321 read => feed constraints.
[2024-05-23 00:50:22] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-23 00:50:22] [INFO ] Invariant cache hit.
[2024-05-23 00:50:22] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (OVERLAPS) 0/677 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 729 constraints, problems are : Problem set: 0 solved, 481 unsolved in 21319 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 481/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (OVERLAPS) 0/677 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 481 unsolved in 21124 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints]
After SMT, in 42679ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 42686ms
Finished structural reductions in LTL mode , in 1 iterations and 43078 ms. Remains : 195/195 places, 482/482 transitions.
[2024-05-23 00:51:05] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:51:05] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:51:05] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-23 00:51:05] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:51:05] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:51:05] [INFO ] Time to serialize gal into /tmp/CTLFireability16310970251925930427.gal : 2 ms
[2024-05-23 00:51:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14896831192511356459.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/CTLFireability16310970251925930427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14896831192511356459.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,11.8843,337752,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: A(AG((p118==1)) U EG((EX(((((p146==1)&&(p194==1))||(p39==1))&&(!(((p35==1)&&(p108==1))&&(p193==1))))) * !((((p47==1)&&(p84==1))&&(p193==1...161
=> equivalent forward existential formula: [((Init * !(EG(!(EG((EX(((((p146==1)&&(p194==1))||(p39==1))&&(!(((p35==1)&&(p108==1))&&(p193==1))))) * !((((p47=...498
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-23 00:51:35] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:51:35] [INFO ] Applying decomposition
[2024-05-23 00:51:35] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13822004727995527279.txt' '-o' '/tmp/graph13822004727995527279.bin' '-w' '/tmp/graph13822004727995527279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13822004727995527279.bin' '-l' '-1' '-v' '-w' '/tmp/graph13822004727995527279.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:51:35] [INFO ] Decomposing Gal with order
[2024-05-23 00:51:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:51:35] [INFO ] Removed a total of 719 redundant transitions.
[2024-05-23 00:51:35] [INFO ] Flatten gal took : 28 ms
[2024-05-23 00:51:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 4 ms.
[2024-05-23 00:51:35] [INFO ] Time to serialize gal into /tmp/CTLFireability527576503490496412.gal : 3 ms
[2024-05-23 00:51:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4039365871206130454.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/CTLFireability527576503490496412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4039365871206130454.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,0.417593,20524,145,23,42331,449,570,36291,57,1294,0


Converting to forward existential form...Done !
original formula: A(AG((i0.u29.p118==1)) U EG((EX(((((i11.u36.p146==1)&&(i6.i1.u18.p194==1))||(i3.u9.p39==1))&&(!(((i2.u8.p35==1)&&(i8.u26.p108==1))&&(i0.u...231
=> equivalent forward existential formula: [((Init * !(EG(!(EG((EX(((((i11.u36.p146==1)&&(i6.i1.u18.p194==1))||(i3.u9.p39==1))&&(!(((i2.u8.p35==1)&&(i8.u26...694
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,0.487071,20524,1,0,42331,449,2503,36291,220,1294,18226
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 4 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-05-23 00:51:35] [INFO ] Invariant cache hit.
[2024-05-23 00:51:35] [INFO ] Implicit Places using invariants in 123 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 194/195 places, 482/482 transitions.
[2024-05-23 00:51:35] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:51:36] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:51:36] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-23 00:51:36] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:51:36] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:51:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1740450770370370978.gal : 2 ms
[2024-05-23 00:51:36] [INFO ] Time to serialize properties into /tmp/CTLFireability7216845104586040034.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/CTLFireability1740450770370370978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7216845104586040034.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,6.61977,200480,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: E(EX(E((EF((((p84==1)&&(p119==1))&&(p193==1))) + A((p20==1) U (((p120==1)&&(p143==1))&&(p193==1)))) U !(EF((((p11==1)&&(p156==1))&&(p193=...845
=> equivalent forward existential formula: [(((FwdU(Init,EX(E((E(TRUE U (((p84==1)&&(p119==1))&&(p193==1))) + !((E(!((((p120==1)&&(p143==1))&&(p193==1))) U...1789
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 479/0/3
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 235/0/247
(forward)formula 0,0,26.2285,652252,1,0,31,4.50371e+06,79,13,7840,1.49771e+06,36
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-23 00:52:02] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:52:02] [INFO ] Flatten gal took : 8 ms
Total runtime 669144 ms.

BK_STOP 1716425522501

--------------------
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-16a"
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-16a, 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-171640602600098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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