About the Execution of ITS-Tools for DiscoveryGPU-PT-11a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1207.703 | 406600.00 | 441476.00 | 1119.20 | FFTTFFTTTTFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132700442.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-11a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132700442
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 8.5K Apr 12 02:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 02:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 02:36 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 39K 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-11a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716377942076
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-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 11:39:03] [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 11:39:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:39:03] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-22 11:39:03] [INFO ] Transformed 113 places.
[2024-05-22 11:39:03] [INFO ] Transformed 155 transitions.
[2024-05-22 11:39:03] [INFO ] Found NUPN structural information;
[2024-05-22 11:39:03] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 76 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 15 place count 111 transition count 142
Applied a total of 15 rules in 25 ms. Remains 111 /113 variables (removed 2) and now considering 142/155 (removed 13) transitions.
// Phase 1: matrix 142 rows 111 cols
[2024-05-22 11:39:03] [INFO ] Computed 2 invariants in 11 ms
[2024-05-22 11:39:03] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-22 11:39:03] [INFO ] Invariant cache hit.
[2024-05-22 11:39:03] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-22 11:39:03] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2024-05-22 11:39:03] [INFO ] Invariant cache hit.
[2024-05-22 11:39:03] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/253 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 88/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 201 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 88/88 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/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/253 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 88/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 141/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 342 constraints, problems are : Problem set: 0 solved, 141 unsolved in 2606 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
After SMT, in 6201ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 6217ms
Starting structural reductions in LTL mode, iteration 1 : 111/113 places, 142/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6634 ms. Remains : 111/113 places, 142/155 transitions.
Support contains 76 out of 111 places after structural reductions.
[2024-05-22 11:39:10] [INFO ] Flatten gal took : 28 ms
[2024-05-22 11:39:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:39:10] [INFO ] Input system was already deterministic with 142 transitions.
Support contains 73 out of 111 places (down from 76) after GAL structural reductions.
RANDOM walk for 15781 steps (134 resets) in 508 ms. (31 steps per ms) remains 0/76 properties
[2024-05-22 11:39:10] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:39:10] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:39:10] [INFO ] Input system was already deterministic with 142 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 310 edges and 111 vertex of which 102 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Graph (complete) has 310 edges and 111 vertex of which 102 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
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 110 edges and 99 vertex of which 77 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Graph (trivial) has 86 edges and 77 vertex of which 42 / 77 are part of one of the 21 SCC in 2 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 56 transition count 99
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 48 place count 45 transition count 78
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 57 place count 36 transition count 60
Iterating global reduction 2 with 9 rules applied. Total rules applied 66 place count 36 transition count 60
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 27 transition count 42
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 27 transition count 42
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 93 place count 18 transition count 24
Iterating global reduction 2 with 9 rules applied. Total rules applied 102 place count 18 transition count 24
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 111 place count 9 transition count 15
Iterating global reduction 2 with 9 rules applied. Total rules applied 120 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 121 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 122 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 123 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 125 place count 6 transition count 11
Applied a total of 125 rules in 31 ms. Remains 6 /111 variables (removed 105) and now considering 11/142 (removed 131) transitions.
[2024-05-22 11:39:10] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2024-05-22 11:39:10] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 11:39:10] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 11:39:10] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2024-05-22 11:39:10] [INFO ] Invariant cache hit.
[2024-05-22 11:39:10] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-22 11:39:10] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-22 11:39:10] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2024-05-22 11:39:10] [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) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 60 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) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 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 111ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/111 places, 11/142 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 188 ms. Remains : 6/111 places, 11/142 transitions.
[2024-05-22 11:39:10] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:39:10] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:39:10] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 200 steps (4 resets) in 8 ms. (22 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 11:39:10] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:39:10] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:39:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7766323189507026427.gal : 0 ms
[2024-05-22 11:39:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7729990066163258990.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/ReachabilityCardinality7766323189507026427.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7729990066163258990.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 91 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 91 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 83 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 83 transition count 114
Applied a total of 56 rules in 10 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 11:39:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:39:10] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 11:39:10] [INFO ] Invariant cache hit.
[2024-05-22 11:39:11] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:39:11] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 157 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/111 places, 114/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 82/111 places, 114/142 transitions.
[2024-05-22 11:39:11] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:39:11] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:39:11] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-22 11:39:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:39:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:39:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14517096466547726156.gal : 2 ms
[2024-05-22 11:39:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4818796562620683160.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/CTLFireability14517096466547726156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4818796562620683160.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,6.89376e+10,1.86971,64496,2,15540,5,436789,6,0,430,196066,0
Converting to forward existential form...Done !
original formula: AX(EF(AG(AF((p66==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(!(EG(!((p66==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t31, t33, t34, t36, t38, t40, t42, t44, t102, t103, t104, t105, t106, t107, t1...288
Detected timeout of ITS tools.
[2024-05-22 11:39:41] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:39:41] [INFO ] Applying decomposition
[2024-05-22 11:39:41] [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/graph5404141588377401410.txt' '-o' '/tmp/graph5404141588377401410.bin' '-w' '/tmp/graph5404141588377401410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5404141588377401410.bin' '-l' '-1' '-v' '-w' '/tmp/graph5404141588377401410.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:39:41] [INFO ] Decomposing Gal with order
[2024-05-22 11:39:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:39:41] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-22 11:39:41] [INFO ] Flatten gal took : 58 ms
[2024-05-22 11:39:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 7 ms.
[2024-05-22 11:39:41] [INFO ] Time to serialize gal into /tmp/CTLFireability7224418475966654481.gal : 5 ms
[2024-05-22 11:39:41] [INFO ] Time to serialize properties into /tmp/CTLFireability9150797607613733441.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/CTLFireability7224418475966654481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9150797607613733441.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.89376e+10,0.148966,11056,346,80,15457,2256,181,39977,45,11364,0
Converting to forward existential form...Done !
original formula: AX(EF(AG(AF((i0.u13.p66==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(!(EG(!((i0.u13.p66==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t31, t33, t36, t40, t42, t44, i0.t34, i0.t29, i0.u0.t107, i0.u1.t108, i0.u13.t104, ...369
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
(forward)formula 0,0,3.60311,168384,1,0,266916,42949,1061,1.03944e+06,253,366926,115981
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-01 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 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 91 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 91 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 83 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 83 transition count 114
Applied a total of 56 rules in 14 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
[2024-05-22 11:39:45] [INFO ] Invariant cache hit.
[2024-05-22 11:39:45] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 11:39:45] [INFO ] Invariant cache hit.
[2024-05-22 11:39:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:39:45] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-22 11:39:45] [INFO ] Invariant cache hit.
[2024-05-22 11:39:45] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/197 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 163 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2455 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/197 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 113/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 276 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1718 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 4191ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 4192ms
Starting structural reductions in LTL mode, iteration 1 : 83/111 places, 114/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4378 ms. Remains : 83/111 places, 114/142 transitions.
[2024-05-22 11:39:49] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:39:49] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:39:49] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-22 11:39:49] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:39:49] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:39:49] [INFO ] Time to serialize gal into /tmp/CTLFireability18222387053993161549.gal : 2 ms
[2024-05-22 11:39:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16485775514264654639.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/CTLFireability18222387053993161549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16485775514264654639.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.89376e+10,1.02935,39444,2,5250,5,223972,6,0,432,133956,0
Converting to forward existential form...Done !
original formula: EG(AG((AX(EF(((p109==0)||(p111==0)))) + ((p14==1)&&(p112==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((!(EX(!(E(TRUE U ((p109==0)||(p111==0)))))) + ((p14==1)&&(p112==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t31, t33, t34, t36, t38, t40, t42, t44, t102, t103, t104, t105, t106, t107, t1...288
(forward)formula 0,1,4.65954,134960,1,0,164,697201,254,111,2740,705796,246
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 92 transition count 123
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 86 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 86 transition count 117
Applied a total of 50 rules in 6 ms. Remains 86 /111 variables (removed 25) and now considering 117/142 (removed 25) transitions.
// Phase 1: matrix 117 rows 86 cols
[2024-05-22 11:39:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:39:54] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 11:39:54] [INFO ] Invariant cache hit.
[2024-05-22 11:39:54] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 11:39:54] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/111 places, 117/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 85/111 places, 117/142 transitions.
[2024-05-22 11:39:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:39:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:39:54] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-22 11:39:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:39:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:39:54] [INFO ] Time to serialize gal into /tmp/CTLFireability5650273967875348990.gal : 2 ms
[2024-05-22 11:39:54] [INFO ] Time to serialize properties into /tmp/CTLFireability2005539983077158138.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/CTLFireability5650273967875348990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2005539983077158138.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.80741e+10,3.19934,100640,2,27710,5,618094,6,0,445,363019,0
Converting to forward existential form...Done !
original formula: A(!(AG(((EF(((p17==1)&&(p111==1))) * AF((p23==1))) + (EX((p16==1)) * !(((p102==1)&&(p111==1))))))) U EF(AG(AF((p86!=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(E(TRUE U !(!(EG(!((p86!=1)))))))))))) * !(E(!(E(TRUE U !(E(TRUE U !(!(EG(!((p86!=1))...353
Reverse transition relation is NOT exact ! Due to transitions t18, t23, t29, t31, t33, t36, t38, t40, t42, t44, t46, t93, t98, t105, t106, t107, t108, t109...298
(forward)formula 0,1,23.0745,586208,1,0,329,2.69565e+06,268,177,2734,3.57079e+06,448
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 91 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 91 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 84 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 84 transition count 115
Applied a total of 54 rules in 21 ms. Remains 84 /111 variables (removed 27) and now considering 115/142 (removed 27) transitions.
// Phase 1: matrix 115 rows 84 cols
[2024-05-22 11:40:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:40:17] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 11:40:17] [INFO ] Invariant cache hit.
[2024-05-22 11:40:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:40:17] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/111 places, 115/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 83/111 places, 115/142 transitions.
[2024-05-22 11:40:17] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:40:17] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:40:17] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-22 11:40:17] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:40:17] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:40:17] [INFO ] Time to serialize gal into /tmp/CTLFireability7236848354420839020.gal : 2 ms
[2024-05-22 11:40:17] [INFO ] Time to serialize properties into /tmp/CTLFireability16362762106606560644.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/CTLFireability7236848354420839020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16362762106606560644.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.54807e+10,6.21065,185456,2,43822,5,1.16996e+06,6,0,435,693473,0
Converting to forward existential form...Done !
original formula: AG(AX((p103==0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !((p103==0)))] = FALSE
(forward)formula 0,0,8.39454,185456,1,0,9,1.16996e+06,9,2,767,693473,2
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 134
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 95 transition count 126
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 95 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 89 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 89 transition count 120
Applied a total of 44 rules in 5 ms. Remains 89 /111 variables (removed 22) and now considering 120/142 (removed 22) transitions.
// Phase 1: matrix 120 rows 89 cols
[2024-05-22 11:40:26] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:40:26] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 11:40:26] [INFO ] Invariant cache hit.
[2024-05-22 11:40:26] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-22 11:40:26] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-22 11:40:26] [INFO ] Invariant cache hit.
[2024-05-22 11:40:26] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 120/209 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/209 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 171 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2474 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 120/209 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 119/290 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 290 constraints, problems are : Problem set: 0 solved, 119 unsolved in 1846 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 4356ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 4358ms
Starting structural reductions in LTL mode, iteration 1 : 89/111 places, 120/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4506 ms. Remains : 89/111 places, 120/142 transitions.
[2024-05-22 11:40:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:40:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:40:30] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-22 11:40:30] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:40:30] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:40:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1569576446917773863.gal : 1 ms
[2024-05-22 11:40:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3948036520788810229.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/CTLFireability1569576446917773863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3948036520788810229.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.10424e+11,1.84564,65656,2,11891,5,377637,6,0,462,248160,0
Converting to forward existential form...Done !
original formula: E(EF(!(((!((((p82==1)&&(p111==1))||(p98==1))) * AF(((p12==1)&&(p111==1)))) + !((AF((p26==1)) + AX(((p33==1)&&(p112==1)))))))) U ((EG((!(A...450
=> equivalent forward existential formula: [(((FwdU(Init,E(TRUE U !(((!((((p82==1)&&(p111==1))||(p98==1))) * !(EG(!(((p12==1)&&(p111==1)))))) + !((!(EG(!((...737
Reverse transition relation is NOT exact ! Due to transitions t14, t17, t25, t29, t33, t37, t38, t44, t46, t48, t96, t100, t102, t108, t109, t110, t111, t1...300
Detected timeout of ITS tools.
[2024-05-22 11:41:00] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:41:00] [INFO ] Applying decomposition
[2024-05-22 11:41:00] [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/graph4271580029154609606.txt' '-o' '/tmp/graph4271580029154609606.bin' '-w' '/tmp/graph4271580029154609606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4271580029154609606.bin' '-l' '-1' '-v' '-w' '/tmp/graph4271580029154609606.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:41:00] [INFO ] Decomposing Gal with order
[2024-05-22 11:41:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:41:00] [INFO ] Removed a total of 76 redundant transitions.
[2024-05-22 11:41:00] [INFO ] Flatten gal took : 25 ms
[2024-05-22 11:41:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 5 ms.
[2024-05-22 11:41:01] [INFO ] Time to serialize gal into /tmp/CTLFireability3682235946089859524.gal : 2 ms
[2024-05-22 11:41:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10257747005645304599.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/CTLFireability3682235946089859524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10257747005645304599.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10424e+11,0.60512,25276,645,99,42983,2157,225,83274,32,16318,0
Converting to forward existential form...Done !
original formula: E(EF(!(((!((((i9.u28.p82==1)&&(i4.u0.p111==1))||(i10.u34.p98==1))) * AF(((i2.u5.p12==1)&&(i4.u0.p111==1)))) + !((AF((i3.u10.p26==1)) + AX...642
=> equivalent forward existential formula: [(((FwdU(Init,E(TRUE U !(((!((((i9.u28.p82==1)&&(i4.u0.p111==1))||(i10.u34.p98==1))) * !(EG(!(((i2.u5.p12==1)&&(...997
Reverse transition relation is NOT exact ! Due to transitions t29, t33, t37, t38, t44, t46, t48, t96, t100, t102, i0.t25, i0.u12.t14, i0.u12.t17, i1.u3.t11...399
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 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
(forward)formula 0,0,4.79992,138532,1,0,206419,13947,1219,667566,164,107877,166784
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 93 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 93 transition count 124
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 89 transition count 120
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 89 transition count 120
Applied a total of 44 rules in 4 ms. Remains 89 /111 variables (removed 22) and now considering 120/142 (removed 22) transitions.
// Phase 1: matrix 120 rows 89 cols
[2024-05-22 11:41:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:41:06] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-22 11:41:06] [INFO ] Invariant cache hit.
[2024-05-22 11:41:06] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 11:41:06] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-22 11:41:06] [INFO ] Invariant cache hit.
[2024-05-22 11:41:06] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 120/209 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/209 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 170 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2531 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 120/209 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 119/289 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 289 constraints, problems are : Problem set: 0 solved, 119 unsolved in 1806 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 4369ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 4371ms
Starting structural reductions in LTL mode, iteration 1 : 89/111 places, 120/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4775 ms. Remains : 89/111 places, 120/142 transitions.
[2024-05-22 11:41:10] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:41:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:41:10] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-22 11:41:10] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:41:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:41:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15822107457381278712.gal : 1 ms
[2024-05-22 11:41:10] [INFO ] Time to serialize properties into /tmp/CTLFireability13896966615926476281.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/CTLFireability15822107457381278712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13896966615926476281.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11212e+11,3.04624,102956,2,17792,5,693279,6,0,462,337087,0
Converting to forward existential form...Done !
original formula: (A(AG((((!((p59==1)&&(p111==1)))&&(p39==1))&&(p111==1))) U ((!(((p3==1)&&(p112==1))) + AF(((((p47==1)&&(p111==1))||((p74==1)&&(p112==1)))...575
=> equivalent forward existential formula: [(((FwdU((Init * !((E(!(((!(((p3==1)&&(p112==1))) + !(EG(!(((((p47==1)&&(p111==1))||((p74==1)&&(p112==1)))||(((p...1608
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t15, t23, t26, t30, t34, t41, t43, t45, t47, t100, t101, t108, t109, t110, t111, t112...298
Detected timeout of ITS tools.
[2024-05-22 11:41:40] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:41:40] [INFO ] Applying decomposition
[2024-05-22 11:41:40] [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/graph6193983407074191741.txt' '-o' '/tmp/graph6193983407074191741.bin' '-w' '/tmp/graph6193983407074191741.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6193983407074191741.bin' '-l' '-1' '-v' '-w' '/tmp/graph6193983407074191741.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:41:40] [INFO ] Decomposing Gal with order
[2024-05-22 11:41:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:41:40] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-22 11:41:40] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:41:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 3 ms.
[2024-05-22 11:41:40] [INFO ] Time to serialize gal into /tmp/CTLFireability10713938039623973158.gal : 2 ms
[2024-05-22 11:41:40] [INFO ] Time to serialize properties into /tmp/CTLFireability16777727190863464541.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/CTLFireability10713938039623973158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16777727190863464541.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.11212e+11,1.11279,40844,1708,485,63419,15188,236,179637,38,90895,0
Converting to forward existential form...Done !
original formula: (A(AG((((!((i6.u19.p59==1)&&(i3.u35.p111==1)))&&(i4.u13.p39==1))&&(i3.u35.p111==1))) U ((!(((i0.u0.p3==1)&&(i0.u36.p112==1))) + AF(((((i5...847
=> equivalent forward existential formula: [(((FwdU((Init * !((E(!(((!(((i0.u0.p3==1)&&(i0.u36.p112==1))) + !(EG(!(((((i5.u15.p47==1)&&(i3.u35.p111==1))||(...2268
Reverse transition relation is NOT exact ! Due to transitions t30, t34, t41, t43, t45, t47, t101, i0.t23, i0.u0.t3, i0.u0.t6, i0.u0.t15, i0.u0.t26, i1.u2.t...410
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 104 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 104 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 98 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 98 transition count 129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 94 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 94 transition count 125
Applied a total of 34 rules in 9 ms. Remains 94 /111 variables (removed 17) and now considering 125/142 (removed 17) transitions.
// Phase 1: matrix 125 rows 94 cols
[2024-05-22 11:42:10] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:42:10] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 11:42:10] [INFO ] Invariant cache hit.
[2024-05-22 11:42:10] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-22 11:42:10] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-05-22 11:42:10] [INFO ] Invariant cache hit.
[2024-05-22 11:42:10] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/219 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 82/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 178 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2547 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/219 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 82/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 124/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 302 constraints, problems are : Problem set: 0 solved, 124 unsolved in 1969 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 4530ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 4532ms
Starting structural reductions in LTL mode, iteration 1 : 94/111 places, 125/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4696 ms. Remains : 94/111 places, 125/142 transitions.
[2024-05-22 11:42:15] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:42:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:42:15] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-22 11:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:42:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1919001662695413244.gal : 1 ms
[2024-05-22 11:42:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9359224113584309963.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/CTLFireability1919001662695413244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9359224113584309963.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.39162e+11,0.863103,34864,2,4262,5,200094,6,0,484,113949,0
Converting to forward existential form...Done !
original formula: (AG(EF((p31==0))) + EG(A((((p84==1)&&(p112==1)) + AG((p94!=1))) U (E((p41!=1) U (p71==1)) + !((AX((p76==1)) + EF(((p2==1)&&(p111==1))))))...158
=> equivalent forward existential formula: [(FwdU((Init * !(EG(!((E(!((E((p41!=1) U (p71==1)) + !((!(EX(!((p76==1)))) + E(TRUE U ((p2==1)&&(p111==1))))))) ...440
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t33, t37, t40, t44, t48, t100, t102, t110, t111, t112, t113, t114, t115, t116, t117...299
(forward)formula 0,1,3.30101,103464,1,0,172,540849,271,115,2857,544184,263
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 134
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 98 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 98 transition count 129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 94 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 94 transition count 125
Applied a total of 34 rules in 2 ms. Remains 94 /111 variables (removed 17) and now considering 125/142 (removed 17) transitions.
// Phase 1: matrix 125 rows 94 cols
[2024-05-22 11:42:18] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:42:18] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 11:42:18] [INFO ] Invariant cache hit.
[2024-05-22 11:42:18] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-22 11:42:18] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-05-22 11:42:18] [INFO ] Invariant cache hit.
[2024-05-22 11:42:19] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/219 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 82/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 178 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2671 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/219 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 82/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 124/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 302 constraints, problems are : Problem set: 0 solved, 124 unsolved in 1992 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 4687ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 4688ms
Starting structural reductions in LTL mode, iteration 1 : 94/111 places, 125/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4808 ms. Remains : 94/111 places, 125/142 transitions.
[2024-05-22 11:42:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:42:23] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:42:23] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-22 11:42:23] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:42:23] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:42:23] [INFO ] Time to serialize gal into /tmp/CTLFireability16466484740692258027.gal : 4 ms
[2024-05-22 11:42:23] [INFO ] Time to serialize properties into /tmp/CTLFireability200202564306158098.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/CTLFireability16466484740692258027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability200202564306158098.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.44913e+11,2.56592,89632,2,18300,5,577041,6,0,485,279504,0
Converting to forward existential form...Done !
original formula: (EG(EF(((((p83==1)&&(p112==1))&&((p42==1)&&(p111==1)))||((p22==1)&&(p111==1))))) * AF(((!(E(!(((p9==1)&&(p111==1))) U AF(((p90==1)&&(p111...362
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U ((((p83==1)&&(p112==1))&&((p42==1)&&(p111==1)))||((p22==1)&&(p111==1)))))))] = FALSE * [...595
Reverse transition relation is NOT exact ! Due to transitions t6, t26, t34, t39, t41, t43, t47, t49, t100, t103, t107, t111, t112, t113, t114, t115, t116, ...303
Detected timeout of ITS tools.
[2024-05-22 11:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:42:53] [INFO ] Applying decomposition
[2024-05-22 11:42:53] [INFO ] Flatten gal took : 18 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/graph10461476932746101349.txt' '-o' '/tmp/graph10461476932746101349.bin' '-w' '/tmp/graph10461476932746101349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10461476932746101349.bin' '-l' '-1' '-v' '-w' '/tmp/graph10461476932746101349.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:42:53] [INFO ] Decomposing Gal with order
[2024-05-22 11:42:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:42:53] [INFO ] Removed a total of 78 redundant transitions.
[2024-05-22 11:42:53] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:42:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 4 ms.
[2024-05-22 11:42:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17172781869700443873.gal : 3 ms
[2024-05-22 11:42:53] [INFO ] Time to serialize properties into /tmp/CTLFireability914936957173036886.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/CTLFireability17172781869700443873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability914936957173036886.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.44913e+11,0.191922,11092,291,52,16614,570,255,24309,32,3831,0
Converting to forward existential form...Done !
original formula: (EG(EF(((((i0.u28.p83==1)&&(i0.u0.p112==1))&&((i5.i0.u14.p42==1)&&(i4.u39.p111==1)))||((i3.u7.p22==1)&&(i4.u39.p111==1))))) * AF(((!(E(!(...537
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U ((((i0.u28.p83==1)&&(i0.u0.p112==1))&&((i5.i0.u14.p42==1)&&(i4.u39.p111==1)))||((i3.u7.p...826
Reverse transition relation is NOT exact ! Due to transitions t34, t39, t41, t43, t47, t49, t100, t103, t107, i0.t26, i0.u28.t6, i1.u2.t119, i2.u5.t120, i3...414
Fast SCC detection found a local 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 a local 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 a local 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
(forward)formula 0,1,8.72867,274300,1,0,520215,1775,1554,819025,159,9905,345121
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 97 transition count 128
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 97 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 91 transition count 122
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 91 transition count 122
Applied a total of 40 rules in 3 ms. Remains 91 /111 variables (removed 20) and now considering 122/142 (removed 20) transitions.
// Phase 1: matrix 122 rows 91 cols
[2024-05-22 11:43:02] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:43:02] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 11:43:02] [INFO ] Invariant cache hit.
[2024-05-22 11:43:02] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-22 11:43:02] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-22 11:43:02] [INFO ] Invariant cache hit.
[2024-05-22 11:43:02] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/213 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 81/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 174 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2685 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/213 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 81/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 121/295 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 295 constraints, problems are : Problem set: 0 solved, 121 unsolved in 1916 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 4616ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 4617ms
Starting structural reductions in LTL mode, iteration 1 : 91/111 places, 122/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4749 ms. Remains : 91/111 places, 122/142 transitions.
[2024-05-22 11:43:07] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:43:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:43:07] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-22 11:43:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:43:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:43:07] [INFO ] Time to serialize gal into /tmp/CTLFireability1040994893528497879.gal : 1 ms
[2024-05-22 11:43:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17352191861230884015.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/CTLFireability1040994893528497879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17352191861230884015.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.22191e+11,1.49963,50548,2,6647,5,320841,6,0,471,155095,0
Converting to forward existential form...Done !
original formula: AF((EF(AX(((p52==1)&&(p111==1)))) * (((EF(AX(((p45==0)||(p111==0)))) + AF(((p12==1)&&(p111==1)))) + ((p1==1)||((p13==1)&&(p112==1)))) + (...206
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U !(EX(!(((p52==1)&&(p111==1)))))) * (((E(TRUE U !(EX(!(((p45==0)||(p111==0)))))) + !(EG(!(...287
Reverse transition relation is NOT exact ! Due to transitions t5, t19, t29, t33, t35, t37, t42, t46, t48, t99, t102, t105, t109, t110, t111, t112, t113, t1...300
Detected timeout of ITS tools.
[2024-05-22 11:43:37] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:43:37] [INFO ] Applying decomposition
[2024-05-22 11:43:37] [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/graph15681455250912828707.txt' '-o' '/tmp/graph15681455250912828707.bin' '-w' '/tmp/graph15681455250912828707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15681455250912828707.bin' '-l' '-1' '-v' '-w' '/tmp/graph15681455250912828707.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:43:37] [INFO ] Decomposing Gal with order
[2024-05-22 11:43:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:43:37] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-22 11:43:37] [INFO ] Flatten gal took : 17 ms
[2024-05-22 11:43:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 2 ms.
[2024-05-22 11:43:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14558481487393815987.gal : 10 ms
[2024-05-22 11:43:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16308028933764422394.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14558481487393815987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16308028933764422394.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.22191e+11,0.076172,7076,320,71,6839,736,229,12923,32,4770,0
Converting to forward existential form...Done !
original formula: AF((EF(AX(((i6.u18.p52==1)&&(i4.u37.p111==1)))) * (((EF(AX(((i5.u15.p45==0)||(i4.u37.p111==0)))) + AF(((i1.u4.p12==1)&&(i4.u37.p111==1)))...292
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U !(EX(!(((i6.u18.p52==1)&&(i4.u37.p111==1)))))) * (((E(TRUE U !(EX(!(((i5.u15.p45==0)||(i4...373
Reverse transition relation is NOT exact ! Due to transitions t29, t33, t35, t37, t42, t46, t48, t99, t102, t105, i0.u0.t114, i0.u2.t115, i1.u6.t117, i2.t1...398
Fast SCC detection found a local 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
(forward)formula 0,1,4.08148,117428,1,0,211988,1918,1331,410092,156,15683,148076
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 134
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 95 transition count 126
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 95 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 89 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 89 transition count 120
Applied a total of 44 rules in 3 ms. Remains 89 /111 variables (removed 22) and now considering 120/142 (removed 22) transitions.
// Phase 1: matrix 120 rows 89 cols
[2024-05-22 11:43:41] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:43:41] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 11:43:41] [INFO ] Invariant cache hit.
[2024-05-22 11:43:41] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-22 11:43:41] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 192 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/111 places, 120/142 transitions.
Applied a total of 0 rules in 0 ms. Remains 88 /88 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 195 ms. Remains : 88/111 places, 120/142 transitions.
[2024-05-22 11:43:41] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:43:41] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:43:41] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-22 11:43:41] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:43:41] [INFO ] Flatten gal took : 16 ms
[2024-05-22 11:43:41] [INFO ] Time to serialize gal into /tmp/CTLFireability6825881496322707402.gal : 1 ms
[2024-05-22 11:43:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14612819873066904065.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/CTLFireability6825881496322707402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14612819873066904065.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.01122e+11,1.28645,50928,2,10709,5,347359,6,0,458,147305,0
Converting to forward existential form...Done !
original formula: EX(AG(!(E(!(((p4==1)&&(p21==1))) U AX((p51==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(E(!(((p4==1)&&(p21==1))) U !(EX(!((p51==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t33, t36, t38, t40, t44, t46, t106, t107, t108, t109, t110, t111, t112, t113, ...290
Detected timeout of ITS tools.
[2024-05-22 11:44:11] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:44:11] [INFO ] Applying decomposition
[2024-05-22 11:44:11] [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/graph59367973369058221.txt' '-o' '/tmp/graph59367973369058221.bin' '-w' '/tmp/graph59367973369058221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph59367973369058221.bin' '-l' '-1' '-v' '-w' '/tmp/graph59367973369058221.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:44:11] [INFO ] Decomposing Gal with order
[2024-05-22 11:44:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:44:11] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-22 11:44:11] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:44:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 2 ms.
[2024-05-22 11:44:12] [INFO ] Time to serialize gal into /tmp/CTLFireability16875671205101099353.gal : 1 ms
[2024-05-22 11:44:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2959610447032815720.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/CTLFireability16875671205101099353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2959610447032815720.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01122e+11,0.067568,6896,259,70,7489,1157,182,14547,45,4393,0
Converting to forward existential form...Done !
original formula: EX(AG(!(E(!(((i0.u1.p4==1)&&(i3.u5.p21==1))) U AX((i6.u12.p51==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(E(!(((i0.u1.p4==1)&&(i3.u5.p21==1))) U !(EX(!((i6.u12.p51==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t38, t40, t44, t46, i0.t36, i0.t33, i0.u0.t112, i0.u1.t113, i0.u10.t109, i2.u3...389
(forward)formula 0,0,5.12757,209612,1,0,342220,24537,1040,1.3132e+06,237,211486,119408
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Graph (complete) has 310 edges and 111 vertex of which 103 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 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 103 transition count 123
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 92 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 32 place count 83 transition count 114
Iterating global reduction 0 with 9 rules applied. Total rules applied 41 place count 83 transition count 114
Applied a total of 41 rules in 12 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 11:44:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:44:17] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 11:44:17] [INFO ] Invariant cache hit.
[2024-05-22 11:44:17] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 11:44:17] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-22 11:44:17] [INFO ] Redundant transitions in 2 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-22 11:44:17] [INFO ] Invariant cache hit.
[2024-05-22 11:44:17] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/197 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 164 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/197 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 113/277 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 277 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1885 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 4096ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 4097ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/111 places, 114/142 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4337 ms. Remains : 83/111 places, 114/142 transitions.
[2024-05-22 11:44:21] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:44:21] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:44:21] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-22 11:44:21] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:44:21] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:44:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14508447489694433534.gal : 1 ms
[2024-05-22 11:44:21] [INFO ] Time to serialize properties into /tmp/CTLFireability18326439567099298760.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/CTLFireability14508447489694433534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18326439567099298760.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,2.41592e+10,0.515867,22400,2,3052,5,115413,6,0,432,63056,0
Converting to forward existential form...Done !
original formula: E((!(((AF(((p97==1)&&(p111==1))) + !(EF(((p57==1)&&(p111==1))))) + (!(AG(((p94==1)&&(p112==1)))) + (EF(((p24==1)||((p109==1)&&(p111==1)))...278
=> equivalent forward existential formula: [(FwdU(Init,(!(((!(EG(!(((p97==1)&&(p111==1))))) + !(E(TRUE U ((p57==1)&&(p111==1))))) + (!(!(E(TRUE U !(((p94==...396
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t28, t30, t32, t33, t35, t37, t39, t41, t100, t101, t102, t103, t104, t105, t106, t...289
(forward)formula 0,1,8.09339,253092,1,0,561,1.44656e+06,271,312,2678,1.66878e+06,690
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 91 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 91 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 83 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 83 transition count 114
Applied a total of 56 rules in 6 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 11:44:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:44:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 11:44:29] [INFO ] Invariant cache hit.
[2024-05-22 11:44:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:44:29] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/111 places, 114/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 82/111 places, 114/142 transitions.
[2024-05-22 11:44:29] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:44:29] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:44:29] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-22 11:44:29] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:44:29] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:44:29] [INFO ] Time to serialize gal into /tmp/CTLFireability8149913772163448371.gal : 1 ms
[2024-05-22 11:44:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13217805817971636649.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/CTLFireability8149913772163448371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13217805817971636649.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,6.89376e+10,1.95072,63996,2,15540,5,436789,6,0,430,196066,0
Converting to forward existential form...Done !
original formula: EX((AX(((p110==0)||(p111==0))) + (p64==0)))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(((p110==0)||(p111==0))))))] != FALSE + [(EY(Init) * (p64==0))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t31, t33, t34, t36, t38, t40, t42, t44, t102, t103, t104, t105, t106, t107, t1...288
(forward)formula 0,1,8.38704,215472,1,0,164,1.04843e+06,246,109,2541,1.32116e+06,237
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 91 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 91 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 83 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 83 transition count 114
Applied a total of 56 rules in 9 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
[2024-05-22 11:44:38] [INFO ] Invariant cache hit.
[2024-05-22 11:44:38] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 11:44:38] [INFO ] Invariant cache hit.
[2024-05-22 11:44:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 11:44:38] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-22 11:44:38] [INFO ] Invariant cache hit.
[2024-05-22 11:44:38] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/197 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 163 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2279 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/197 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 113/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 276 constraints, problems are : Problem set: 0 solved, 113 unsolved in 1633 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 3946ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 3949ms
Starting structural reductions in LTL mode, iteration 1 : 83/111 places, 114/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4092 ms. Remains : 83/111 places, 114/142 transitions.
[2024-05-22 11:44:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:44:42] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:44:42] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-22 11:44:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:44:42] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:44:42] [INFO ] Time to serialize gal into /tmp/CTLFireability15921550468360961948.gal : 1 ms
[2024-05-22 11:44:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10440656766410716018.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/CTLFireability15921550468360961948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10440656766410716018.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.89376e+10,1.08417,39424,2,5250,5,223972,6,0,432,133956,0
Converting to forward existential form...Done !
original formula: (EX(AX(!(E((((p64==1)&&(p112==1))||((p106==1)&&(p111==1))) U AX(((p20==1)&&(p111==1))))))) + EF(AX((p88==1))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(!(E((((p64==1)&&(p112==1))||((p106==1)&&(p111==1))) U !(EX(!(((p20==1)&&(p111==1)))))))))))...218
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t31, t33, t34, t36, t38, t40, t42, t44, t102, t103, t104, t105, t106, t107, t1...288
(forward)formula 0,1,17.9989,512436,1,0,489,3.03541e+06,249,273,2602,3.56468e+06,568
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Graph (complete) has 310 edges and 111 vertex of which 102 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 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 102 transition count 123
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 92 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 30 place count 83 transition count 114
Iterating global reduction 0 with 9 rules applied. Total rules applied 39 place count 83 transition count 114
Applied a total of 39 rules in 21 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 11:45:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:45:00] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 11:45:00] [INFO ] Invariant cache hit.
[2024-05-22 11:45:00] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 11:45:00] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 168 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/111 places, 114/142 transitions.
Applied a total of 0 rules in 10 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 227 ms. Remains : 82/111 places, 114/142 transitions.
[2024-05-22 11:45:00] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:45:00] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:45:00] [INFO ] Input system was already deterministic with 114 transitions.
RANDOM walk for 580 steps (2 resets) in 8 ms. (64 steps per ms) remains 0/1 properties
[2024-05-22 11:45:00] [INFO ] Flatten gal took : 2 ms
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 11:45:00] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:45:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14035963395436300589.gal : 5 ms
[2024-05-22 11:45:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality706369546538106964.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14035963395436300589.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality706369546538106964.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 93 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 93 transition count 124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 87 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 87 transition count 118
Applied a total of 48 rules in 2 ms. Remains 87 /111 variables (removed 24) and now considering 118/142 (removed 24) transitions.
// Phase 1: matrix 118 rows 87 cols
[2024-05-22 11:45:00] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:45:00] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 11:45:00] [INFO ] Invariant cache hit.
[2024-05-22 11:45:00] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 11:45:00] [INFO ] Implicit Places using invariants and state equation in 88 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/111 places, 118/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 86/111 places, 118/142 transitions.
[2024-05-22 11:45:00] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:45:00] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:45:01] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-22 11:45:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:45:01] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:45:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16245892446430125238.gal : 1 ms
[2024-05-22 11:45:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1361249926553466035.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/CTLFireability16245892446430125238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1361249926553466035.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,9.57124e+10,2.22335,72720,2,18014,5,450040,6,0,450,259265,0
Converting to forward existential form...Done !
original formula: !(E((((p56==1)&&(p111==1)) + EX((p13==1))) U !((!(A(E(((p19==1)&&(p111==1)) U (p104==1)) U !(((p85==1)&&(p111==1))))) + ((AF((p43==1)) + ...216
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,(((p56==1)&&(p111==1)) + EX((p13==1)))) * !(!(!((E(!(!(((p85==1)&&(p111==1)))) U (!(E(((p19==...560
Reverse transition relation is NOT exact ! Due to transitions t13, t21, t24, t28, t30, t32, t37, t41, t43, t45, t47, t98, t99, t106, t107, t108, t109, t110...298
Detected timeout of ITS tools.
[2024-05-22 11:45:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:45:31] [INFO ] Applying decomposition
[2024-05-22 11:45:31] [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/graph4528988502412455405.txt' '-o' '/tmp/graph4528988502412455405.bin' '-w' '/tmp/graph4528988502412455405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4528988502412455405.bin' '-l' '-1' '-v' '-w' '/tmp/graph4528988502412455405.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:45:31] [INFO ] Decomposing Gal with order
[2024-05-22 11:45:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:45:31] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-22 11:45:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:45:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 2 ms.
[2024-05-22 11:45:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9124956260626118518.gal : 1 ms
[2024-05-22 11:45:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5141210008190142598.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/CTLFireability9124956260626118518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5141210008190142598.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,9.57124e+10,0.292371,15852,887,153,26778,1786,222,54044,46,12626,0
Converting to forward existential form...Done !
original formula: !(E((((i5.u13.p56==1)&&(i2.u0.p111==1)) + EX((i2.u1.p13==1))) U !((!(A(E(((u5.p19==1)&&(i2.u0.p111==1)) U (i12.u23.p104==1)) U !(((i10.u1...293
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,(((i5.u13.p56==1)&&(i2.u0.p111==1)) + EX((i2.u1.p13==1)))) * !(!(!((E(!(!(((i10.u19.p85==1)&&...743
Reverse transition relation is NOT exact ! Due to transitions t24, t28, t30, t32, t37, t47, t98, u10.t114, i1.u2.t112, i2.t99, i2.u0.t111, i2.u1.t13, i2.u1...404
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
(forward)formula 0,1,15.8974,421352,1,0,544070,25097,1219,3.03586e+06,231,121491,265617
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
[2024-05-22 11:45:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:45:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:45:47] [INFO ] Applying decomposition
[2024-05-22 11:45:47] [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/graph2760912159097185521.txt' '-o' '/tmp/graph2760912159097185521.bin' '-w' '/tmp/graph2760912159097185521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2760912159097185521.bin' '-l' '-1' '-v' '-w' '/tmp/graph2760912159097185521.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:45:47] [INFO ] Decomposing Gal with order
[2024-05-22 11:45:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:45:47] [INFO ] Removed a total of 84 redundant transitions.
[2024-05-22 11:45:47] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:45:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 3 ms.
[2024-05-22 11:45:47] [INFO ] Time to serialize gal into /tmp/CTLFireability15939256689700492120.gal : 2 ms
[2024-05-22 11:45:47] [INFO ] Time to serialize properties into /tmp/CTLFireability18294650331138842656.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/CTLFireability15939256689700492120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18294650331138842656.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.78667e+11,0.048678,4600,152,24,1630,108,278,2164,34,324,0
Converting to forward existential form...Done !
original formula: (A(AG((((!((u23.p59==1)&&(i1.u3.p111==1)))&&(i4.u15.p39==1))&&(i1.u3.p111==1))) U ((!(((i0.u0.p3==1)&&(i6.u6.p112==1))) + AF(((((i5.u18.p...845
=> equivalent forward existential formula: [(((FwdU((Init * !((E(!(((!(((i0.u0.p3==1)&&(i6.u6.p112==1))) + !(EG(!(((((i5.u18.p47==1)&&(i1.u3.p111==1))||((i...2258
Reverse transition relation is NOT exact ! Due to transitions t103, t105, i0.u0.t130, i0.u1.t131, i1.t112, i1.u3.t132, i1.u5.t133, i3.u8.t129, i3.u10.t128,...451
Using saturation style SCC detection
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 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 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
(forward)formula 0,1,1.43059,72180,1,0,161059,243,1986,193344,160,929,168828
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 405406 ms.
BK_STOP 1716378348676
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-11a"
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-11a, 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-171631132700442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11a.tgz
mv DiscoveryGPU-PT-11a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;