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.r136-tall-171631132800490.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 DiscoveryGPU-PT-14a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132800490
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 02:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 02:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 02:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 50K 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 DiscoveryGPU-PT-14a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716382175201

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 12:49:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 12:49:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:49:36] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-22 12:49:36] [INFO ] Transformed 143 places.
[2024-05-22 12:49:36] [INFO ] Transformed 197 transitions.
[2024-05-22 12:49:36] [INFO ] Found NUPN structural information;
[2024-05-22 12:49:36] [INFO ] Parsed PT model containing 143 places and 197 transitions and 633 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 75 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 197/197 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 192
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 136 transition count 190
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 136 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 136 transition count 176
Applied a total of 28 rules in 31 ms. Remains 136 /143 variables (removed 7) and now considering 176/197 (removed 21) transitions.
// Phase 1: matrix 176 rows 136 cols
[2024-05-22 12:49:36] [INFO ] Computed 2 invariants in 10 ms
[2024-05-22 12:49:36] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-22 12:49:36] [INFO ] Invariant cache hit.
[2024-05-22 12:49:36] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-22 12:49:36] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 12:49:36] [INFO ] Invariant cache hit.
[2024-05-22 12:49:36] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/312 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 248 constraints, problems are : Problem set: 0 solved, 175 unsolved in 5376 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/312 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 175/423 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 423 constraints, problems are : Problem set: 0 solved, 175 unsolved in 3791 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 9229ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 9241ms
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 176/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9690 ms. Remains : 136/143 places, 176/197 transitions.
Support contains 75 out of 136 places after structural reductions.
[2024-05-22 12:49:46] [INFO ] Flatten gal took : 30 ms
[2024-05-22 12:49:46] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:49:46] [INFO ] Input system was already deterministic with 176 transitions.
Reduction of identical properties reduced properties to check from 74 to 73
RANDOM walk for 40000 steps (265 resets) in 1351 ms. (29 steps per ms) remains 1/73 properties
BEST_FIRST walk for 40004 steps (17 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
[2024-05-22 12:49:46] [INFO ] Invariant cache hit.
[2024-05-22 12:49:46] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/55 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/110 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 19/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 41/151 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/151 variables, 17/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/151 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 34/185 variables, 17/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/185 variables, 15/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 38/223 variables, 14/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/223 variables, 12/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/223 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 25/248 variables, 9/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/248 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/248 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 16/264 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/264 variables, 8/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/264 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 16/280 variables, 8/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/280 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 16/296 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/296 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/296 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 16/312 variables, 8/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem AtomicPropp71 is UNSAT
After SMT solving in domain Int declared 5/312 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/136 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms 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-22 12:49:47] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:49:47] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:49:47] [INFO ] Input system was already deterministic with 176 transitions.
Computed a total of 17 stabilizing places and 15 stable transitions
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 127 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 116 transition count 156
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 36 place count 103 transition count 143
Iterating global reduction 0 with 13 rules applied. Total rules applied 49 place count 103 transition count 143
Applied a total of 49 rules in 25 ms. Remains 103 /136 variables (removed 33) and now considering 143/176 (removed 33) transitions.
// Phase 1: matrix 143 rows 103 cols
[2024-05-22 12:49:47] [INFO ] Computed 2 invariants in 8 ms
[2024-05-22 12:49:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 12:49:47] [INFO ] Invariant cache hit.
[2024-05-22 12:49:47] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-22 12:49:47] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-22 12:49:47] [INFO ] Redundant transitions in 4 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-22 12:49:47] [INFO ] Invariant cache hit.
[2024-05-22 12:49:47] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/246 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 204 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3200 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/246 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 142/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/246 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 346 constraints, problems are : Problem set: 0 solved, 142 unsolved in 2450 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 5672ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 5675ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/136 places, 143/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5869 ms. Remains : 103/136 places, 143/176 transitions.
[2024-05-22 12:49:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:49:53] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:49:53] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-22 12:49:53] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:49:53] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:49:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2248262720503095841.gal : 3 ms
[2024-05-22 12:49:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6210104980335592985.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/CTLFireability2248262720503095841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6210104980335592985.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.35377e+13,1.58478,54420,2,4666,5,346634,6,0,539,161863,0


Converting to forward existential form...Done !
original formula: AG((((AG(((p49==0)||(p141==0))) + (p13==0)) + (p142==0)) * (A((p24!=1) U !(((p116==1)&&(p141==1)))) + (p118==1))))
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !((p142==0))) * !((p13==0))),TRUE) * !(((p49==0)||(p141==0))))] = FALSE * ([(FwdU((F...354
Hit Full ! (commute/partial/dont) 70/71/73
(forward)formula 0,0,3.03804,62332,1,0,13,346634,21,5,2722,229614,11
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 1 place count 127 transition count 155
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 115 transition count 155
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 38 place count 102 transition count 142
Iterating global reduction 0 with 13 rules applied. Total rules applied 51 place count 102 transition count 142
Applied a total of 51 rules in 19 ms. Remains 102 /136 variables (removed 34) and now considering 142/176 (removed 34) transitions.
// Phase 1: matrix 142 rows 102 cols
[2024-05-22 12:49:56] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:49:56] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 12:49:56] [INFO ] Invariant cache hit.
[2024-05-22 12:49:56] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-22 12:49:56] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-22 12:49:56] [INFO ] Redundant transitions in 2 ms returned []
Running 141 sub problems to find dead transitions.
[2024-05-22 12:49:56] [INFO ] Invariant cache hit.
[2024-05-22 12:49:56] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/244 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 99/203 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/244 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 203 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3086 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/244 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 99/203 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 141/344 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 344 constraints, problems are : Problem set: 0 solved, 141 unsolved in 2391 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
After SMT, in 5495ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 5497ms
Starting structural reductions in SI_CTL mode, iteration 1 : 102/136 places, 142/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5702 ms. Remains : 102/136 places, 142/176 transitions.
[2024-05-22 12:50:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:50:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:50:01] [INFO ] Input system was already deterministic with 142 transitions.
[2024-05-22 12:50:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:50:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:50:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13574252196776455506.gal : 2 ms
[2024-05-22 12:50:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4667113189762448504.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/CTLFireability13574252196776455506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4667113189762448504.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.20946e+13,1.67651,50248,2,4028,5,318017,6,0,534,147940,0


Converting to forward existential form...Done !
original formula: AG((EF(((p55==1)&&(p141==1))) * EG(((p74==0)||(p142==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((p55==1)&&(p141==1)))))] = FALSE * [(FwdU(Init,TRUE) * !(EG(((p74==0)||(p142==0...170
Reverse transition relation is NOT exact ! Due to transitions t30, t32, t34, t36, t38, t40, t42, t44, t45, t47, t49, t51, t53, t55, t127, t128, t129, t130,...322
(forward)formula 0,0,24.2171,603076,1,0,697,3.5696e+06,306,381,3178,4.19457e+06,825
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 124 transition count 164
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 124 transition count 164
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 115 transition count 155
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 115 transition count 155
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 108 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 108 transition count 148
Applied a total of 56 rules in 20 ms. Remains 108 /136 variables (removed 28) and now considering 148/176 (removed 28) transitions.
// Phase 1: matrix 148 rows 108 cols
[2024-05-22 12:50:26] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:50:26] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 12:50:26] [INFO ] Invariant cache hit.
[2024-05-22 12:50:26] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-22 12:50:26] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-22 12:50:26] [INFO ] Invariant cache hit.
[2024-05-22 12:50:26] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/256 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 101/211 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 211 constraints, problems are : Problem set: 0 solved, 147 unsolved in 3472 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/256 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 101/211 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 147/358 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 358 constraints, problems are : Problem set: 0 solved, 147 unsolved in 2613 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 6104ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 6106ms
Starting structural reductions in LTL mode, iteration 1 : 108/136 places, 148/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6261 ms. Remains : 108/136 places, 148/176 transitions.
[2024-05-22 12:50:32] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:50:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:50:32] [INFO ] Input system was already deterministic with 148 transitions.
[2024-05-22 12:50:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:50:32] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:50:32] [INFO ] Time to serialize gal into /tmp/CTLFireability424133912209023944.gal : 7 ms
[2024-05-22 12:50:32] [INFO ] Time to serialize properties into /tmp/CTLFireability12822391036064973434.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability424133912209023944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12822391036064973434.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,6.89235e+13,7.34661,199224,2,23246,5,1.2682e+06,6,0,563,577762,0


Converting to forward existential form...Done !
original formula: EF(((p66==1) * ((EX((((p66==0)||(p141==0))&&((p14==0)||(p142==0)))) * !(E(!(((p69==1)&&(p141==1))) U E(((p100==1)&&(p141==1)) U (p88==1))...357
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (p66==1)) * EX((((p66==0)||(p141==0))&&((p14==0)||(p142==0))))) * !(E(!(((p69==1)&&(p141=...1560
Reverse transition relation is NOT exact ! Due to transitions t33, t35, t37, t39, t41, t43, t45, t47, t50, t54, t56, t58, t124, t125, t128, t133, t134, t13...330
(forward)formula 0,1,22.4418,497072,1,0,237,2.58697e+06,323,155,3321,3.15516e+06,341
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 163
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 112 transition count 152
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 112 transition count 152
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 104 transition count 144
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 104 transition count 144
Applied a total of 64 rules in 15 ms. Remains 104 /136 variables (removed 32) and now considering 144/176 (removed 32) transitions.
// Phase 1: matrix 144 rows 104 cols
[2024-05-22 12:50:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:50:55] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 12:50:55] [INFO ] Invariant cache hit.
[2024-05-22 12:50:55] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-22 12:50:55] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/136 places, 144/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 103/136 places, 144/176 transitions.
[2024-05-22 12:50:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:50:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:50:55] [INFO ] Input system was already deterministic with 144 transitions.
[2024-05-22 12:50:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:50:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:50:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6867348439513078722.gal : 1 ms
[2024-05-22 12:50:55] [INFO ] Time to serialize properties into /tmp/CTLFireability525930848838598442.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/CTLFireability6867348439513078722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability525930848838598442.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,4.93749e+13,12.3102,362048,2,76137,5,2.76805e+06,6,0,541,991398,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 12:51:25] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:51:25] [INFO ] Applying decomposition
[2024-05-22 12:51:25] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4178663672625164138.txt' '-o' '/tmp/graph4178663672625164138.bin' '-w' '/tmp/graph4178663672625164138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4178663672625164138.bin' '-l' '-1' '-v' '-w' '/tmp/graph4178663672625164138.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:51:25] [INFO ] Decomposing Gal with order
[2024-05-22 12:51:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:51:25] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-22 12:51:25] [INFO ] Flatten gal took : 45 ms
[2024-05-22 12:51:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 9 ms.
[2024-05-22 12:51:25] [INFO ] Time to serialize gal into /tmp/CTLFireability2742263108665273250.gal : 10 ms
[2024-05-22 12:51:25] [INFO ] Time to serialize properties into /tmp/CTLFireability4876135274682300146.ctl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2742263108665273250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4876135274682300146.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.93749e+13,0.156769,11292,542,100,18054,2358,205,31123,45,9368,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(((i7.u14.p70==1)&&(i1.u1.p141==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(((i7.u14.p70==1)&&(i1.u1.p141==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t35, t39, t41, t43, t45, t46, t48, t50, t54, t56, i0.t52, i0.t37, i0.u0.t137, i0.u1...431
(forward)formula 0,1,0.98032,49836,1,0,111104,4050,1100,184482,248,25148,100072
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 127 transition count 156
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 116 transition count 156
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 36 place count 103 transition count 143
Iterating global reduction 0 with 13 rules applied. Total rules applied 49 place count 103 transition count 143
Applied a total of 49 rules in 19 ms. Remains 103 /136 variables (removed 33) and now considering 143/176 (removed 33) transitions.
// Phase 1: matrix 143 rows 103 cols
[2024-05-22 12:51:26] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 12:51:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 12:51:26] [INFO ] Invariant cache hit.
[2024-05-22 12:51:26] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-22 12:51:26] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-22 12:51:26] [INFO ] Redundant transitions in 3 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-22 12:51:26] [INFO ] Invariant cache hit.
[2024-05-22 12:51:26] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/246 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 204 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3204 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/246 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 142/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/246 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 346 constraints, problems are : Problem set: 0 solved, 142 unsolved in 2457 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 5678ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 5680ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/136 places, 143/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5881 ms. Remains : 103/136 places, 143/176 transitions.
[2024-05-22 12:51:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:51:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:51:32] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-22 12:51:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:51:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:51:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11799228155606293450.gal : 1 ms
[2024-05-22 12:51:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3604451897851809510.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/CTLFireability11799228155606293450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3604451897851809510.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.35377e+13,1.51022,56608,2,5221,5,371175,6,0,539,164180,0


Converting to forward existential form...Done !
original formula: AF(AG(((p103==0)||(p142==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p103==0)||(p142==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t31, t33, t35, t37, t39, t41, t43, t45, t46, t48, t50, t52, t56, t128, t129, t130, t131, ...321
Detected timeout of ITS tools.
[2024-05-22 12:52:02] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:52:02] [INFO ] Applying decomposition
[2024-05-22 12:52:02] [INFO ] Flatten gal took : 4 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/graph15980529335249849398.txt' '-o' '/tmp/graph15980529335249849398.bin' '-w' '/tmp/graph15980529335249849398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15980529335249849398.bin' '-l' '-1' '-v' '-w' '/tmp/graph15980529335249849398.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:52:02] [INFO ] Decomposing Gal with order
[2024-05-22 12:52:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:52:02] [INFO ] Removed a total of 92 redundant transitions.
[2024-05-22 12:52:02] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:52:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 4 ms.
[2024-05-22 12:52:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7900848205130501305.gal : 3 ms
[2024-05-22 12:52:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5673795064504299543.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/CTLFireability7900848205130501305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5673795064504299543.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35377e+13,0.088696,8024,381,115,7609,610,246,23862,36,7515,0


Converting to forward existential form...Done !
original formula: AF(AG(((i7.u0.p103==0)||(i7.u0.p142==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((i7.u0.p103==0)||(i7.u0.p142==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t31, t33, t35, t39, t41, t43, t45, t46, t48, t50, t52, t56, t142, i0.u1.t135, i1.u4.t134, i2....429
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,0,2.17513,80624,1,0,174787,2697,1362,248611,173,18618,133044
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 140 edges and 124 vertex of which 99 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 25 output transitions
Drop transitions (Output transitions of discarded places.) removed 25 transitions
Graph (trivial) has 112 edges and 99 vertex of which 56 / 99 are part of one of the 28 SCC in 3 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 71 transition count 127
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 61 place count 57 transition count 99
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 45 transition count 75
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 45 transition count 75
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 97 place count 33 transition count 51
Iterating global reduction 2 with 12 rules applied. Total rules applied 109 place count 33 transition count 51
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 121 place count 21 transition count 27
Iterating global reduction 2 with 12 rules applied. Total rules applied 133 place count 21 transition count 27
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 145 place count 9 transition count 15
Iterating global reduction 2 with 12 rules applied. Total rules applied 157 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 9 transition count 14
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 1 rules applied. Total rules applied 159 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 6 transition count 11
Applied a total of 162 rules in 22 ms. Remains 6 /136 variables (removed 130) and now considering 11/176 (removed 165) transitions.
[2024-05-22 12:52:04] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2024-05-22 12:52:04] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 12:52:04] [INFO ] Implicit Places using invariants in 11 ms returned []
[2024-05-22 12:52:04] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 12:52:04] [INFO ] Invariant cache hit.
[2024-05-22 12:52:04] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2024-05-22 12:52:04] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-22 12:52:04] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 12:52:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 50 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 49 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/136 places, 11/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 157 ms. Remains : 6/136 places, 11/176 transitions.
[2024-05-22 12:52:05] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:52:05] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:52:05] [INFO ] Input system was already deterministic with 11 transitions.
[2024-05-22 12:52:05] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:52:05] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:52:05] [INFO ] Time to serialize gal into /tmp/CTLFireability3977965371881569722.gal : 1 ms
[2024-05-22 12:52:05] [INFO ] Time to serialize properties into /tmp/CTLFireability9375248376508521020.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/CTLFireability3977965371881569722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9375248376508521020.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,525,0.002882,3344,2,23,5,165,6,0,29,165,0


Converting to forward existential form...Done !
original formula: EG(AG((p63==0)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((p63==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...171
(forward)formula 0,0,0.00485,3664,1,0,26,317,46,14,175,410,30
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 166
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 166
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 119 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 119 transition count 159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 115 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 115 transition count 155
Applied a total of 42 rules in 5 ms. Remains 115 /136 variables (removed 21) and now considering 155/176 (removed 21) transitions.
// Phase 1: matrix 155 rows 115 cols
[2024-05-22 12:52:05] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 12:52:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 12:52:05] [INFO ] Invariant cache hit.
[2024-05-22 12:52:05] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-22 12:52:05] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-05-22 12:52:05] [INFO ] Invariant cache hit.
[2024-05-22 12:52:05] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/270 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 102/219 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 219 constraints, problems are : Problem set: 0 solved, 154 unsolved in 3839 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/270 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 102/219 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 154/373 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/270 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 373 constraints, problems are : Problem set: 0 solved, 154 unsolved in 2840 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
After SMT, in 6707ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 6708ms
Starting structural reductions in LTL mode, iteration 1 : 115/136 places, 155/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6841 ms. Remains : 115/136 places, 155/176 transitions.
[2024-05-22 12:52:11] [INFO ] Flatten gal took : 16 ms
[2024-05-22 12:52:11] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:52:11] [INFO ] Input system was already deterministic with 155 transitions.
[2024-05-22 12:52:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:52:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:52:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3445624174369207651.gal : 2 ms
[2024-05-22 12:52:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4950188444024077819.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/CTLFireability3445624174369207651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4950188444024077819.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.09571e+14,5.48582,164064,2,20095,5,1.10435e+06,6,0,595,563041,0


Converting to forward existential form...Done !
original formula: !(A(((!(AX(((p31==1)||((p108==1)&&(p142==1))))) + !(((((p11==1)&&(p41==1)) + AF(((p23==1)&&(p142==1)))) * EG((p26==1))))) + ((p78==1) * !...349
=> equivalent forward existential formula: ((([(((FwdU(Init,!(((((p74!=1) * EX(!(((p83==1)&&(p142==1))))) * !(E(!(((p135==1)&&(p141==1))) U !(EG(!(((p55==1...1662
Reverse transition relation is NOT exact ! Due to transitions t11, t26, t32, t36, t38, t40, t42, t44, t50, t55, t59, t61, t137, t138, t139, t140, t141, t14...330
Detected timeout of ITS tools.
[2024-05-22 12:52:41] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:52:41] [INFO ] Applying decomposition
[2024-05-22 12:52:41] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4919083138816563497.txt' '-o' '/tmp/graph4919083138816563497.bin' '-w' '/tmp/graph4919083138816563497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4919083138816563497.bin' '-l' '-1' '-v' '-w' '/tmp/graph4919083138816563497.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:52:41] [INFO ] Decomposing Gal with order
[2024-05-22 12:52:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:52:41] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-22 12:52:42] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:52:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 7 ms.
[2024-05-22 12:52:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16191210558559132021.gal : 3 ms
[2024-05-22 12:52:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17739200450631418336.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/CTLFireability16191210558559132021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17739200450631418336.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 -...264
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.09571e+14,0.105317,8408,304,128,9541,2475,297,15326,39,8967,0


Converting to forward existential form...Done !
original formula: !(A(((!(AX(((i4.i0.u10.p31==1)||((i11.u35.p108==1)&&(i0.u45.p142==1))))) + !(((((i2.u3.p11==1)&&(i5.u14.p41==1)) + AF(((i0.u0.p23==1)&&(i...500
=> equivalent forward existential formula: ((([(((FwdU(Init,!(((((i8.u24.p74!=1) * EX(!(((i0.u0.p83==1)&&(i0.u45.p142==1))))) * !(E(!(((i14.u42.p135==1)&&(...2317
Reverse transition relation is NOT exact ! Due to transitions t36, t38, t40, t42, t44, t50, t55, t59, t61, i0.t32, i0.u0.t11, i0.u0.t26, i0.u0.t147, i1.u1....476
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 124 transition count 164
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 124 transition count 164
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 114 transition count 154
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 114 transition count 154
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 107 transition count 147
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 107 transition count 147
Applied a total of 58 rules in 15 ms. Remains 107 /136 variables (removed 29) and now considering 147/176 (removed 29) transitions.
// Phase 1: matrix 147 rows 107 cols
[2024-05-22 12:53:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:53:12] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 12:53:12] [INFO ] Invariant cache hit.
[2024-05-22 12:53:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 12:53:12] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 12:53:12] [INFO ] Invariant cache hit.
[2024-05-22 12:53:12] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/254 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/254 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 209 constraints, problems are : Problem set: 0 solved, 146 unsolved in 3594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/254 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 146/355 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/254 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 355 constraints, problems are : Problem set: 0 solved, 146 unsolved in 2519 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 6130ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 6132ms
Starting structural reductions in LTL mode, iteration 1 : 107/136 places, 147/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6301 ms. Remains : 107/136 places, 147/176 transitions.
[2024-05-22 12:53:18] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:53:18] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:53:18] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-22 12:53:18] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:53:18] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:53:18] [INFO ] Time to serialize gal into /tmp/CTLFireability13910857609353745965.gal : 1 ms
[2024-05-22 12:53:18] [INFO ] Time to serialize properties into /tmp/CTLFireability12427457453736893420.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/CTLFireability13910857609353745965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12427457453736893420.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,6.10165e+13,5.09041,121688,2,12269,5,748043,6,0,557,405081,0


Converting to forward existential form...Done !
original formula: E(AX(!(((EG(A(((p117==1)&&(p141==1)) U ((p28==1)&&(p142==1)))) * (p16==1)) * (p141==1)))) U AF((((p1==1)&&(p129==1))&&(p141==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((EG(!((E(!(((p28==1)&&(p142==1))) U (!(((p117==1)&&(p141==1))) * !(((p28==1)&&(p142==1))))...277
Reverse transition relation is NOT exact ! Due to transitions t32, t34, t36, t38, t40, t42, t44, t47, t49, t51, t53, t55, t57, t131, t132, t133, t134, t135...323
Detected timeout of ITS tools.
[2024-05-22 12:53:48] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:53:48] [INFO ] Applying decomposition
[2024-05-22 12:53:48] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18124747455200080573.txt' '-o' '/tmp/graph18124747455200080573.bin' '-w' '/tmp/graph18124747455200080573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18124747455200080573.bin' '-l' '-1' '-v' '-w' '/tmp/graph18124747455200080573.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:53:48] [INFO ] Decomposing Gal with order
[2024-05-22 12:53:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:53:48] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-22 12:53:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:53:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 2 ms.
[2024-05-22 12:53:48] [INFO ] Time to serialize gal into /tmp/CTLFireability2713907866511999661.gal : 2 ms
[2024-05-22 12:53:48] [INFO ] Time to serialize properties into /tmp/CTLFireability9194269533337003633.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/CTLFireability2713907866511999661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9194269533337003633.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.10165e+13,0.156552,10688,176,89,9454,7985,251,24731,36,47549,0


Converting to forward existential form...Done !
original formula: E(AX(!(((EG(A(((i12.u34.p117==1)&&(i0.u1.p141==1)) U ((i2.u8.p28==1)&&(i4.u42.p142==1)))) * (i1.u4.p16==1)) * (i0.u1.p141==1)))) U AF((((...207
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((EG(!((E(!(((i2.u8.p28==1)&&(i4.u42.p142==1))) U (!(((i12.u34.p117==1)&&(i0.u1.p141==1))) ...362
Reverse transition relation is NOT exact ! Due to transitions t32, t34, t36, t38, t40, t42, t44, t47, t51, t53, t55, t57, i0.u0.t140, i0.u1.t139, i1.u4.t13...438
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 163
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 113 transition count 153
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 113 transition count 153
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 106 transition count 146
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 106 transition count 146
Applied a total of 60 rules in 5 ms. Remains 106 /136 variables (removed 30) and now considering 146/176 (removed 30) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-22 12:54:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:54:18] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 12:54:18] [INFO ] Invariant cache hit.
[2024-05-22 12:54:18] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 12:54:18] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-22 12:54:18] [INFO ] Invariant cache hit.
[2024-05-22 12:54:18] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/252 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 100/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/252 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 208 constraints, problems are : Problem set: 0 solved, 145 unsolved in 3536 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/252 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 100/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 145/353 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 353 constraints, problems are : Problem set: 0 solved, 145 unsolved in 2575 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
After SMT, in 6126ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 6128ms
Starting structural reductions in LTL mode, iteration 1 : 106/136 places, 146/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6283 ms. Remains : 106/136 places, 146/176 transitions.
[2024-05-22 12:54:24] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:54:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:54:24] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-22 12:54:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:54:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:54:24] [INFO ] Time to serialize gal into /tmp/CTLFireability11148364193241689811.gal : 3 ms
[2024-05-22 12:54:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6404163688112274474.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/CTLFireability11148364193241689811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6404163688112274474.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,5.8476e+13,6.15548,159072,2,13816,5,971521,6,0,553,583156,0


Converting to forward existential form...Done !
original formula: EX(!(A(AG(((!((p45==1)&&(p141==1)))||((p62==1)&&(p141==1)))) U EX(AF(((p114==1)&&(p142==1)))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(EX(!(EG(!(((p114==1)&&(p142==1)))))))) * !(!(E(TRUE U !(((!((p45==1)&&(p141==1)))||((p62==1)...295
Reverse transition relation is NOT exact ! Due to transitions t32, t34, t36, t38, t40, t42, t44, t46, t47, t49, t53, t55, t57, t123, t126, t131, t132, t133...329
Detected timeout of ITS tools.
[2024-05-22 12:54:54] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:54:54] [INFO ] Applying decomposition
[2024-05-22 12:54:54] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5026430544123927258.txt' '-o' '/tmp/graph5026430544123927258.bin' '-w' '/tmp/graph5026430544123927258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5026430544123927258.bin' '-l' '-1' '-v' '-w' '/tmp/graph5026430544123927258.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:54:54] [INFO ] Decomposing Gal with order
[2024-05-22 12:54:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:54:54] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-22 12:54:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:54:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 2 ms.
[2024-05-22 12:54:54] [INFO ] Time to serialize gal into /tmp/CTLFireability4936103830688955208.gal : 3 ms
[2024-05-22 12:54:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15411444150292746277.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/CTLFireability4936103830688955208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15411444150292746277.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,5.8476e+13,0.075108,7004,262,88,6880,785,261,11943,31,5133,0


Converting to forward existential form...Done !
original formula: EX(!(A(AG(((!((i5.u12.p45==1)&&(i1.u43.p141==1)))||((i7.u18.p62==1)&&(i1.u43.p141==1)))) U EX(AF(((i12.u34.p114==1)&&(i2.u44.p142==1)))))...157
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(EX(!(EG(!(((i12.u34.p114==1)&&(i2.u44.p142==1)))))))) * !(!(E(TRUE U !(((!((i5.u12.p45==1)&&...368
Reverse transition relation is NOT exact ! Due to transitions t32, t34, t36, t38, t40, t42, t44, t46, t49, t53, t55, t57, t123, t126, i0.u1.t138, i1.u4.t13...438
Fast SCC detection found a local 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,23.0274,379748,1,0,523388,48178,1482,2.20474e+06,166,568049,278996
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 166
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 166
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 120 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 120 transition count 160
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 116 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 116 transition count 156
Applied a total of 40 rules in 3 ms. Remains 116 /136 variables (removed 20) and now considering 156/176 (removed 20) transitions.
// Phase 1: matrix 156 rows 116 cols
[2024-05-22 12:55:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:55:18] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 12:55:18] [INFO ] Invariant cache hit.
[2024-05-22 12:55:18] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-22 12:55:18] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-22 12:55:18] [INFO ] Invariant cache hit.
[2024-05-22 12:55:18] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 156/272 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 104/222 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 0/272 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 222 constraints, problems are : Problem set: 0 solved, 155 unsolved in 4041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 156/272 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 104/222 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 155/377 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/272 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 377 constraints, problems are : Problem set: 0 solved, 155 unsolved in 2763 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints]
After SMT, in 6827ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 6828ms
Starting structural reductions in LTL mode, iteration 1 : 116/136 places, 156/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6977 ms. Remains : 116/136 places, 156/176 transitions.
[2024-05-22 12:55:25] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:55:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:55:25] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-22 12:55:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:55:25] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:55:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1202371263873318872.gal : 1 ms
[2024-05-22 12:55:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13240631406064910851.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/CTLFireability1202371263873318872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13240631406064910851.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.19696e+14,5.85735,169256,2,14651,5,1.07352e+06,6,0,601,601330,0


Converting to forward existential form...Done !
original formula: !(A(((((AG(!(AX(((p25==1)&&(p141==1))))) + EX((p121!=1))) + ((!(((p99==1)&&(p141==1))||((p7==1)&&(p141==1))))||(p54==1))) * EX(!(AG(((p79...494
=> equivalent forward existential formula: (([FwdG((FwdU(Init,!((!(EG(!((E(TRUE U ((p2==1)&&(p141==1))) + !(EX(!(((p72==1)&&(p141==1))))))))) * (((((!(EG(!...3320
Reverse transition relation is NOT exact ! Due to transitions t36, t40, t44, t46, t48, t51, t53, t57, t59, t124, t128, t130, t133, t139, t140, t141, t142, ...333
Detected timeout of ITS tools.
[2024-05-22 12:55:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:55:55] [INFO ] Applying decomposition
[2024-05-22 12:55:55] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6012039104546778156.txt' '-o' '/tmp/graph6012039104546778156.bin' '-w' '/tmp/graph6012039104546778156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6012039104546778156.bin' '-l' '-1' '-v' '-w' '/tmp/graph6012039104546778156.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:55:55] [INFO ] Decomposing Gal with order
[2024-05-22 12:55:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:55:55] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-22 12:55:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:55:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 3 ms.
[2024-05-22 12:55:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6829854267340458594.gal : 2 ms
[2024-05-22 12:55:55] [INFO ] Time to serialize properties into /tmp/CTLFireability8477241395554726668.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/CTLFireability6829854267340458594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8477241395554726668.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19696e+14,0.694664,28768,468,80,50778,1677,307,95835,33,8723,0


Converting to forward existential form...Done !
original formula: !(A(((((AG(!(AX(((i3.u8.p25==1)&&(i9.u0.p141==1))))) + EX((i13.i0.u41.p121!=1))) + ((!(((i10.u33.p99==1)&&(i9.u0.p141==1))||((i0.u3.p7==1...715
=> equivalent forward existential formula: (([FwdG((FwdU(Init,!((!(EG(!((E(TRUE U ((i0.u1.p2==1)&&(i9.u0.p141==1))) + !(EX(!(((i8.u24.p72==1)&&(i9.u0.p141=...4614
Reverse transition relation is NOT exact ! Due to transitions t36, t40, t44, t46, t51, t53, t57, t59, t124, t128, t130, t133, i0.u3.t147, i1.t48, i1.u6.t14...466
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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 a local 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,5.90892,200632,1,0,348726,19466,1893,834193,179,219191,286662
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 127 transition count 158
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 118 transition count 158
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 30 place count 107 transition count 147
Iterating global reduction 0 with 11 rules applied. Total rules applied 41 place count 107 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 43 place count 106 transition count 146
Applied a total of 43 rules in 12 ms. Remains 106 /136 variables (removed 30) and now considering 146/176 (removed 30) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-05-22 12:56:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:56:01] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 12:56:01] [INFO ] Invariant cache hit.
[2024-05-22 12:56:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-22 12:56:01] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-22 12:56:01] [INFO ] Redundant transitions in 1 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-22 12:56:01] [INFO ] Invariant cache hit.
[2024-05-22 12:56:01] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/252 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 100/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/252 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 208 constraints, problems are : Problem set: 0 solved, 145 unsolved in 3263 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/252 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 100/208 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 145/353 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 353 constraints, problems are : Problem set: 0 solved, 145 unsolved in 2528 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
After SMT, in 5813ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 5815ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/136 places, 146/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5987 ms. Remains : 106/136 places, 146/176 transitions.
[2024-05-22 12:56:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:56:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:56:07] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-22 12:56:07] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:56:07] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:56:07] [INFO ] Time to serialize gal into /tmp/CTLFireability845833776219634224.gal : 4 ms
[2024-05-22 12:56:07] [INFO ] Time to serialize properties into /tmp/CTLFireability12583572633165156472.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/CTLFireability845833776219634224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12583572633165156472.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.80711e+13,2.44327,77192,2,10369,5,444165,6,0,554,255410,0


Converting to forward existential form...Done !
original formula: !(E(!(EF((((p72==1)&&(p141==1))&&((p23==1)&&(p142==1))))) U ((p53==1) + AG(((p124==1)&&(p142==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U (((p72==1)&&(p141==1))&&((p23==1)&&(p142==1)))))) * (p53==1))] = FALSE * [(FwdU(Init,!(E...264
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t34, t41, t43, t45, t48, t50, t52, t54, t56, t118, t129, t130, t131, t132, t133, t1...325
(forward)formula 0,1,14.7244,395576,1,0,207,2.36691e+06,320,137,3298,1.76511e+06,314
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 166
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 166
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 117 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 117 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 110 transition count 150
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 110 transition count 150
Applied a total of 52 rules in 3 ms. Remains 110 /136 variables (removed 26) and now considering 150/176 (removed 26) transitions.
// Phase 1: matrix 150 rows 110 cols
[2024-05-22 12:56:21] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:56:21] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 12:56:21] [INFO ] Invariant cache hit.
[2024-05-22 12:56:22] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-22 12:56:22] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-22 12:56:22] [INFO ] Invariant cache hit.
[2024-05-22 12:56:22] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/260 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 101/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 213 constraints, problems are : Problem set: 0 solved, 149 unsolved in 3611 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/260 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 101/213 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 149/362 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 362 constraints, problems are : Problem set: 0 solved, 149 unsolved in 2729 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 6355ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 6356ms
Starting structural reductions in LTL mode, iteration 1 : 110/136 places, 150/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6510 ms. Remains : 110/136 places, 150/176 transitions.
[2024-05-22 12:56:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:56:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:56:28] [INFO ] Input system was already deterministic with 150 transitions.
[2024-05-22 12:56:28] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:56:28] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:56:28] [INFO ] Time to serialize gal into /tmp/CTLFireability6860000058744773368.gal : 1 ms
[2024-05-22 12:56:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15680229639118475687.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/CTLFireability6860000058744773368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15680229639118475687.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,7.89919e+13,8.6795,223576,2,26159,5,1.46237e+06,6,0,572,718035,0


Converting to forward existential form...Done !
original formula: (EF(AG(((EF((p81==0)) * (EF((p138==1)) + A(((p68==1)&&(p142==1)) U (p44==1)))) + EX(((p58==1)||(p18==1)))))) * EX((((EX(((AF((p86==1)) + ...326
=> equivalent forward existential formula: ((((([(EY(EY((Init * E(TRUE U !(E(TRUE U !(((E(TRUE U (p81==0)) * (E(TRUE U (p138==1)) + !((E(!((p44==1)) U (!((...1515
Reverse transition relation is NOT exact ! Due to transitions t1, t30, t36, t38, t40, t42, t44, t46, t48, t49, t51, t53, t59, t125, t131, t134, t135, t136,...334
Detected timeout of ITS tools.
[2024-05-22 12:56:58] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:56:58] [INFO ] Applying decomposition
[2024-05-22 12:56:58] [INFO ] Flatten gal took : 2 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/graph11753603318618641734.txt' '-o' '/tmp/graph11753603318618641734.bin' '-w' '/tmp/graph11753603318618641734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11753603318618641734.bin' '-l' '-1' '-v' '-w' '/tmp/graph11753603318618641734.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:56:58] [INFO ] Decomposing Gal with order
[2024-05-22 12:56:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:56:58] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-22 12:56:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:56:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 3 ms.
[2024-05-22 12:56:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9824537666688742027.gal : 1 ms
[2024-05-22 12:56:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15396647364583962292.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/CTLFireability9824537666688742027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15396647364583962292.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,7.89919e+13,0.633829,32932,651,86,77726,307,282,83529,32,2344,0


Converting to forward existential form...Done !
original formula: (EF(AG(((EF((i8.u25.p81==0)) * (EF((i13.u45.p138==1)) + A(((i6.u21.p68==1)&&(i14.u46.p142==1)) U (i4.u13.p44==1)))) + EX(((i5.u18.p58==1)...487
=> equivalent forward existential formula: ((((([(EY(EY((Init * E(TRUE U !(E(TRUE U !(((E(TRUE U (i8.u25.p81==0)) * (E(TRUE U (i13.u45.p138==1)) + !((E(!((...2010
Reverse transition relation is NOT exact ! Due to transitions t36, t38, t40, t42, t44, t46, t48, t49, t51, t53, t59, t125, t131, i0.u2.t141, i1.u0.t142, i1...460
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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,0,5.32119,194236,1,0,439516,1358,1601,728774,160,9233,361196
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 163
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 112 transition count 152
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 112 transition count 152
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 105 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 105 transition count 145
Applied a total of 62 rules in 8 ms. Remains 105 /136 variables (removed 31) and now considering 145/176 (removed 31) transitions.
// Phase 1: matrix 145 rows 105 cols
[2024-05-22 12:57:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:57:03] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 12:57:03] [INFO ] Invariant cache hit.
[2024-05-22 12:57:04] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-22 12:57:04] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-22 12:57:04] [INFO ] Invariant cache hit.
[2024-05-22 12:57:04] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/250 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 99/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 206 constraints, problems are : Problem set: 0 solved, 144 unsolved in 3431 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/250 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 99/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 144/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 350 constraints, problems are : Problem set: 0 solved, 144 unsolved in 2588 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
After SMT, in 6032ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 6033ms
Starting structural reductions in LTL mode, iteration 1 : 105/136 places, 145/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6177 ms. Remains : 105/136 places, 145/176 transitions.
[2024-05-22 12:57:10] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:57:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:57:10] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-22 12:57:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:57:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:57:10] [INFO ] Time to serialize gal into /tmp/CTLFireability6630066138605014663.gal : 0 ms
[2024-05-22 12:57:10] [INFO ] Time to serialize properties into /tmp/CTLFireability16705862621221588191.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/CTLFireability6630066138605014663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16705862621221588191.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,5.43721e+13,5.90773,172580,2,20357,5,1.11582e+06,6,0,548,567083,0


Converting to forward existential form...Done !
original formula: AG(((AG((EG(((p8==0)||(p142==0))) * EF((p113==1)))) + A((((p26!=1) * AX(((p27==1)&&(p141==1)))) + ((p125==1)&&(p141==1))) U AX(!(((p126==...280
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !(((!((E(!(E(TRUE U ((p115==1)&&(p141==1)))) U (!((!(E(TRUE U !(((p115==1)&&(p141==1...1059
Reverse transition relation is NOT exact ! Due to transitions t5, t28, t32, t36, t38, t40, t42, t44, t46, t47, t49, t51, t53, t55, t57, t130, t131, t132, t...326
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-22 12:57:40] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:57:40] [INFO ] Applying decomposition
[2024-05-22 12:57:40] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph834182705314016927.txt' '-o' '/tmp/graph834182705314016927.bin' '-w' '/tmp/graph834182705314016927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph834182705314016927.bin' '-l' '-1' '-v' '-w' '/tmp/graph834182705314016927.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:57:40] [INFO ] Decomposing Gal with order
[2024-05-22 12:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:57:40] [INFO ] Removed a total of 93 redundant transitions.
[2024-05-22 12:57:40] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 16 ms.
[2024-05-22 12:57:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2063823501631338405.gal : 4 ms
[2024-05-22 12:57:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15722440466737313716.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/CTLFireability2063823501631338405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15722440466737313716.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,5.43721e+13,0.834145,19396,223,90,20263,17330,244,61360,36,103549,0


Converting to forward existential form...Done !
original formula: AG(((AG((EG(((i0.u2.p8==0)||(i11.u0.p142==0))) * EF((i11.u33.p113==1)))) + A((((i2.u7.p26!=1) * AX(((i2.u7.p27==1)&&(i0.u1.p141==1)))) + ...396
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !(((!((E(!(E(TRUE U ((i12.u34.p115==1)&&(i0.u1.p141==1)))) U (!((!(E(TRUE U !(((i12....1382
Reverse transition relation is NOT exact ! Due to transitions t32, t36, t38, t40, t42, t44, t46, t47, t49, t51, t53, t55, t57, i0.u1.t137, i1.u4.t136, i2.u...444
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 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,0,13.3247,257580,1,0,218995,143653,1586,1.53555e+06,209,1.31009e+06,74814
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 163
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 112 transition count 152
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 112 transition count 152
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 105 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 105 transition count 145
Applied a total of 62 rules in 8 ms. Remains 105 /136 variables (removed 31) and now considering 145/176 (removed 31) transitions.
[2024-05-22 12:57:53] [INFO ] Invariant cache hit.
[2024-05-22 12:57:53] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-22 12:57:53] [INFO ] Invariant cache hit.
[2024-05-22 12:57:53] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-22 12:57:53] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 234 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/136 places, 145/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 104/136 places, 145/176 transitions.
[2024-05-22 12:57:53] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:57:53] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:57:53] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-22 12:57:53] [INFO ] Flatten gal took : 19 ms
[2024-05-22 12:57:53] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:57:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13055144124656724436.gal : 1 ms
[2024-05-22 12:57:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1688050924530621595.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/CTLFireability13055144124656724436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1688050924530621595.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.
Detected timeout of ITS tools.
[2024-05-22 12:58:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:58:23] [INFO ] Applying decomposition
[2024-05-22 12:58:23] [INFO ] Flatten gal took : 6 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/graph9152232864481619206.txt' '-o' '/tmp/graph9152232864481619206.bin' '-w' '/tmp/graph9152232864481619206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9152232864481619206.bin' '-l' '-1' '-v' '-w' '/tmp/graph9152232864481619206.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:58:23] [INFO ] Decomposing Gal with order
[2024-05-22 12:58:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:58:23] [INFO ] Removed a total of 78 redundant transitions.
[2024-05-22 12:58:23] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:58:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 7 ms.
[2024-05-22 12:58:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9906673583053886713.gal : 4 ms
[2024-05-22 12:58:24] [INFO ] Time to serialize properties into /tmp/CTLFireability15161958405594718671.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/CTLFireability9906673583053886713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15161958405594718671.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,5.43721e+13,0.376617,21352,426,189,32666,9893,212,92293,48,52089,0


Converting to forward existential form...Done !
original formula: AX(EX((!(E((i12.u22.p113==1) U ((i9.u17.p90==1)&&(i3.u4.p141==1)))) * AG(EX((i14.u27.p136==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX((!(E((i12.u22.p113==1) U ((i9.u17.p90==1)&&(i3.u4.p141==1)))) * !(E(TRUE U !(EX((i14.u27.p136=...175
Reverse transition relation is NOT exact ! Due to transitions t28, t32, t36, t38, t40, t42, t47, t49, t51, t53, t55, t57, u3.t136, i1.t46, i1.u0.t137, i1.u...445
(forward)formula 0,0,1.80753,53560,1,0,74408,9893,1146,281465,251,52089,61802
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 129 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 129 transition count 159
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 119 transition count 159
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 31 place count 109 transition count 149
Iterating global reduction 0 with 10 rules applied. Total rules applied 41 place count 109 transition count 149
Applied a total of 41 rules in 14 ms. Remains 109 /136 variables (removed 27) and now considering 149/176 (removed 27) transitions.
// Phase 1: matrix 149 rows 109 cols
[2024-05-22 12:58:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:58:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 12:58:25] [INFO ] Invariant cache hit.
[2024-05-22 12:58:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-22 12:58:25] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-22 12:58:26] [INFO ] Redundant transitions in 1 ms returned []
Running 148 sub problems to find dead transitions.
[2024-05-22 12:58:26] [INFO ] Invariant cache hit.
[2024-05-22 12:58:26] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/258 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 102/213 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 213 constraints, problems are : Problem set: 0 solved, 148 unsolved in 3481 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/258 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 102/213 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 148/361 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 361 constraints, problems are : Problem set: 0 solved, 148 unsolved in 2626 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 6121ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 6123ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/136 places, 149/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6297 ms. Remains : 109/136 places, 149/176 transitions.
[2024-05-22 12:58:32] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:58:32] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:58:32] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-22 12:58:32] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:58:32] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:58:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14407173808190837899.gal : 1 ms
[2024-05-22 12:58:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9163847588526801817.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/CTLFireability14407173808190837899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9163847588526801817.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,2.2817e+13,1.3119,47872,2,4258,5,297694,6,0,567,144678,0


Converting to forward existential form...Done !
original formula: EG(EF(((((p72==0)||(p141==0))&&((p44==1)||(p103==1)))||((((p54==1)&&(p61==1))&&((p94==1)&&(p142==1)))&&(p11==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((p72==0)||(p141==0))&&((p44==1)||(p103==1)))||((((p54==1)&&(p61==1))&&((p94==1)&&(p142==1...182
Reverse transition relation is NOT exact ! Due to transitions t7, t32, t34, t36, t40, t42, t46, t47, t49, t53, t57, t119, t130, t131, t132, t133, t134, t13...324
Detected timeout of ITS tools.
[2024-05-22 12:59:02] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:59:02] [INFO ] Applying decomposition
[2024-05-22 12:59:02] [INFO ] Flatten gal took : 2 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/graph1544385567935744979.txt' '-o' '/tmp/graph1544385567935744979.bin' '-w' '/tmp/graph1544385567935744979.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1544385567935744979.bin' '-l' '-1' '-v' '-w' '/tmp/graph1544385567935744979.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:59:02] [INFO ] Decomposing Gal with order
[2024-05-22 12:59:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:59:02] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-22 12:59:02] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:59:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 2 ms.
[2024-05-22 12:59:02] [INFO ] Time to serialize gal into /tmp/CTLFireability10152163346137259572.gal : 2 ms
[2024-05-22 12:59:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16886904105023372719.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/CTLFireability10152163346137259572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16886904105023372719.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.2817e+13,0.06288,6528,361,102,5317,508,285,12786,36,4558,0


Converting to forward existential form...Done !
original formula: EG(EF(((((i8.u23.p72==0)||(i0.u1.p141==0))&&((i5.u13.p44==1)||(i2.u0.p103==1)))||((((i6.u16.p54==1)&&(i7.i0.u19.p61==1))&&((i10.u30.p94==...199
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((i8.u23.p72==0)||(i0.u1.p141==0))&&((i5.u13.p44==1)||(i2.u0.p103==1)))||((((i6.u16.p54==1...248
Reverse transition relation is NOT exact ! Due to transitions t32, t34, t36, t40, t42, t46, t49, t53, t57, t103, t118, i0.u1.t138, i1.i0.u3.t137, i1.i1.u5....457
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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,3.96403,112920,1,0,252919,1660,1549,337083,177,15901,185119
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 127 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 116 transition count 156
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 36 place count 103 transition count 143
Iterating global reduction 0 with 13 rules applied. Total rules applied 49 place count 103 transition count 143
Applied a total of 49 rules in 17 ms. Remains 103 /136 variables (removed 33) and now considering 143/176 (removed 33) transitions.
// Phase 1: matrix 143 rows 103 cols
[2024-05-22 12:59:06] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 12:59:06] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 12:59:06] [INFO ] Invariant cache hit.
[2024-05-22 12:59:06] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-22 12:59:06] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-22 12:59:06] [INFO ] Redundant transitions in 0 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-22 12:59:06] [INFO ] Invariant cache hit.
[2024-05-22 12:59:06] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/246 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 204 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3237 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/246 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 142/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/246 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 346 constraints, problems are : Problem set: 0 solved, 142 unsolved in 2459 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 5719ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 5721ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/136 places, 143/176 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5881 ms. Remains : 103/136 places, 143/176 transitions.
[2024-05-22 12:59:12] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:59:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:59:12] [INFO ] Input system was already deterministic with 143 transitions.
RANDOM walk for 733 steps (3 resets) in 8 ms. (81 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 12:59:12] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:59:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:59:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15091236887003135124.gal : 0 ms
[2024-05-22 12:59:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17058983530441111437.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/ReachabilityCardinality15091236887003135124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17058983530441111437.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 12:59:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:59:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:59:12] [INFO ] Applying decomposition
[2024-05-22 12:59:12] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16395361553347705433.txt' '-o' '/tmp/graph16395361553347705433.bin' '-w' '/tmp/graph16395361553347705433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16395361553347705433.bin' '-l' '-1' '-v' '-w' '/tmp/graph16395361553347705433.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:59:12] [INFO ] Decomposing Gal with order
[2024-05-22 12:59:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:59:12] [INFO ] Removed a total of 104 redundant transitions.
[2024-05-22 12:59:12] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:59:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 4 ms.
[2024-05-22 12:59:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10481835710368725275.gal : 2 ms
[2024-05-22 12:59:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2927225575281834891.ctl : 8 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/CTLFireability10481835710368725275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2927225575281834891.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 2 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.28741e+14,0.17171,11808,358,101,19872,639,307,23863,41,3077,0


Converting to forward existential form...Done !
original formula: !(A(((!(AX(((i3.u13.p31==1)||((i11.u43.p108==1)&&(i5.u21.p142==1))))) + !(((((i1.i0.u4.p11==1)&&(i4.i0.u17.p41==1)) + AF(((i2.u9.p23==1)&...516
=> equivalent forward existential formula: ((([(((FwdU(Init,!(((((i8.u30.p74!=1) * EX(!(((i9.i0.u33.p83==1)&&(i5.u21.p142==1))))) * !(E(!(((i14.u52.p135==1...2397
Reverse transition relation is NOT exact ! Due to transitions t132, t134, t141, t149, i0.u0.t164, i0.u2.t163, i1.i0.u4.t162, i1.i1.u6.t161, i2.u11.t166, i3...553
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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,28.0056,760336,1,0,1.58481e+06,4573,1846,1.79944e+06,190,39929,919897
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(AX(!(((EG(A(((i12.i1.u46.p117==1)&&(i10.u8.p141==1)) U ((i2.u12.p28==1)&&(i5.u21.p142==1)))) * (i1.i1.u6.p16==1)) * (i10.u8.p141==1))))...220
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((EG(!((E(!(((i2.u12.p28==1)&&(i5.u21.p142==1))) U (!(((i12.i1.u46.p117==1)&&(i10.u8.p141==...377
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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 1,1,36.5012,1006984,1,0,2.12476e+06,4728,2012,2.39521e+06,194,42039,1233423
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 612543 ms.

BK_STOP 1716382788880

--------------------
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="DiscoveryGPU-PT-14a"
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 DiscoveryGPU-PT-14a, 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 r136-tall-171631132800490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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