About the Execution of ITS-Tools for DiscoveryGPU-PT-13a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1183.004 | 484881.00 | 521040.00 | 1247.30 | FTFFTTFTTFFFTTTF | 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-171631132700474.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-13a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132700474
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 13K Apr 12 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 02:42 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 46K 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-13a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716380850209
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-13a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 12:27:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 12:27:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:27:31] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-22 12:27:31] [INFO ] Transformed 133 places.
[2024-05-22 12:27:31] [INFO ] Transformed 183 transitions.
[2024-05-22 12:27:31] [INFO ] Found NUPN structural information;
[2024-05-22 12:27:31] [INFO ] Parsed PT model containing 133 places and 183 transitions and 588 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 181
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 129 transition count 179
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 129 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 21 place count 129 transition count 166
Applied a total of 21 rules in 28 ms. Remains 129 /133 variables (removed 4) and now considering 166/183 (removed 17) transitions.
// Phase 1: matrix 166 rows 129 cols
[2024-05-22 12:27:31] [INFO ] Computed 2 invariants in 10 ms
[2024-05-22 12:27:31] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 12:27:31] [INFO ] Invariant cache hit.
[2024-05-22 12:27:31] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-22 12:27:31] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-22 12:27:31] [INFO ] Invariant cache hit.
[2024-05-22 12:27:31] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/295 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 102/233 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 233 constraints, problems are : Problem set: 0 solved, 165 unsolved in 4706 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/295 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 102/233 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 165/398 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 398 constraints, problems are : Problem set: 0 solved, 165 unsolved in 3226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 7991ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 8007ms
Starting structural reductions in LTL mode, iteration 1 : 129/133 places, 166/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8414 ms. Remains : 129/133 places, 166/183 transitions.
Support contains 71 out of 129 places after structural reductions.
[2024-05-22 12:27:40] [INFO ] Flatten gal took : 29 ms
[2024-05-22 12:27:40] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:27:40] [INFO ] Input system was already deterministic with 166 transitions.
Support contains 70 out of 129 places (down from 71) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 69 to 68
RANDOM walk for 40000 steps (291 resets) in 1208 ms. (33 steps per ms) remains 2/68 properties
BEST_FIRST walk for 40004 steps (19 resets) in 107 ms. (370 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
[2024-05-22 12:27:40] [INFO ] Invariant cache hit.
[2024-05-22 12:27:40] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/19 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/25 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/29 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/35 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/39 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/44 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/44 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp46 is UNSAT
After SMT solving in domain Real declared 72/295 variables, and 49 constraints, problems are : Problem set: 1 solved, 0 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 34/129 constraints, ReadFeed: 15/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-22 12:27:40] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:27:40] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:27:40] [INFO ] Input system was already deterministic with 166 transitions.
Computed a total of 16 stabilizing places and 14 stable transitions
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 130 edges and 115 vertex of which 91 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Graph (trivial) has 102 edges and 91 vertex of which 50 / 91 are part of one of the 25 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 66 transition count 117
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 56 place count 53 transition count 92
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 67 place count 42 transition count 70
Iterating global reduction 2 with 11 rules applied. Total rules applied 78 place count 42 transition count 70
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 31 transition count 48
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 31 transition count 48
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 111 place count 20 transition count 26
Iterating global reduction 2 with 11 rules applied. Total rules applied 122 place count 20 transition count 26
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 133 place count 9 transition count 15
Iterating global reduction 2 with 11 rules applied. Total rules applied 144 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 145 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 146 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 147 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 149 place count 6 transition count 11
Applied a total of 149 rules in 21 ms. Remains 6 /129 variables (removed 123) and now considering 11/166 (removed 155) transitions.
[2024-05-22 12:27:40] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2024-05-22 12:27:40] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 12:27:40] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-22 12:27:40] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2024-05-22 12:27:40] [INFO ] Invariant cache hit.
[2024-05-22 12:27:40] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2024-05-22 12:27:40] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-22 12:27:40] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2024-05-22 12:27:40] [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 54 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 42 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/129 places, 11/166 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 158 ms. Remains : 6/129 places, 11/166 transitions.
[2024-05-22 12:27:41] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:27:41] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:27:41] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 219 steps (4 resets) in 8 ms. (24 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 12:27:41] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:27:41] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:27:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11845674136113736130.gal : 1 ms
[2024-05-22 12:27:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15708759956069066529.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/ReachabilityCardinality11845674136113736130.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15708759956069066529.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 ...330
Loading property file /tmp/ReachabilityCardinality15708759956069066529.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.009407,3380,2,9,5,35,6,0,30,20,0
Total reachable state count : 6
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 114 transition count 151
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 114 transition count 151
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 108 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 108 transition count 145
Applied a total of 42 rules in 12 ms. Remains 108 /129 variables (removed 21) and now considering 145/166 (removed 21) transitions.
// Phase 1: matrix 145 rows 108 cols
[2024-05-22 12:27:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:27:41] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 12:27:41] [INFO ] Invariant cache hit.
[2024-05-22 12:27:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-22 12:27:41] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-22 12:27:41] [INFO ] Invariant cache hit.
[2024-05-22 12:27:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/253 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 96/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 206 constraints, problems are : Problem set: 0 solved, 144 unsolved in 3327 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/253 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 96/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 144/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 350 constraints, problems are : Problem set: 0 solved, 144 unsolved in 2540 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
After SMT, in 5890ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 5893ms
Starting structural reductions in LTL mode, iteration 1 : 108/129 places, 145/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6049 ms. Remains : 108/129 places, 145/166 transitions.
[2024-05-22 12:27:47] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:27:47] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:27:47] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-22 12:27:47] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:27:47] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:27:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3908752554170899098.gal : 3 ms
[2024-05-22 12:27:47] [INFO ] Time to serialize properties into /tmp/CTLFireability11979255127685459889.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/CTLFireability3908752554170899098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11979255127685459889.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.18044e+13,3.29994,105856,2,10748,5,604469,6,0,558,386443,0
Converting to forward existential form...Done !
original formula: E(EG(!(EX(((AX((p14==1)) * (p41==1)) * ((p8==1)&&(p132==1)))))) U ((!(((((!(EG(((p52==1)&&(p131==1)))) * (p60==1)) * (p131==1)) + !(AG((p...245
=> equivalent forward existential formula: ((([FwdG((((FwdU(Init,EG(!(EX(((!(EX(!((p14==1)))) * (p41==1)) * ((p8==1)&&(p132==1))))))) * ((p131==1)&&(p59==1...782
Reverse transition relation is NOT exact ! Due to transitions t35, t37, t43, t44, t46, t48, t52, t54, t56, t119, t123, t128, t129, t130, t131, t132, t133, ...321
Detected timeout of ITS tools.
[2024-05-22 12:28:17] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:28:17] [INFO ] Applying decomposition
[2024-05-22 12:28:17] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5415647794565639696.txt' '-o' '/tmp/graph5415647794565639696.bin' '-w' '/tmp/graph5415647794565639696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5415647794565639696.bin' '-l' '-1' '-v' '-w' '/tmp/graph5415647794565639696.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:28:17] [INFO ] Decomposing Gal with order
[2024-05-22 12:28:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:28:17] [INFO ] Removed a total of 92 redundant transitions.
[2024-05-22 12:28:17] [INFO ] Flatten gal took : 36 ms
[2024-05-22 12:28:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 9 ms.
[2024-05-22 12:28:17] [INFO ] Time to serialize gal into /tmp/CTLFireability12337215097507825433.gal : 4 ms
[2024-05-22 12:28:17] [INFO ] Time to serialize properties into /tmp/CTLFireability5582219777139440009.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/CTLFireability12337215097507825433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5582219777139440009.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.18044e+13,0.115137,8832,261,76,10555,1212,277,20085,33,6128,0
Converting to forward existential form...Done !
original formula: E(EG(!(EX(((AX((i2.u4.p14==1)) * (i5.u13.p41==1)) * ((u3.p8==1)&&(i0.u0.p132==1)))))) U ((!(((((!(EG(((i6.u17.p52==1)&&(i3.u44.p131==1)))...354
=> equivalent forward existential formula: ((([FwdG((((FwdU(Init,EG(!(EX(((!(EX(!((i2.u4.p14==1)))) * (i5.u13.p41==1)) * ((u3.p8==1)&&(i0.u0.p132==1)))))))...1037
Reverse transition relation is NOT exact ! Due to transitions t35, t37, t43, t46, t48, t52, t54, t56, t119, t123, i0.t44, i0.u2.t138, i2.u5.t139, i3.u8.t13...456
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
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,1.39083,61104,1,0,96596,6486,1755,312271,184,63456,94983
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 118 transition count 155
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 118 transition count 155
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 109 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 109 transition count 146
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 100 transition count 137
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 100 transition count 137
Applied a total of 58 rules in 13 ms. Remains 100 /129 variables (removed 29) and now considering 137/166 (removed 29) transitions.
// Phase 1: matrix 137 rows 100 cols
[2024-05-22 12:28:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:28:18] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 12:28:18] [INFO ] Invariant cache hit.
[2024-05-22 12:28:18] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-22 12:28:18] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-22 12:28:18] [INFO ] Invariant cache hit.
[2024-05-22 12:28:18] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/237 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 93/195 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 195 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3057 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/237 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 93/195 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 136/331 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 331 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2288 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 5365ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 5367ms
Starting structural reductions in LTL mode, iteration 1 : 100/129 places, 137/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5528 ms. Remains : 100/129 places, 137/166 transitions.
[2024-05-22 12:28:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:28:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:28:24] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 12:28:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:28:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:28:24] [INFO ] Time to serialize gal into /tmp/CTLFireability11498478751033172170.gal : 1 ms
[2024-05-22 12:28:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3499851736662822931.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/CTLFireability11498478751033172170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3499851736662822931.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.82094e+12,3.38848,110652,2,11452,5,673852,6,0,520,342065,0
Converting to forward existential form...Done !
original formula: AG(EF(EX(A(EX((p101==1)) U AF(((p114==1)&&(p132==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(!((E(!(!(EG(!(((p114==1)&&(p132==1)))))) U (!(EX((p101==1))) * !(!(EG(!(((p114...234
Reverse transition relation is NOT exact ! Due to transitions t30, t34, t36, t38, t40, t41, t43, t45, t47, t49, t51, t53, t122, t123, t124, t125, t126, t12...312
Detected timeout of ITS tools.
[2024-05-22 12:28:54] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:28:54] [INFO ] Applying decomposition
[2024-05-22 12:28:54] [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/graph3556964087065829422.txt' '-o' '/tmp/graph3556964087065829422.bin' '-w' '/tmp/graph3556964087065829422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3556964087065829422.bin' '-l' '-1' '-v' '-w' '/tmp/graph3556964087065829422.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:28:54] [INFO ] Decomposing Gal with order
[2024-05-22 12:28:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:28:54] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-22 12:28:54] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:28:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 5 ms.
[2024-05-22 12:28:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8227832703792092931.gal : 3 ms
[2024-05-22 12:28:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10474631527149065072.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/CTLFireability8227832703792092931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10474631527149065072.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,6.82094e+12,0.133938,10092,249,98,10072,4914,255,33592,36,24940,0
Converting to forward existential form...Done !
original formula: AG(EF(EX(A(EX((i11.i0.u30.p101==1)) U AF(((i12.u34.p114==1)&&(i1.u0.p132==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(!((E(!(!(EG(!(((i12.u34.p114==1)&&(i1.u0.p132==1)))))) U (!(EX((i11.i0.u30.p10...287
Reverse transition relation is NOT exact ! Due to transitions t30, t34, t36, t38, t40, t41, t45, t47, t49, t51, t53, i0.u1.t130, i1.t43, i1.u0.t129, i1.u4....425
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,24.0781,782068,1,0,470843,101889,1455,7.59444e+06,220,2.15958e+06,163352
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 157
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 112 transition count 149
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 112 transition count 149
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 106 transition count 143
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 106 transition count 143
Applied a total of 46 rules in 16 ms. Remains 106 /129 variables (removed 23) and now considering 143/166 (removed 23) transitions.
// Phase 1: matrix 143 rows 106 cols
[2024-05-22 12:29:18] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 12:29:18] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 12:29:18] [INFO ] Invariant cache hit.
[2024-05-22 12:29:18] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-22 12:29:18] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-22 12:29:18] [INFO ] Invariant cache hit.
[2024-05-22 12:29:18] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/249 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 94/202 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 202 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3278 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/249 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 94/202 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 142/344 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 344 constraints, problems are : Problem set: 0 solved, 142 unsolved in 2427 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 5723ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 5724ms
Starting structural reductions in LTL mode, iteration 1 : 106/129 places, 143/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5875 ms. Remains : 106/129 places, 143/166 transitions.
[2024-05-22 12:29:24] [INFO ] Flatten gal took : 18 ms
[2024-05-22 12:29:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:29:24] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-22 12:29:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:29:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:29:24] [INFO ] Time to serialize gal into /tmp/CTLFireability6767871796860852868.gal : 3 ms
[2024-05-22 12:29:24] [INFO ] Time to serialize properties into /tmp/CTLFireability18285261789766558802.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/CTLFireability6767871796860852868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18285261789766558802.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.08158e+13,4.00931,123100,2,13221,5,744605,6,0,549,431053,0
Converting to forward existential form...Done !
original formula: A(A(((p58!=1) * !(E(AX(((p95==1)&&(p131==1))) U (((p25==1)&&(p131==1))||(p71==1))))) U EF(((p105==1)&&(p131==1)))) U (!((EX((((p43==1)&&(...433
=> equivalent forward existential formula: [((Init * !(EG(!((!((EX((((p43==1)&&(p132==1))||(p91!=1))) * (E(TRUE U (((p54==1)&&(p64==1))&&(p132==1))) + ((p2...1464
Reverse transition relation is NOT exact ! Due to transitions t5, t20, t25, t30, t34, t38, t40, t45, t47, t49, t51, t57, t127, t128, t129, t130, t131, t132...317
Detected timeout of ITS tools.
[2024-05-22 12:29:54] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:29:54] [INFO ] Applying decomposition
[2024-05-22 12:29:54] [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/graph10911789580582924566.txt' '-o' '/tmp/graph10911789580582924566.bin' '-w' '/tmp/graph10911789580582924566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10911789580582924566.bin' '-l' '-1' '-v' '-w' '/tmp/graph10911789580582924566.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:29:54] [INFO ] Decomposing Gal with order
[2024-05-22 12:29:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:29:54] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-22 12:29:54] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:29:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 4 ms.
[2024-05-22 12:29:54] [INFO ] Time to serialize gal into /tmp/CTLFireability16679895113243231241.gal : 2 ms
[2024-05-22 12:29:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17657767661858556976.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/CTLFireability16679895113243231241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17657767661858556976.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.08158e+13,4.9849,159092,497,248,86512,127036,275,714902,44,1.62435e+06,0
Converting to forward existential form...Done !
original formula: A(A(((i6.u18.p58!=1) * !(E(AX(((i10.i0.u30.p95==1)&&(i0.u1.p131==1))) U (((i3.u7.p25==1)&&(i0.u1.p131==1))||(i8.i0.u22.p71==1))))) U EF((...634
=> equivalent forward existential formula: [((Init * !(EG(!((!((EX((((i2.u6.p43==1)&&(i2.u0.p132==1))||(i10.i0.u29.p91!=1))) * (E(TRUE U (((i6.u16.p54==1)&...2059
Reverse transition relation is NOT exact ! Due to transitions t34, t38, t40, t45, t47, t49, t51, t57, i0.u1.t134, i1.u4.t135, i2.t30, i2.u6.t5, i2.u6.t20, ...462
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 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 118 transition count 144
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 107 transition count 144
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 35 place count 95 transition count 132
Iterating global reduction 0 with 12 rules applied. Total rules applied 47 place count 95 transition count 132
Applied a total of 47 rules in 15 ms. Remains 95 /129 variables (removed 34) and now considering 132/166 (removed 34) transitions.
// Phase 1: matrix 132 rows 95 cols
[2024-05-22 12:30:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:30:24] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 12:30:24] [INFO ] Invariant cache hit.
[2024-05-22 12:30:24] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 12:30:24] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-22 12:30:24] [INFO ] Redundant transitions in 4 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-22 12:30:24] [INFO ] Invariant cache hit.
[2024-05-22 12:30:24] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 132/227 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 92/189 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 189 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2765 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 132/227 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 92/189 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 131/320 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 320 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 4903ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 4904ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/129 places, 132/166 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5057 ms. Remains : 95/129 places, 132/166 transitions.
[2024-05-22 12:30:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:30:29] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:30:29] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-22 12:30:29] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 857 steps (4 resets) in 15 ms. (53 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 12:30:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:30:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13705460294154727023.gal : 0 ms
[2024-05-22 12:30:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2776392572445543464.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/ReachabilityCardinality13705460294154727023.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2776392572445543464.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 ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 157
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 112 transition count 149
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 112 transition count 149
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 105 transition count 142
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 105 transition count 142
Applied a total of 48 rules in 5 ms. Remains 105 /129 variables (removed 24) and now considering 142/166 (removed 24) transitions.
// Phase 1: matrix 142 rows 105 cols
[2024-05-22 12:30:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:30:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 12:30:29] [INFO ] Invariant cache hit.
[2024-05-22 12:30:30] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-22 12:30:30] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2024-05-22 12:30:30] [INFO ] Invariant cache hit.
[2024-05-22 12:30:30] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/247 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 94/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/247 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 201 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3344 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 94/94 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/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/247 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 94/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 141/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 342 constraints, problems are : Problem set: 0 solved, 141 unsolved in 2436 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
After SMT, in 5797ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 5798ms
Starting structural reductions in LTL mode, iteration 1 : 105/129 places, 142/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5938 ms. Remains : 105/129 places, 142/166 transitions.
[2024-05-22 12:30:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:30:35] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:30:35] [INFO ] Input system was already deterministic with 142 transitions.
[2024-05-22 12:30:35] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:30:35] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:30:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11400593925758212878.gal : 1 ms
[2024-05-22 12:30:35] [INFO ] Time to serialize properties into /tmp/CTLFireability2698637315652600708.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/CTLFireability11400593925758212878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2698637315652600708.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.96104e+12,7.31153,222572,2,28293,5,1.50935e+06,6,0,544,692238,0
Converting to forward existential form...Done !
original formula: (EF(((p33==1)&&(p132==1))) + (EG(((AX(((p8==1)&&(p28==1))) * ((((p32==0)||(p131==0))&&((p94==0)||(p132==0))) + EF(((p79==0)||(p131==0))))...461
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((p33==1)&&(p132==1)))] != FALSE + ([(((Init * EG(((!(EX(!(((p8==1)&&(p28==1))))) * ((((p32...1686
(forward)formula 0,1,7.33539,222572,1,0,7,1.50935e+06,8,1,550,692238,1
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 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 118 transition count 145
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 108 transition count 145
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 33 place count 96 transition count 133
Iterating global reduction 0 with 12 rules applied. Total rules applied 45 place count 96 transition count 133
Applied a total of 45 rules in 19 ms. Remains 96 /129 variables (removed 33) and now considering 133/166 (removed 33) transitions.
// Phase 1: matrix 133 rows 96 cols
[2024-05-22 12:30:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:30:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 12:30:43] [INFO ] Invariant cache hit.
[2024-05-22 12:30:43] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 12:30:43] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-22 12:30:43] [INFO ] Redundant transitions in 3 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-22 12:30:43] [INFO ] Invariant cache hit.
[2024-05-22 12:30:43] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 92/190 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/229 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 190 constraints, problems are : Problem set: 0 solved, 132 unsolved in 2823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 92/190 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 132/322 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 322 constraints, problems are : Problem set: 0 solved, 132 unsolved in 1972 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 4809ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 4811ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/129 places, 133/166 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4953 ms. Remains : 96/129 places, 133/166 transitions.
[2024-05-22 12:30:48] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:30:48] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:30:48] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-22 12:30:48] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:30:48] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:30:48] [INFO ] Time to serialize gal into /tmp/CTLFireability16667248132521091781.gal : 1 ms
[2024-05-22 12:30:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15646078750830856714.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/CTLFireability16667248132521091781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15646078750830856714.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.61491e+12,1.36273,51860,2,6852,5,290713,6,0,502,166477,0
Converting to forward existential form...Done !
original formula: (EF((A(!(((p36==1)&&(p131==1))) U (((p43==1)&&(p132==1))&&(p56==1))) + (p46==1))) * A(!(EF(((p65==1)&&(p131==1)))) U !(((p0==1) + AG(((p6...177
=> equivalent forward existential formula: [(((Init * E(TRUE U (!((E(!((((p43==1)&&(p132==1))&&(p56==1))) U (!(!(((p36==1)&&(p131==1)))) * !((((p43==1)&&(p...477
Reverse transition relation is NOT exact ! Due to transitions t17, t29, t31, t33, t35, t39, t40, t42, t44, t46, t48, t50, t52, t119, t120, t121, t122, t123...311
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-22 12:31:18] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:31:18] [INFO ] Applying decomposition
[2024-05-22 12:31:18] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9272399530138152493.txt' '-o' '/tmp/graph9272399530138152493.bin' '-w' '/tmp/graph9272399530138152493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9272399530138152493.bin' '-l' '-1' '-v' '-w' '/tmp/graph9272399530138152493.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:31:18] [INFO ] Decomposing Gal with order
[2024-05-22 12:31:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:31:18] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-22 12:31:18] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:31:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 2 ms.
[2024-05-22 12:31:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10527031664726290749.gal : 1 ms
[2024-05-22 12:31:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9011575596838115487.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/CTLFireability10527031664726290749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9011575596838115487.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.61491e+12,0.100132,8732,390,131,7774,1127,236,29517,36,11655,0
Converting to forward existential form...Done !
original formula: (EF((A(!(((i4.u10.p36==1)&&(i0.u1.p131==1))) U (((i2.u0.p43==1)&&(i2.u0.p132==1))&&(i6.u16.p56==1))) + (i5.u13.p46==1))) * A(!(EF(((i7.u1...248
=> equivalent forward existential formula: [(((Init * E(TRUE U (!((E(!((((i2.u0.p43==1)&&(i2.u0.p132==1))&&(i6.u16.p56==1))) U (!(!(((i4.u10.p36==1)&&(i0.u...624
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t33, t35, t40, t42, t44, t46, t48, t50, t52, t111, i0.u1.t125, i1.u4.t126, i2.t39, ...410
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,1.21102,51236,1,0,75350,3012,1410,291568,178,22405,64271
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 154
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 154
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 107 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 107 transition count 144
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 97 transition count 134
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 97 transition count 134
Applied a total of 64 rules in 9 ms. Remains 97 /129 variables (removed 32) and now considering 134/166 (removed 32) transitions.
// Phase 1: matrix 134 rows 97 cols
[2024-05-22 12:31:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:31:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 12:31:19] [INFO ] Invariant cache hit.
[2024-05-22 12:31:19] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 12:31:19] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [96]
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 : 96/129 places, 134/166 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 96/129 places, 134/166 transitions.
[2024-05-22 12:31:19] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:31:19] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:31:19] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-22 12:31:19] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:31:19] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:31:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6883900603688658828.gal : 1 ms
[2024-05-22 12:31:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5268809131454268032.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/CTLFireability6883900603688658828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5268809131454268032.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,5.54695e+12,9.04789,254920,2,55545,5,1.85338e+06,6,0,504,778280,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 12:31:49] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:31:49] [INFO ] Applying decomposition
[2024-05-22 12:31:49] [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/graph1306086469074141981.txt' '-o' '/tmp/graph1306086469074141981.bin' '-w' '/tmp/graph1306086469074141981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1306086469074141981.bin' '-l' '-1' '-v' '-w' '/tmp/graph1306086469074141981.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:31:49] [INFO ] Decomposing Gal with order
[2024-05-22 12:31:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:31:49] [INFO ] Removed a total of 74 redundant transitions.
[2024-05-22 12:31:49] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:31:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 2 ms.
[2024-05-22 12:31:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10779694063434800944.gal : 1 ms
[2024-05-22 12:31:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14134665993739114248.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/CTLFireability10779694063434800944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14134665993739114248.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,5.54695e+12,0.15365,10972,477,94,16756,2180,197,30985,45,9205,0
Converting to forward existential form...Done !
original formula: EF(EG(A(AX((((i2.u4.p20==1)&&(i2.u3.p131==1))||((i5.u10.p49==1)&&(i2.u3.p131==1)))) U AF(((i8.u16.p77==1)&&(i2.u3.p131==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!(!(EG(!(((i8.u16.p77==1)&&(i2.u3.p131==1)))))) U (!(!(EX(!((((i2.u4.p20==1)&&(i2.u3....324
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t35, t37, t39, t40, t42, t46, t48, t50, t52, i0.t44, i0.t33, i0.u0.t126, i0.u7.t129...411
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
Fast SCC detection found an SCC at level 13
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
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,12.9495,495912,1,0,844406,97592,1184,2.89815e+06,264,696109,331702
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 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 118 transition count 144
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 107 transition count 144
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 35 place count 95 transition count 132
Iterating global reduction 0 with 12 rules applied. Total rules applied 47 place count 95 transition count 132
Applied a total of 47 rules in 13 ms. Remains 95 /129 variables (removed 34) and now considering 132/166 (removed 34) transitions.
// Phase 1: matrix 132 rows 95 cols
[2024-05-22 12:32:02] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 12:32:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 12:32:02] [INFO ] Invariant cache hit.
[2024-05-22 12:32:02] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 12:32:02] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-22 12:32:02] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-22 12:32:02] [INFO ] Invariant cache hit.
[2024-05-22 12:32:02] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 132/227 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 92/189 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 189 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2737 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 132/227 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 92/189 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 131/320 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 320 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2092 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 4843ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 4844ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/129 places, 132/166 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4989 ms. Remains : 95/129 places, 132/166 transitions.
[2024-05-22 12:32:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:32:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:32:07] [INFO ] Input system was already deterministic with 132 transitions.
RANDOM walk for 1605 steps (11 resets) in 15 ms. (100 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 12:32:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:32:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:32:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15756121696829370186.gal : 1 ms
[2024-05-22 12:32:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17555496319039984444.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/ReachabilityCardinality15756121696829370186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17555496319039984444.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 ...330
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 154
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 154
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 108 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 108 transition count 145
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 99 transition count 136
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 99 transition count 136
Applied a total of 60 rules in 2 ms. Remains 99 /129 variables (removed 30) and now considering 136/166 (removed 30) transitions.
// Phase 1: matrix 136 rows 99 cols
[2024-05-22 12:32:07] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 12:32:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 12:32:07] [INFO ] Invariant cache hit.
[2024-05-22 12:32:07] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-22 12:32:08] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2024-05-22 12:32:08] [INFO ] Invariant cache hit.
[2024-05-22 12:32:08] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/235 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 93/194 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 0/235 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 194 constraints, problems are : Problem set: 0 solved, 135 unsolved in 2972 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/235 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 93/194 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 135/329 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/235 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 329 constraints, problems are : Problem set: 0 solved, 135 unsolved in 2221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 5207ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 5209ms
Starting structural reductions in LTL mode, iteration 1 : 99/129 places, 136/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5328 ms. Remains : 99/129 places, 136/166 transitions.
[2024-05-22 12:32:13] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:32:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:32:13] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-22 12:32:13] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:32:13] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:32:13] [INFO ] Time to serialize gal into /tmp/CTLFireability12339252616207235148.gal : 0 ms
[2024-05-22 12:32:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17193165026480928815.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/CTLFireability12339252616207235148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17193165026480928815.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.5466e+12,2.97204,94460,2,9451,5,560675,6,0,516,318011,0
Converting to forward existential form...Done !
original formula: !(E(AF(((AX(EX(((p99==1)&&(p131==1)))) + !(((p74==1)&&(p132==1)))) + ((p64!=1)||((p17==1)&&(p131==1))))) U ((p2==1)&&(p131==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(((!(EX(!(EX(((p99==1)&&(p131==1)))))) + !(((p74==1)&&(p132==1)))) + ((p64!=1)||((p17==1)&&(p1...201
Reverse transition relation is NOT exact ! Due to transitions t30, t32, t34, t36, t38, t40, t43, t45, t47, t49, t51, t53, t113, t115, t122, t123, t124, t12...318
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-22 12:32:43] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:32:43] [INFO ] Applying decomposition
[2024-05-22 12:32:43] [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/graph8428433636249606408.txt' '-o' '/tmp/graph8428433636249606408.bin' '-w' '/tmp/graph8428433636249606408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8428433636249606408.bin' '-l' '-1' '-v' '-w' '/tmp/graph8428433636249606408.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:32:43] [INFO ] Decomposing Gal with order
[2024-05-22 12:32:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:32:43] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-22 12:32:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:32:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 4 ms.
[2024-05-22 12:32:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9585206255742971058.gal : 2 ms
[2024-05-22 12:32:43] [INFO ] Time to serialize properties into /tmp/CTLFireability10535478582716112703.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/CTLFireability9585206255742971058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10535478582716112703.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,6.5466e+12,0.080783,7464,266,82,7978,683,263,15485,31,3977,0
Converting to forward existential form...Done !
original formula: !(E(AF(((AX(EX(((i10.u31.p99==1)&&(i3.u41.p131==1)))) + !(((i7.u23.p74==1)&&(i7.u4.p132==1)))) + ((i6.u20.p64!=1)||((i1.u6.p17==1)&&(i3.u...211
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(((!(EX(!(EX(((i10.u31.p99==1)&&(i3.u41.p131==1)))))) + !(((i7.u23.p74==1)&&(i7.u4.p132==1))))...265
Reverse transition relation is NOT exact ! Due to transitions t30, t32, t34, t36, t38, t40, t43, t45, t47, t51, t53, t113, t115, i0.i1.u2.t129, i1.u6.t130,...422
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,15.2728,257308,1,0,410660,6832,1256,1.48177e+06,162,156400,213852
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 157
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 112 transition count 149
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 112 transition count 149
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 104 transition count 141
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 104 transition count 141
Applied a total of 50 rules in 7 ms. Remains 104 /129 variables (removed 25) and now considering 141/166 (removed 25) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-22 12:32:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:32:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 12:32:58] [INFO ] Invariant cache hit.
[2024-05-22 12:32:58] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-22 12:32:58] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-22 12:32:58] [INFO ] Invariant cache hit.
[2024-05-22 12:32:58] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/245 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 94/200 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 0/245 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 200 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 141/245 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 94/200 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 140/340 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 340 constraints, problems are : Problem set: 0 solved, 140 unsolved in 2313 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 5501ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 5502ms
Starting structural reductions in LTL mode, iteration 1 : 104/129 places, 141/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5630 ms. Remains : 104/129 places, 141/166 transitions.
[2024-05-22 12:33:04] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:33:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:33:04] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-22 12:33:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:33:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:33:04] [INFO ] Time to serialize gal into /tmp/CTLFireability3938813081685685458.gal : 1 ms
[2024-05-22 12:33:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16551725265878764907.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/CTLFireability3938813081685685458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16551725265878764907.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.56789e+12,5.07132,138268,2,17629,5,850826,6,0,540,474623,0
Converting to forward existential form...Done !
original formula: AF(((EF(EG((AG(((p77==1)&&(p131==1))) * EX((p98==1))))) + ((AG(((p14==0)||(p132==0))) + AX(AF((p124==1)))) * (EG(((p27==0)||(p131==0))) +...341
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U EG((!(E(TRUE U !(((p77==1)&&(p131==1))))) * EX((p98==1))))) + ((!(E(TRUE U !(((p14==0)||...489
Reverse transition relation is NOT exact ! Due to transitions t10, t23, t26, t33, t39, t41, t43, t48, t50, t52, t54, t56, t112, t119, t126, t127, t128, t12...324
Detected timeout of ITS tools.
[2024-05-22 12:33:34] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:33:34] [INFO ] Applying decomposition
[2024-05-22 12:33:34] [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/graph8584207076803779623.txt' '-o' '/tmp/graph8584207076803779623.bin' '-w' '/tmp/graph8584207076803779623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8584207076803779623.bin' '-l' '-1' '-v' '-w' '/tmp/graph8584207076803779623.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:33:34] [INFO ] Decomposing Gal with order
[2024-05-22 12:33:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:33:34] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-22 12:33:34] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:33:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 3 ms.
[2024-05-22 12:33:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1545711403282159251.gal : 1 ms
[2024-05-22 12:33:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10707725304117738419.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/CTLFireability1545711403282159251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10707725304117738419.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,9.56789e+12,0.246496,14376,657,152,20650,2596,277,50795,34,16252,0
Converting to forward existential form...Done !
original formula: AF(((EF(EG((AG(((i8.u26.p77==1)&&(i3.u4.p131==1))) * EX((i10.u33.p98==1))))) + ((AG(((i1.u6.p14==0)||(i2.u9.p132==0))) + AX(AF((i13.u41.p...483
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U EG((!(E(TRUE U !(((i8.u26.p77==1)&&(i3.u4.p131==1))))) * EX((i10.u33.p98==1))))) + ((!(E...649
Reverse transition relation is NOT exact ! Due to transitions t33, t39, t41, t43, t48, t50, t52, t54, t56, t112, t119, i0.i0.u0.t132, i0.i1.u2.t133, i1.u7....449
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,29.0634,536688,1,0,882120,8132,1627,1.92209e+06,171,96908,591562
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 154
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 154
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 108 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 108 transition count 145
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 99 transition count 136
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 99 transition count 136
Applied a total of 60 rules in 8 ms. Remains 99 /129 variables (removed 30) and now considering 136/166 (removed 30) transitions.
// Phase 1: matrix 136 rows 99 cols
[2024-05-22 12:34:03] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:34:03] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 12:34:03] [INFO ] Invariant cache hit.
[2024-05-22 12:34:03] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-22 12:34:03] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [98]
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 : 98/129 places, 136/166 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 98/129 places, 136/166 transitions.
[2024-05-22 12:34:03] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:34:03] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:34:03] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-22 12:34:03] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:34:03] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:34:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13087245943797010676.gal : 0 ms
[2024-05-22 12:34:03] [INFO ] Time to serialize properties into /tmp/CTLFireability18007189627861534895.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/CTLFireability13087245943797010676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18007189627861534895.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.5466e+12,6.14716,189056,2,41689,5,1.36324e+06,6,0,514,551478,0
Converting to forward existential form...Done !
original formula: AG(((AX(AG(((p19==1)&&(p131==1)))) + (p28==0)) + ((p2==0)||(p131==0))))
=> equivalent forward existential formula: [(FwdU(EY(((FwdU(Init,TRUE) * !(((p2==0)||(p131==0)))) * !((p28==0)))),TRUE) * !(((p19==1)&&(p131==1))))] = FALS...156
(forward)formula 0,0,9.24761,189056,1,0,16,1.36324e+06,14,6,1041,673371,6
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 154
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 154
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 107 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 107 transition count 144
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 97 transition count 134
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 97 transition count 134
Applied a total of 64 rules in 7 ms. Remains 97 /129 variables (removed 32) and now considering 134/166 (removed 32) transitions.
// Phase 1: matrix 134 rows 97 cols
[2024-05-22 12:34:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:34:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 12:34:13] [INFO ] Invariant cache hit.
[2024-05-22 12:34:13] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 12:34:13] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-05-22 12:34:13] [INFO ] Invariant cache hit.
[2024-05-22 12:34:13] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 92/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 191 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2887 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 92/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 133/324 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 324 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2187 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 5086ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 5087ms
Starting structural reductions in LTL mode, iteration 1 : 97/129 places, 134/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5215 ms. Remains : 97/129 places, 134/166 transitions.
[2024-05-22 12:34:18] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:34:18] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:34:18] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-22 12:34:18] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:34:18] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:34:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10022008649934940499.gal : 1 ms
[2024-05-22 12:34:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8544893485097891694.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/CTLFireability10022008649934940499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8544893485097891694.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.54695e+12,2.65324,87952,2,9529,5,529543,6,0,506,297633,0
Converting to forward existential form...Done !
original formula: EX(((AX(A((p104==1) U ((p44==1)&&(p132==1)))) + AG((((p49==1)&&(p131==1))&&(p106==1)))) + (p78==0)))
=> equivalent forward existential formula: (([(EY(Init) * !(EX(!(!((E(!(((p44==1)&&(p132==1))) U (!((p104==1)) * !(((p44==1)&&(p132==1))))) + EG(!(((p44==1...300
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t33, t35, t37, t39, t40, t42, t44, t46, t48, t50, t52, t120, t121, t122, t123, t124...311
Detected timeout of ITS tools.
[2024-05-22 12:34:48] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:34:48] [INFO ] Applying decomposition
[2024-05-22 12:34:48] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph35704622128022857.txt' '-o' '/tmp/graph35704622128022857.bin' '-w' '/tmp/graph35704622128022857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph35704622128022857.bin' '-l' '-1' '-v' '-w' '/tmp/graph35704622128022857.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:34:48] [INFO ] Decomposing Gal with order
[2024-05-22 12:34:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:34:48] [INFO ] Removed a total of 86 redundant transitions.
[2024-05-22 12:34:48] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:34:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 1 ms.
[2024-05-22 12:34:48] [INFO ] Time to serialize gal into /tmp/CTLFireability16690042616399396952.gal : 1 ms
[2024-05-22 12:34:48] [INFO ] Time to serialize properties into /tmp/CTLFireability8921187756206983730.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/CTLFireability16690042616399396952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8921187756206983730.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.54695e+12,0.120542,9264,178,95,7219,6390,234,19565,36,38016,0
Converting to forward existential form...Done !
original formula: EX(((AX(A((i11.u29.p104==1) U ((i5.u11.p44==1)&&(i3.u38.p132==1)))) + AG((((i5.u13.p49==1)&&(i0.u0.p131==1))&&(i11.u30.p106==1)))) + (i8....168
=> equivalent forward existential formula: (([(EY(Init) * !(EX(!(!((E(!(((i5.u11.p44==1)&&(i3.u38.p132==1))) U (!((i11.u29.p104==1)) * !(((i5.u11.p44==1)&&...378
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t33, t35, t37, t39, t40, t42, t46, t48, t50, t52, i0.u0.t127, i1.u3.t128, i2.u6.t12...410
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,21.6791,568068,1,0,271745,210784,1364,3.64797e+06,219,4.77962e+06,92152
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 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 118 transition count 145
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 108 transition count 145
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 32 place count 97 transition count 134
Iterating global reduction 0 with 11 rules applied. Total rules applied 43 place count 97 transition count 134
Applied a total of 43 rules in 10 ms. Remains 97 /129 variables (removed 32) and now considering 134/166 (removed 32) transitions.
// Phase 1: matrix 134 rows 97 cols
[2024-05-22 12:35:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:35:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 12:35:10] [INFO ] Invariant cache hit.
[2024-05-22 12:35:10] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-22 12:35:10] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 142 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 96/129 places, 134/166 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 157 ms. Remains : 96/129 places, 134/166 transitions.
[2024-05-22 12:35:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:35:10] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:35:10] [INFO ] Input system was already deterministic with 134 transitions.
RANDOM walk for 997 steps (5 resets) in 6 ms. (142 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 12:35:10] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:35:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:35:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3354130768243073348.gal : 0 ms
[2024-05-22 12:35:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality157654383294677579.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/ReachabilityCardinality3354130768243073348.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality157654383294677579.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 118 transition count 155
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 118 transition count 155
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 109 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 109 transition count 146
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 100 transition count 137
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 100 transition count 137
Applied a total of 58 rules in 2 ms. Remains 100 /129 variables (removed 29) and now considering 137/166 (removed 29) transitions.
// Phase 1: matrix 137 rows 100 cols
[2024-05-22 12:35:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:35:10] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 12:35:10] [INFO ] Invariant cache hit.
[2024-05-22 12:35:10] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-22 12:35:10] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 154 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/129 places, 137/166 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 99/129 places, 137/166 transitions.
[2024-05-22 12:35:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:35:10] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:35:10] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 12:35:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:35:10] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:35:10] [INFO ] Time to serialize gal into /tmp/CTLFireability10509058050666676685.gal : 1 ms
[2024-05-22 12:35:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1504348714935924733.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/CTLFireability10509058050666676685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1504348714935924733.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.82094e+12,23.4119,601128,2,129371,5,4.14013e+06,6,0,518,2.09649e+06,0
Converting to forward existential form...Done !
original formula: EX((p51==1))
=> equivalent forward existential formula: [(EY(Init) * (p51==1))] != FALSE
(forward)formula 0,0,23.4862,601128,1,0,8,4.14013e+06,8,1,695,2.09649e+06,2
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-22 12:35:34] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:35:34] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:35:34] [INFO ] Applying decomposition
[2024-05-22 12:35:34] [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/graph3481488440802883148.txt' '-o' '/tmp/graph3481488440802883148.bin' '-w' '/tmp/graph3481488440802883148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3481488440802883148.bin' '-l' '-1' '-v' '-w' '/tmp/graph3481488440802883148.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:35:34] [INFO ] Decomposing Gal with order
[2024-05-22 12:35:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:35:34] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-22 12:35:34] [INFO ] Flatten gal took : 15 ms
[2024-05-22 12:35:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 4 ms.
[2024-05-22 12:35:34] [INFO ] Time to serialize gal into /tmp/CTLFireability13032706738279536048.gal : 2 ms
[2024-05-22 12:35:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10687601887762857940.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/CTLFireability13032706738279536048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10687601887762857940.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,3.22143e+13,0.036534,5072,120,58,2558,775,289,4336,48,2199,0
Converting to forward existential form...Done !
original formula: A(A(((i6.i1.u21.p58!=1) * !(E(AX(((i10.u34.p95==1)&&(i0.u1.p131==1))) U (((i3.u7.p25==1)&&(i0.u1.p131==1))||(i8.u26.p71==1))))) U EF(((i1...643
=> equivalent forward existential formula: [((Init * !(EG(!((!((EX((((i5.i0.u14.p43==1)&&(i1.u3.p132==1))||(i10.u33.p91!=1))) * (E(TRUE U (((i6.i0.u19.p54=...2110
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t152, i0.u1.t153, i1.u3.t13, i1.u3.t31, i1.u3.t34, i1.u3.t154, i1.u5.t155, i3.u8.t151, ...527
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,0.772065,41504,1,0,74971,5769,1816,152164,238,43294,64685
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Total runtime 483744 ms.
BK_STOP 1716381335090
--------------------
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-13a"
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-13a, 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-171631132700474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13a.tgz
mv DiscoveryGPU-PT-13a 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 ;