About the Execution of ITS-Tools for DiscoveryGPU-PT-07a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
559.008 | 73562.00 | 92372.00 | 268.50 | FTTTFTTTTTFFFTTT | 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-171631132500378.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-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132500378
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 19K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 02:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 02:06 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 25K 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-07a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716374415172
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-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 10:40:16] [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 10:40:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:40:16] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-22 10:40:16] [INFO ] Transformed 73 places.
[2024-05-22 10:40:16] [INFO ] Transformed 99 transitions.
[2024-05-22 10:40:16] [INFO ] Found NUPN structural information;
[2024-05-22 10:40:16] [INFO ] Parsed PT model containing 73 places and 99 transitions and 318 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 53 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 99/99 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 11 place count 71 transition count 90
Applied a total of 11 rules in 27 ms. Remains 71 /73 variables (removed 2) and now considering 90/99 (removed 9) transitions.
// Phase 1: matrix 90 rows 71 cols
[2024-05-22 10:40:16] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 10:40:16] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-22 10:40:16] [INFO ] Invariant cache hit.
[2024-05-22 10:40:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 10:40:16] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-22 10:40:16] [INFO ] Invariant cache hit.
[2024-05-22 10:40:16] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 90/161 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 56/129 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 0/161 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 129 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1679 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 90/161 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 56/129 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 89/218 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 218 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 2920ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 2935ms
Starting structural reductions in LTL mode, iteration 1 : 71/73 places, 90/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3282 ms. Remains : 71/73 places, 90/99 transitions.
Support contains 53 out of 71 places after structural reductions.
[2024-05-22 10:40:19] [INFO ] Flatten gal took : 23 ms
[2024-05-22 10:40:19] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:40:19] [INFO ] Input system was already deterministic with 90 transitions.
Reduction of identical properties reduced properties to check from 72 to 71
RANDOM walk for 40000 steps (533 resets) in 769 ms. (51 steps per ms) remains 1/71 properties
BEST_FIRST walk for 40004 steps (70 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
[2024-05-22 10:40:20] [INFO ] Invariant cache hit.
[2024-05-22 10:40:20] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/32 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/60 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp43 is UNSAT
After SMT solving in domain Real declared 79/161 variables, and 58 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 35/71 constraints, ReadFeed: 21/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-22 10:40:20] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:40:20] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:40:20] [INFO ] Input system was already deterministic with 90 transitions.
Computed a total of 10 stabilizing places and 8 stable transitions
Graph (complete) has 198 edges and 71 vertex of which 66 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 60 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 60 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 57 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 57 transition count 76
Applied a total of 28 rules in 5 ms. Remains 57 /71 variables (removed 14) and now considering 76/90 (removed 14) transitions.
// Phase 1: matrix 76 rows 57 cols
[2024-05-22 10:40:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:40:20] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 10:40:20] [INFO ] Invariant cache hit.
[2024-05-22 10:40:20] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 10:40:20] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-22 10:40:20] [INFO ] Invariant cache hit.
[2024-05-22 10:40:20] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/133 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 50/109 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 0/133 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 109 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/133 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 50/109 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 75/184 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 184 constraints, problems are : Problem set: 0 solved, 75 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 1901ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 1902ms
Starting structural reductions in LTL mode, iteration 1 : 57/71 places, 76/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1993 ms. Remains : 57/71 places, 76/90 transitions.
[2024-05-22 10:40:22] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:40:22] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:40:22] [INFO ] Input system was already deterministic with 76 transitions.
[2024-05-22 10:40:22] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:22] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10697852795093822112.gal : 1 ms
[2024-05-22 10:40:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10477033771747409640.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10697852795093822112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10477033771747409640.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.13578e+07,0.135836,8856,2,1314,5,34610,6,0,294,22237,0
Converting to forward existential form...Done !
original formula: AX(AG(E((!((((p63==1)&&(p72==1))&&((p26==1)&&(p71==1)))) + (AG(((p63==1)&&(p72==1))) * EG(((p69==1)&&(p71==1))))) U (p3==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E((!((((p63==1)&&(p72==1))&&((p26==1)&&(p71==1)))) + (!(E(TRUE U !(((p63==1)&&(p72==1)...210
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t15, t21, t23, t26, t28, t30, t68, t69, t70, t71, t72, t73, t74, t75, Intersection ...239
(forward)formula 0,0,1.53873,61404,1,0,264,326766,188,150,1897,375429,342
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 63 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 63 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 60 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 60 transition count 79
Applied a total of 22 rules in 4 ms. Remains 60 /71 variables (removed 11) and now considering 79/90 (removed 11) transitions.
// Phase 1: matrix 79 rows 60 cols
[2024-05-22 10:40:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:40:24] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 10:40:24] [INFO ] Invariant cache hit.
[2024-05-22 10:40:24] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-22 10:40:24] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-22 10:40:24] [INFO ] Invariant cache hit.
[2024-05-22 10:40:24] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 79/139 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 52/114 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/139 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 114 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 79/139 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 52/114 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 78/192 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 192 constraints, problems are : Problem set: 0 solved, 78 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 2047ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2048ms
Starting structural reductions in LTL mode, iteration 1 : 60/71 places, 79/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2139 ms. Remains : 60/71 places, 79/90 transitions.
[2024-05-22 10:40:26] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:40:26] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:26] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-22 10:40:26] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:26] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11205780453224674071.gal : 1 ms
[2024-05-22 10:40:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1957133718418040834.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/CTLFireability11205780453224674071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1957133718418040834.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.29902e+07,0.083727,7100,2,887,5,21663,6,0,308,15514,0
Converting to forward existential form...Done !
original formula: (E(((!(((p46==1)&&(p71==1))) + (EG(EF(((p20==1)&&(p71==1)))) * EG((((p40==1)&&(p71==1))||((p63==1)&&(p72==1)))))) * AX(((E((p48==1) U ((p...461
=> equivalent forward existential formula: ([(EY((FwdU(FwdU((Init * !(E(((!(((p46==1)&&(p71==1))) + (EG(E(TRUE U ((p20==1)&&(p71==1)))) * EG((((p40==1)&&(p...1364
Reverse transition relation is NOT exact ! Due to transitions t23, t24, t26, t28, t30, t61, t65, t70, t71, t72, t73, t74, t75, t76, t77, t78, Intersection...240
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.01557,110876,1,0,744,597318,227,473,1993,834588,891
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 61 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 61 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 58 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 58 transition count 77
Applied a total of 26 rules in 4 ms. Remains 58 /71 variables (removed 13) and now considering 77/90 (removed 13) transitions.
// Phase 1: matrix 77 rows 58 cols
[2024-05-22 10:40:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:40:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 10:40:29] [INFO ] Invariant cache hit.
[2024-05-22 10:40:29] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 10:40:29] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-22 10:40:29] [INFO ] Invariant cache hit.
[2024-05-22 10:40:29] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/135 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/135 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 111 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/135 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 76/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 187 constraints, problems are : Problem set: 0 solved, 76 unsolved in 817 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 1879ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 1881ms
Starting structural reductions in LTL mode, iteration 1 : 58/71 places, 77/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1977 ms. Remains : 58/71 places, 77/90 transitions.
[2024-05-22 10:40:31] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:40:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:40:31] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-22 10:40:31] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:31] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16145424530206607727.gal : 1 ms
[2024-05-22 10:40:31] [INFO ] Time to serialize properties into /tmp/CTLFireability18032017573399454964.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/CTLFireability16145424530206607727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18032017573399454964.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.15118e+07,0.088343,7352,2,869,5,24119,6,0,298,14641,0
Converting to forward existential form...Done !
original formula: E((!((((AG(((p48==1)&&(p72==1))) * ((!((p28==1)&&(p72==1)))||(!((p8==1)&&(p72==1))))) + !((EF(((p35==1)&&(p71==1))) * AF(((p25==1)&&(p71=...364
=> equivalent forward existential formula: [(FwdU(FwdU(FwdU(Init,(!((((!(E(TRUE U !(((p48==1)&&(p72==1))))) * ((!((p28==1)&&(p72==1)))||(!((p8==1)&&(p72==1...442
Reverse transition relation is NOT exact ! Due to transitions t18, t20, t22, t25, t27, t29, t68, t69, t70, t71, t72, t73, t74, t75, t76, Intersection with...235
Hit Full ! (commute/partial/dont) 39/36/38
(forward)formula 0,1,4.98064,156984,1,0,792,841118,215,457,1922,1.05513e+06,992
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Graph (complete) has 198 edges and 71 vertex of which 66 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 66 transition count 79
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 60 transition count 79
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 54 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 54 transition count 73
Applied a total of 25 rules in 17 ms. Remains 54 /71 variables (removed 17) and now considering 73/90 (removed 17) transitions.
// Phase 1: matrix 73 rows 54 cols
[2024-05-22 10:40:36] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:40:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:40:36] [INFO ] Invariant cache hit.
[2024-05-22 10:40:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 10:40:36] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-22 10:40:36] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-22 10:40:36] [INFO ] Invariant cache hit.
[2024-05-22 10:40:36] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/127 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 50/106 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/127 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 106 constraints, problems are : Problem set: 0 solved, 72 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/127 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 50/106 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 72/178 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 178 constraints, problems are : Problem set: 0 solved, 72 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 1679ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 1680ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/71 places, 73/90 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1785 ms. Remains : 54/71 places, 73/90 transitions.
[2024-05-22 10:40:38] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:40:38] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:38] [INFO ] Input system was already deterministic with 73 transitions.
RANDOM walk for 839 steps (10 resets) in 10 ms. (76 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 10:40:38] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:38] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17810951586455493316.gal : 1 ms
[2024-05-22 10:40:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1753512919591299454.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/ReachabilityCardinality17810951586455493316.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1753512919591299454.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Graph (complete) has 198 edges and 71 vertex of which 66 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 66 transition count 79
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 60 transition count 79
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 54 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 54 transition count 73
Applied a total of 25 rules in 9 ms. Remains 54 /71 variables (removed 17) and now considering 73/90 (removed 17) transitions.
// Phase 1: matrix 73 rows 54 cols
[2024-05-22 10:40:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:40:38] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 10:40:38] [INFO ] Invariant cache hit.
[2024-05-22 10:40:38] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 10:40:38] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-22 10:40:38] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-22 10:40:38] [INFO ] Invariant cache hit.
[2024-05-22 10:40:38] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/127 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 50/106 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/127 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 106 constraints, problems are : Problem set: 0 solved, 72 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/127 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 50/106 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 72/178 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 178 constraints, problems are : Problem set: 0 solved, 72 unsolved in 783 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 1764ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 1765ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/71 places, 73/90 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1860 ms. Remains : 54/71 places, 73/90 transitions.
[2024-05-22 10:40:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:40:40] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:40] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-22 10:40:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:40:40] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4782430231662630414.gal : 1 ms
[2024-05-22 10:40:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1053393556339688485.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/CTLFireability4782430231662630414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1053393556339688485.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,4.39091e+06,0.051509,5740,2,733,5,13856,6,0,280,9016,0
Converting to forward existential form...Done !
original formula: (AG(A(((((p15==1)&&(p71==1))&&(p3==1))||(((p17==1)&&(p71==1))&&(p46==1))) U !(((p3==1)&&(p72==1))))) * (E(((p48==1)&&(p72==1)) U EG(((p44...234
=> equivalent forward existential formula: (([(FwdU(FwdU(Init,TRUE),!(!(((p3==1)&&(p72==1))))) * (!(((((p15==1)&&(p71==1))&&(p3==1))||(((p17==1)&&(p71==1))...410
Reverse transition relation is NOT exact ! Due to transitions t13, t17, t19, t21, t24, t26, t28, t61, t66, t67, t68, t69, t70, t71, t72, Intersection with...235
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 57/15/16
(forward)formula 0,0,0.984523,41708,1,0,389,219398,191,265,1822,286003,453
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 61 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 61 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 58 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 58 transition count 77
Applied a total of 26 rules in 5 ms. Remains 58 /71 variables (removed 13) and now considering 77/90 (removed 13) transitions.
// Phase 1: matrix 77 rows 58 cols
[2024-05-22 10:40:41] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:40:41] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 10:40:41] [INFO ] Invariant cache hit.
[2024-05-22 10:40:41] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 10:40:41] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-22 10:40:41] [INFO ] Invariant cache hit.
[2024-05-22 10:40:41] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/135 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/135 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 111 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/135 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 76/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 187 constraints, problems are : Problem set: 0 solved, 76 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 1944ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 1945ms
Starting structural reductions in LTL mode, iteration 1 : 58/71 places, 77/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2028 ms. Remains : 58/71 places, 77/90 transitions.
[2024-05-22 10:40:43] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:43] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:43] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-22 10:40:43] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:40:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9731657800346929093.gal : 1 ms
[2024-05-22 10:40:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4893416661329483553.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/CTLFireability9731657800346929093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4893416661329483553.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20026e+07,0.124445,8932,2,1450,5,35428,6,0,299,21792,0
Converting to forward existential form...Done !
original formula: AX(!(E((!(AX((p38==1))) * AX(!(((p5==1)&&(p71==1))))) U ((AG(((p36==1)&&(p71==1))) * EG(((p42==1)&&(p71==1)))) * AX(!(((p13==1)&&(p72==1)...162
=> equivalent forward existential formula: [((FwdU(EY(Init),(!(!(EX(!((p38==1))))) * !(EX(!(!(((p5==1)&&(p71==1)))))))) * (!(E(TRUE U !(((p36==1)&&(p71==1)...234
Reverse transition relation is NOT exact ! Due to transitions t12, t15, t19, t23, t24, t28, t30, t62, t64, t69, t70, t71, t72, t73, t74, t75, t76, Interse...245
(forward)formula 0,1,0.876149,35424,1,0,219,173553,184,116,1849,194535,295
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 61 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 61 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 58 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 58 transition count 77
Applied a total of 26 rules in 11 ms. Remains 58 /71 variables (removed 13) and now considering 77/90 (removed 13) transitions.
// Phase 1: matrix 77 rows 58 cols
[2024-05-22 10:40:44] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:40:44] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 10:40:44] [INFO ] Invariant cache hit.
[2024-05-22 10:40:44] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 10:40:44] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-22 10:40:44] [INFO ] Invariant cache hit.
[2024-05-22 10:40:44] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/135 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/135 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 111 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/135 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 76/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 187 constraints, problems are : Problem set: 0 solved, 76 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 1909ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 1910ms
Starting structural reductions in LTL mode, iteration 1 : 58/71 places, 77/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2009 ms. Remains : 58/71 places, 77/90 transitions.
[2024-05-22 10:40:46] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:40:46] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:40:46] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-22 10:40:46] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:40:46] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:40:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7239979872578516832.gal : 4 ms
[2024-05-22 10:40:46] [INFO ] Time to serialize properties into /tmp/CTLFireability7990871806463543423.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/CTLFireability7239979872578516832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7990871806463543423.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15118e+07,0.088528,7356,2,869,5,24119,6,0,298,14641,0
Converting to forward existential form...Done !
original formula: AG((EF(((AX((p1==0)) + (p4==0)) + (p72==0))) + EG(((AX(((p8==0)||(p72==0))) * ((p46==0)||(p71==0))) * AF(((p8==1)&&(p72==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(((!(EX(!(((p8==0)||(p72==0))))) * ((p46==0)||(p71==0))) * !(EG(!(((p8==1)&&(p72==1))))...228
Reverse transition relation is NOT exact ! Due to transitions t18, t20, t22, t25, t27, t29, t68, t69, t70, t71, t72, t73, t74, t75, t76, Intersection with...235
(forward)formula 0,1,0.39148,18516,1,0,116,79676,178,77,1795,82318,169
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 60 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 60 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 56 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 56 transition count 75
Applied a total of 30 rules in 5 ms. Remains 56 /71 variables (removed 15) and now considering 75/90 (removed 15) transitions.
// Phase 1: matrix 75 rows 56 cols
[2024-05-22 10:40:46] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 10:40:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:40:46] [INFO ] Invariant cache hit.
[2024-05-22 10:40:46] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 10:40:46] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/71 places, 75/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 55/71 places, 75/90 transitions.
[2024-05-22 10:40:46] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:40:46] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:40:46] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-22 10:40:46] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:40:46] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:40:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8732419651603671675.gal : 0 ms
[2024-05-22 10:40:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6374838762459820275.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/CTLFireability8732419651603671675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6374838762459820275.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05943e+07,0.09307,7560,2,1473,5,26196,6,0,287,16188,0
Converting to forward existential form...Done !
original formula: E(A(EF(EX(!(((p59==1)&&(p71==1))))) U ((AG((p13==1)) + EF((((p25==1)&&(p71==1))&&((p9==1)&&(p71==1))))) + ((p45==1)&&(p71==1)))) U AF(EX(...194
=> equivalent forward existential formula: [(FwdU(Init,!((E(!(((!(E(TRUE U !((p13==1)))) + E(TRUE U (((p25==1)&&(p71==1))&&((p9==1)&&(p71==1))))) + ((p45==...513
Reverse transition relation is NOT exact ! Due to transitions t11, t14, t18, t20, t22, t23, t27, t29, t67, t68, t69, t70, t71, t72, t73, t74, Intersection...240
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.00519,261428,1,0,1003,1.4641e+06,196,661,1831,1.95487e+06,1062
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Graph (complete) has 198 edges and 71 vertex of which 66 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 66 transition count 80
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 61 transition count 80
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 56 transition count 75
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 56 transition count 75
Applied a total of 21 rules in 16 ms. Remains 56 /71 variables (removed 15) and now considering 75/90 (removed 15) transitions.
// Phase 1: matrix 75 rows 56 cols
[2024-05-22 10:40:54] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:40:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 10:40:54] [INFO ] Invariant cache hit.
[2024-05-22 10:40:54] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 10:40:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-22 10:40:54] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-22 10:40:54] [INFO ] Invariant cache hit.
[2024-05-22 10:40:54] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 51/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 109 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 51/109 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 183 constraints, problems are : Problem set: 0 solved, 74 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 1810ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 1810ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/71 places, 75/90 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1906 ms. Remains : 56/71 places, 75/90 transitions.
[2024-05-22 10:40:56] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:40:56] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:40:56] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-22 10:40:56] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:56] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:40:56] [INFO ] Time to serialize gal into /tmp/CTLFireability12865501420422641778.gal : 1 ms
[2024-05-22 10:40:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13522982524290805111.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/CTLFireability12865501420422641778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13522982524290805111.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,5.12e+06,0.047493,5488,2,586,5,13058,6,0,290,7641,0
Converting to forward existential form...Done !
original formula: E(EG(EF((((!(((p6==1)&&(p71==1))||(p28==1)))||(p63!=1))||((p28==1)&&(p72==1))))) U AG(((EG((p36==1)) + !(EG(((p46==1)&&(p71==1))))) + ((!...225
=> equivalent forward existential formula: [(FwdU(Init,EG(E(TRUE U (((!(((p6==1)&&(p71==1))||(p28==1)))||(p63!=1))||((p28==1)&&(p72==1)))))) * !(E(TRUE U !...289
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t22, t23, t25, t27, t65, t67, t68, t69, t70, t71, t72, t73, t74, Intersection with ...234
(forward)formula 0,1,0.846916,36260,1,0,294,187610,186,168,1862,179377,406
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Graph (complete) has 198 edges and 71 vertex of which 67 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 67 transition count 82
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 63 transition count 82
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 11 place count 61 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 61 transition count 80
Applied a total of 13 rules in 12 ms. Remains 61 /71 variables (removed 10) and now considering 80/90 (removed 10) transitions.
// Phase 1: matrix 80 rows 61 cols
[2024-05-22 10:40:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:40:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 10:40:57] [INFO ] Invariant cache hit.
[2024-05-22 10:40:57] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-22 10:40:57] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 85 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/71 places, 80/90 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 80
Applied a total of 1 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 60 cols
[2024-05-22 10:40:57] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 10:40:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-22 10:40:57] [INFO ] Invariant cache hit.
[2024-05-22 10:40:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 10:40:57] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 60/71 places, 80/90 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 173 ms. Remains : 60/71 places, 80/90 transitions.
[2024-05-22 10:40:57] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:40:57] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:40:57] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-22 10:40:57] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:40:57] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:40:57] [INFO ] Time to serialize gal into /tmp/CTLFireability883423406227015894.gal : 1 ms
[2024-05-22 10:40:57] [INFO ] Time to serialize properties into /tmp/CTLFireability87582573733134445.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/CTLFireability883423406227015894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability87582573733134445.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 -...280
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.04e+06,0.047629,5744,2,657,5,13435,6,0,312,7322,0
Converting to forward existential form...Done !
original formula: E((!(E((AF((p54==1)) * (((p52==1)&&(p71==1))||((p16==1)&&(p71==1)))) U (p53==1))) + ((p22==1)&&(p71==1))) U ((AF((p66==1)) * !((!(A((((p2...339
=> equivalent forward existential formula: ([((((FwdU(Init,(!(E((!(EG(!((p54==1)))) * (((p52==1)&&(p71==1))||((p16==1)&&(p71==1)))) U (p53==1))) + ((p22==1...948
Reverse transition relation is NOT exact ! Due to transitions t19, t24, t27, t62, t64, t67, t69, t70, t71, t72, t73, t74, t75, t76, t77, Intersection with...235
(forward)formula 0,1,2.23919,86876,1,0,1046,451231,210,589,1806,607165,1211
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 64 transition count 83
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 64 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 61 transition count 80
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 61 transition count 80
Applied a total of 20 rules in 6 ms. Remains 61 /71 variables (removed 10) and now considering 80/90 (removed 10) transitions.
// Phase 1: matrix 80 rows 61 cols
[2024-05-22 10:40:59] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:40:59] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 10:40:59] [INFO ] Invariant cache hit.
[2024-05-22 10:40:59] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-22 10:41:00] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-22 10:41:00] [INFO ] Invariant cache hit.
[2024-05-22 10:41:00] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 80/141 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 0/141 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 115 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 80/141 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 52/115 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 79/194 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/141 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 194 constraints, problems are : Problem set: 0 solved, 79 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
After SMT, in 2025ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 2026ms
Starting structural reductions in LTL mode, iteration 1 : 61/71 places, 80/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2117 ms. Remains : 61/71 places, 80/90 transitions.
[2024-05-22 10:41:02] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:41:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:41:02] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-22 10:41:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:41:02] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13556847463229565666.gal : 1 ms
[2024-05-22 10:41:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16819667195934009494.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/CTLFireability13556847463229565666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16819667195934009494.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.38456e+07,0.108418,8688,2,1244,5,33672,6,0,313,20006,0
Converting to forward existential form...Done !
original formula: E((!(E((((!((p63==1)&&(p72==1)))||((p69==1)&&(p71==1))) * AG(((p49==1)&&(p71==1)))) U (p31==1))) * ((p38==1) + AG(EX(!(((p25==1)&&(p71==1...262
=> equivalent forward existential formula: [((FwdU(Init,(!(E((((!((p63==1)&&(p72==1)))||((p69==1)&&(p71==1))) * !(E(TRUE U !(((p49==1)&&(p71==1)))))) U (p3...374
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t22, t24, t25, t31, t64, t66, t71, t72, t73, t74, t75, t76, t77, t78, t79, Intersec...244
(forward)formula 0,0,3.95565,131008,1,0,243,794018,197,146,1899,699970,336
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Graph (complete) has 198 edges and 71 vertex of which 67 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 67 transition count 82
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 63 transition count 82
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 58 transition count 77
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 58 transition count 77
Applied a total of 19 rules in 16 ms. Remains 58 /71 variables (removed 13) and now considering 77/90 (removed 13) transitions.
// Phase 1: matrix 77 rows 58 cols
[2024-05-22 10:41:06] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:41:06] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 10:41:06] [INFO ] Invariant cache hit.
[2024-05-22 10:41:06] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 10:41:06] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-22 10:41:06] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-22 10:41:06] [INFO ] Invariant cache hit.
[2024-05-22 10:41:06] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/135 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/135 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 111 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1110 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/135 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 76/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 187 constraints, problems are : Problem set: 0 solved, 76 unsolved in 897 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 58/58 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 2017ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2018ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/71 places, 77/90 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2129 ms. Remains : 58/71 places, 77/90 transitions.
[2024-05-22 10:41:08] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:41:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:08] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-22 10:41:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5770237373191563740.gal : 0 ms
[2024-05-22 10:41:08] [INFO ] Time to serialize properties into /tmp/CTLFireability9956618510271005831.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/CTLFireability5770237373191563740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9956618510271005831.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.37632e+06,0.095995,7616,2,1447,5,25677,6,0,299,15511,0
Converting to forward existential form...Done !
original formula: (!(E((EG((((p16==1)&&(p13==1))||((p18==1)&&(p21==1)))) + EF(((((p65==1)&&(p71==1))||(p36==1))||((p43==1)&&(p72==1))))) U !(((E(((p44==1)&...370
=> equivalent forward existential formula: (([(FwdU((Init * !(EG(E(TRUE U !(E(TRUE U !(((p49==1)&&(p71==1))))))))),(EG((((p16==1)&&(p13==1))||((p18==1)&&(p...1319
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t13, t19, t24, t28, t67, t68, t69, t70, t71, t72, t73, t74, t75, Intersection with r...233
(forward)formula 0,0,2.8619,93492,1,0,305,501679,194,204,1842,548845,398
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 59 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 59 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 55 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 55 transition count 74
Applied a total of 32 rules in 6 ms. Remains 55 /71 variables (removed 16) and now considering 74/90 (removed 16) transitions.
// Phase 1: matrix 74 rows 55 cols
[2024-05-22 10:41:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:41:11] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 10:41:11] [INFO ] Invariant cache hit.
[2024-05-22 10:41:11] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 10:41:11] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-22 10:41:11] [INFO ] Invariant cache hit.
[2024-05-22 10:41:11] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/129 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 107 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/129 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 73/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 180 constraints, problems are : Problem set: 0 solved, 73 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1846ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1847ms
Starting structural reductions in LTL mode, iteration 1 : 55/71 places, 74/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1928 ms. Remains : 55/71 places, 74/90 transitions.
[2024-05-22 10:41:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:41:13] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:13] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-22 10:41:13] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:13] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2938663092540082078.gal : 1 ms
[2024-05-22 10:41:13] [INFO ] Time to serialize properties into /tmp/CTLFireability8931068913633848898.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/CTLFireability2938663092540082078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8931068913633848898.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,9.80992e+06,0.098295,7600,2,973,5,24289,6,0,284,16823,0
Converting to forward existential form...Done !
original formula: AF((A(((p49==1)&&(p71==1)) U ((p45==1)&&(p71==1))) * ((EX(AF(((p15==0)||(p71==0)))) + (p34==0)) + (p72==0))))
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(((p45==1)&&(p71==1))) U (!(((p49==1)&&(p71==1))) * !(((p45==1)&&(p71==1))))) + EG(!(((p45==...247
Reverse transition relation is NOT exact ! Due to transitions t17, t19, t21, t22, t24, t26, t28, t66, t67, t68, t69, t70, t71, t72, t73, Intersection with...235
(forward)formula 0,0,3.12629,104976,1,0,684,581506,187,402,1715,740439,776
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 60 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 60 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 56 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 56 transition count 75
Applied a total of 30 rules in 1 ms. Remains 56 /71 variables (removed 15) and now considering 75/90 (removed 15) transitions.
// Phase 1: matrix 75 rows 56 cols
[2024-05-22 10:41:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:41:16] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:41:16] [INFO ] Invariant cache hit.
[2024-05-22 10:41:16] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 10:41:16] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/71 places, 75/90 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 55/71 places, 75/90 transitions.
[2024-05-22 10:41:16] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:41:16] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:16] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-22 10:41:16] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:41:16] [INFO ] Time to serialize gal into /tmp/CTLFireability6477940895860457353.gal : 1 ms
[2024-05-22 10:41:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10698667174023578949.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/CTLFireability6477940895860457353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10698667174023578949.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.05943e+07,0.096879,7560,2,1473,5,26196,6,0,287,16188,0
Converting to forward existential form...Done !
original formula: EG((AX(EG((((p13==0)||(p6==0))||(p71==0)))) + AF((p44==1))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(EG((((p13==0)||(p6==0))||(p71==0)))))) + !(EG(!((p44==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t14, t18, t20, t22, t23, t27, t29, t67, t68, t69, t70, t71, t72, t73, t74, Intersection...240
(forward)formula 0,1,6.15755,199296,1,0,916,1.08664e+06,182,507,1689,1.49046e+06,993
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 60 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 60 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 57 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 57 transition count 76
Applied a total of 28 rules in 6 ms. Remains 57 /71 variables (removed 14) and now considering 76/90 (removed 14) transitions.
// Phase 1: matrix 76 rows 57 cols
[2024-05-22 10:41:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:41:22] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 10:41:22] [INFO ] Invariant cache hit.
[2024-05-22 10:41:22] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 10:41:22] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-22 10:41:22] [INFO ] Invariant cache hit.
[2024-05-22 10:41:22] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/133 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 51/110 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 0/133 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 110 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/133 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 51/110 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 75/185 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 185 constraints, problems are : Problem set: 0 solved, 75 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 1870ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 1871ms
Starting structural reductions in LTL mode, iteration 1 : 57/71 places, 76/90 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1968 ms. Remains : 57/71 places, 76/90 transitions.
[2024-05-22 10:41:24] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:41:24] [INFO ] Input system was already deterministic with 76 transitions.
[2024-05-22 10:41:24] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:24] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:24] [INFO ] Time to serialize gal into /tmp/CTLFireability13817497698682065977.gal : 0 ms
[2024-05-22 10:41:24] [INFO ] Time to serialize properties into /tmp/CTLFireability17943498179147605354.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/CTLFireability13817497698682065977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17943498179147605354.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.11821e+07,0.125261,8664,2,1339,5,32450,6,0,294,19849,0
Converting to forward existential form...Done !
original formula: EF((AG(AX(EX(((p42==0)||(p71==0))))) + ((p48==1)&&(p72==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(EX(((p42==0)||(p71==0))))))))))] != FALSE + [(FwdU(Init,TRUE) * ((p48==...180
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t23, t25, t27, t29, t61, t63, t68, t69, t70, t71, t72, t73, t74, t75, Intersection...240
(forward)formula 0,1,2.84883,89012,1,0,198,501824,173,116,1778,466610,263
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 59 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 59 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 55 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 55 transition count 74
Applied a total of 32 rules in 7 ms. Remains 55 /71 variables (removed 16) and now considering 74/90 (removed 16) transitions.
// Phase 1: matrix 74 rows 55 cols
[2024-05-22 10:41:27] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:41:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 10:41:27] [INFO ] Invariant cache hit.
[2024-05-22 10:41:27] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 10:41:27] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/71 places, 74/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 54/71 places, 74/90 transitions.
[2024-05-22 10:41:27] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:27] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:41:27] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-22 10:41:27] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:27] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8105826892872556744.gal : 1 ms
[2024-05-22 10:41:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17220074033847644292.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/CTLFireability8105826892872556744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17220074033847644292.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.80992e+06,0.129661,9140,2,1963,5,37332,6,0,282,22087,0
Converting to forward existential form...Done !
original formula: AF(EG(EF(EX((p64==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U EX((p64==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t19, t21, t22, t24, t26, t28, t66, t67, t68, t69, t70, t71, t72, t73, Intersection with...235
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.19472,41164,1,0,188,212233,181,140,1791,219528,275
FORMULA DiscoveryGPU-PT-07a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2024-05-22 10:41:28] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:28] [INFO ] Flatten gal took : 2 ms
Total runtime 72422 ms.
BK_STOP 1716374488734
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-07a"
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-07a, 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-171631132500378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-07a.tgz
mv DiscoveryGPU-PT-07a 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 ;