About the Execution of ITS-Tools for AutoFlight-PT-06a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1130.308 | 230767.00 | 258584.00 | 792.80 | FFTFTTTFTFTTTTFT | 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.r026-smll-171620167100138.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 AutoFlight-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167100138
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.7K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 22:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 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 43K 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 AutoFlight-PT-06a-CTLFireability-2024-00
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2024-01
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2024-02
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2024-03
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2024-04
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2024-05
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2024-06
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2024-07
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2024-08
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2024-09
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2024-10
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2024-11
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2023-12
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2023-13
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2023-14
FORMULA_NAME AutoFlight-PT-06a-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716263026142
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 03:43:47] [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-21 03:43:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:43:48] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-21 03:43:48] [INFO ] Transformed 157 places.
[2024-05-21 03:43:48] [INFO ] Transformed 155 transitions.
[2024-05-21 03:43:48] [INFO ] Found NUPN structural information;
[2024-05-21 03:43:48] [INFO ] Parsed PT model containing 157 places and 155 transitions and 500 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
Support contains 94 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 125/125 transitions.
Applied a total of 0 rules in 20 ms. Remains 157 /157 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 157 cols
[2024-05-21 03:43:48] [INFO ] Computed 40 invariants in 24 ms
[2024-05-21 03:43:48] [INFO ] Implicit Places using invariants in 584 ms returned [45, 54, 60, 118, 124, 136, 142, 148, 154]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 633 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/157 places, 125/125 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 146 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 146 transition count 123
Applied a total of 4 rules in 28 ms. Remains 146 /148 variables (removed 2) and now considering 123/125 (removed 2) transitions.
// Phase 1: matrix 123 rows 146 cols
[2024-05-21 03:43:49] [INFO ] Computed 31 invariants in 4 ms
[2024-05-21 03:43:49] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 03:43:49] [INFO ] Invariant cache hit.
[2024-05-21 03:43:49] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-21 03:43:49] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/157 places, 123/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1053 ms. Remains : 146/157 places, 123/125 transitions.
Support contains 94 out of 146 places after structural reductions.
[2024-05-21 03:43:49] [INFO ] Flatten gal took : 91 ms
[2024-05-21 03:43:49] [INFO ] Flatten gal took : 25 ms
[2024-05-21 03:43:49] [INFO ] Input system was already deterministic with 123 transitions.
Reduction of identical properties reduced properties to check from 83 to 81
RANDOM walk for 40000 steps (1097 resets) in 4713 ms. (8 steps per ms) remains 10/81 properties
BEST_FIRST walk for 40004 steps (140 resets) in 430 ms. (92 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (142 resets) in 209 ms. (190 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40003 steps (106 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (134 resets) in 314 ms. (126 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (130 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (129 resets) in 91 ms. (434 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (131 resets) in 140 ms. (283 steps per ms) remains 4/5 properties
[2024-05-21 03:43:51] [INFO ] Invariant cache hit.
[2024-05-21 03:43:51] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 1 (OVERLAPS) 88/101 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 45/146 variables, 23/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 123/269 variables, 146/177 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 27/204 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/204 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/204 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 204 constraints, problems are : Problem set: 2 solved, 2 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 146/146 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 89/95 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/146 variables, 26/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 123/269 variables, 146/177 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 27/204 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/206 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/206 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/206 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 206 constraints, problems are : Problem set: 2 solved, 2 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 146/146 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 632ms problems are : Problem set: 2 solved, 2 unsolved
Finished Parikh walk after 483 steps, including 15 resets, run visited all 2 properties in 6 ms. (steps per millisecond=80 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 23 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-21 03:43:52] [INFO ] Flatten gal took : 14 ms
[2024-05-21 03:43:52] [INFO ] Flatten gal took : 14 ms
[2024-05-21 03:43:52] [INFO ] Input system was already deterministic with 123 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 144 transition count 121
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 144 transition count 121
Applied a total of 4 rules in 21 ms. Remains 144 /146 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 144 cols
[2024-05-21 03:43:52] [INFO ] Computed 31 invariants in 5 ms
[2024-05-21 03:43:52] [INFO ] Implicit Places using invariants in 169 ms returned [7, 14, 21, 28, 35, 42, 47, 50, 55, 89, 124]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 172 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/146 places, 121/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 130 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 130 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 129 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 129 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 128 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 128 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 127 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 127 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 126 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 126 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 125 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 125 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 124 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 124 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 123 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 123 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 122 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 122 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 121 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 121 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 120 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 120 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 119 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 119 transition count 107
Applied a total of 28 rules in 49 ms. Remains 119 /133 variables (removed 14) and now considering 107/121 (removed 14) transitions.
// Phase 1: matrix 107 rows 119 cols
[2024-05-21 03:43:52] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 03:43:52] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 03:43:52] [INFO ] Invariant cache hit.
[2024-05-21 03:43:52] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 119/146 places, 107/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 480 ms. Remains : 119/146 places, 107/123 transitions.
[2024-05-21 03:43:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 03:43:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:43:53] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-21 03:43:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:43:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 03:43:53] [INFO ] Time to serialize gal into /tmp/CTLFireability3942993295730505900.gal : 4 ms
[2024-05-21 03:43:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16011310963300953359.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/CTLFireability3942993295730505900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16011310963300953359.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.22675e+09,0.404224,15320,2,2082,5,41494,6,0,585,72686,0
Converting to forward existential form...Done !
original formula: E(AG(!(EG(((p149==1)&&(p156==1))))) U (E(!((AG((p5==1)) + (p44==1))) U (AG((p74==1)) * (p76!=1))) + !((AX(!(AG((p3==1)))) + !(EX(E((p78==...175
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,!(E(TRUE U !(!(EG(((p149==1)&&(p156==1)))))))),!((!(E(TRUE U !((p5==1)))) + (p44==1)))) * (p7...346
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t61, t91, Intersection with r...234
(forward)formula 0,0,1.27953,32412,1,0,203,161133,245,105,3381,105225,232
FORMULA AutoFlight-PT-06a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 146 transition count 110
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 133 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 132 transition count 109
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 28 place count 132 transition count 99
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 48 place count 122 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 120 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 120 transition count 97
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 68 place count 112 transition count 89
Applied a total of 68 rules in 40 ms. Remains 112 /146 variables (removed 34) and now considering 89/123 (removed 34) transitions.
// Phase 1: matrix 89 rows 112 cols
[2024-05-21 03:43:54] [INFO ] Computed 31 invariants in 2 ms
[2024-05-21 03:43:54] [INFO ] Implicit Places using invariants in 139 ms returned [5, 11, 16, 22, 28, 35, 36, 37, 40, 41, 42, 43, 44, 66, 94]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 140 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 97/146 places, 89/123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 97 transition count 71
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 79 transition count 71
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 36 place count 79 transition count 62
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 54 place count 70 transition count 62
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 68 transition count 60
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 68 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 67 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 66 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 66 transition count 58
Applied a total of 62 rules in 12 ms. Remains 66 /97 variables (removed 31) and now considering 58/89 (removed 31) transitions.
// Phase 1: matrix 58 rows 66 cols
[2024-05-21 03:43:54] [INFO ] Computed 16 invariants in 0 ms
[2024-05-21 03:43:54] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 03:43:54] [INFO ] Invariant cache hit.
[2024-05-21 03:43:54] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-21 03:43:54] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 66/146 places, 58/123 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 392 ms. Remains : 66/146 places, 58/123 transitions.
[2024-05-21 03:43:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:43:54] [INFO ] Flatten gal took : 5 ms
[2024-05-21 03:43:54] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-21 03:43:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:43:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:43:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1475631223200904006.gal : 2 ms
[2024-05-21 03:43:54] [INFO ] Time to serialize properties into /tmp/CTLFireability9825745113142579357.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/CTLFireability1475631223200904006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9825745113142579357.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.10694e+06,0.106008,6976,2,2177,5,14895,6,0,322,18336,0
Converting to forward existential form...Done !
original formula: AG(((AF((p77==1)) + ((p42==1)&&(p85==1))) + (A(((EG((p12==1)) * (p50==1)) * ((p131==1)&&(p156==1))) U EF((p30==1))) * (!(E(((p42==1)&&(p1...190
=> equivalent forward existential formula: (([((FwdU((FwdU(Init,TRUE) * !((!(EG(!((p77==1)))) + ((p42==1)&&(p85==1))))),!(E(TRUE U (p30==1)))) * !(((EG((p1...480
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t8, t13, t19, t27, t44, Intersection with reachable at each step enabled. (destroyed...191
Hit Full ! (commute/partial/dont) 53/4/5
(forward)formula 0,0,1.86021,57916,1,0,470,334758,150,221,2053,303855,524
FORMULA AutoFlight-PT-06a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 143 transition count 120
Applied a total of 6 rules in 6 ms. Remains 143 /146 variables (removed 3) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-05-21 03:43:56] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 03:43:56] [INFO ] Implicit Places using invariants in 146 ms returned [7, 14, 21, 28, 35, 42, 47, 50, 55, 89, 124, 142]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 147 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/146 places, 120/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 122 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 122 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 121 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 121 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 120 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 120 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 119 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 119 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 118 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 118 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 117 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 117 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 116 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 116 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 115 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 115 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 114 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 114 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 113 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 111 transition count 100
Applied a total of 40 rules in 47 ms. Remains 111 /131 variables (removed 20) and now considering 100/120 (removed 20) transitions.
// Phase 1: matrix 100 rows 111 cols
[2024-05-21 03:43:56] [INFO ] Computed 19 invariants in 1 ms
[2024-05-21 03:43:56] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 03:43:56] [INFO ] Invariant cache hit.
[2024-05-21 03:43:57] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/146 places, 100/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 406 ms. Remains : 111/146 places, 100/123 transitions.
[2024-05-21 03:43:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:43:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:43:57] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-21 03:43:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:43:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 03:43:57] [INFO ] Time to serialize gal into /tmp/CTLFireability1011311113997984770.gal : 3 ms
[2024-05-21 03:43:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7554870814119846876.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/CTLFireability1011311113997984770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7554870814119846876.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.19117e+09,0.400163,16404,2,1685,5,43974,6,0,546,79756,0
Converting to forward existential form...Done !
original formula: EG(EX((p59==1)))
=> equivalent forward existential formula: [FwdG(Init,EX((p59==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t49, t61, Intersection with r...234
(forward)formula 0,1,5.30374,151156,1,0,479,733725,222,293,3133,1.11631e+06,406
FORMULA AutoFlight-PT-06a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 143 transition count 120
Applied a total of 6 rules in 12 ms. Remains 143 /146 variables (removed 3) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-05-21 03:44:02] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 03:44:02] [INFO ] Implicit Places using invariants in 146 ms returned [7, 14, 21, 28, 35, 42, 50, 89, 142]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 148 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/146 places, 120/123 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 133 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 133 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 132 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 132 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 131 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 131 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 130 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 130 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 129 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 129 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 128 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 128 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 127 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 127 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 126 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 126 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 125 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 125 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 124 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 124 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 123 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 123 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 122 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 122 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 121 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 121 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 120 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 120 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 119 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 119 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 118 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 118 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 117 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 117 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 116 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 116 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 115 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 115 transition count 101
Applied a total of 38 rules in 19 ms. Remains 115 /134 variables (removed 19) and now considering 101/120 (removed 19) transitions.
// Phase 1: matrix 101 rows 115 cols
[2024-05-21 03:44:02] [INFO ] Computed 22 invariants in 1 ms
[2024-05-21 03:44:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 03:44:02] [INFO ] Invariant cache hit.
[2024-05-21 03:44:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 03:44:02] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/146 places, 101/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 413 ms. Remains : 115/146 places, 101/123 transitions.
[2024-05-21 03:44:02] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:44:02] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:44:02] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 03:44:02] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:44:02] [INFO ] Flatten gal took : 6 ms
[2024-05-21 03:44:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6163914008079131042.gal : 2 ms
[2024-05-21 03:44:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11815236675432593080.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/CTLFireability6163914008079131042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11815236675432593080.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.22518e+09,0.420972,15364,2,2278,5,41089,6,0,559,67735,0
Converting to forward existential form...Done !
original formula: (EG(AF((AF((p16==0)) * (EG(((p130==0)||(p155==0))) + (p20==1))))) * (EX(AX(AF(EG(((p57==1)&&(p147==1)))))) + EG(EX((((p48==1)&&(p129==1))...170
=> equivalent forward existential formula: ([(EY((Init * EG(!(EG(!((!(EG(!((p16==0)))) * (EG(((p130==0)||(p155==0))) + (p20==1))))))))) * !(EX(!(!(EG(!(EG(...338
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t49, t61, Intersection with r...234
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 03:44:33] [INFO ] Flatten gal took : 19 ms
[2024-05-21 03:44:33] [INFO ] Applying decomposition
[2024-05-21 03:44:33] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7955584866574893524.txt' '-o' '/tmp/graph7955584866574893524.bin' '-w' '/tmp/graph7955584866574893524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7955584866574893524.bin' '-l' '-1' '-v' '-w' '/tmp/graph7955584866574893524.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:44:33] [INFO ] Decomposing Gal with order
[2024-05-21 03:44:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:44:33] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-21 03:44:33] [INFO ] Flatten gal took : 57 ms
[2024-05-21 03:44:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 03:44:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17595558854390771988.gal : 5 ms
[2024-05-21 03:44:33] [INFO ] Time to serialize properties into /tmp/CTLFireability2475488929365952327.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/CTLFireability17595558854390771988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2475488929365952327.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22518e+09,0.076363,6072,195,19,5241,137,283,6855,34,241,0
Converting to forward existential form...Done !
original formula: (EG(AF((AF((i0.u4.p16==0)) * (EG(((i9.i1.u35.p130==0)||(i8.u46.p155==0))) + (i10.u5.p20==1))))) * (EX(AX(AF(EG(((i11.u43.p57==1)&&(i8.u46...245
=> equivalent forward existential formula: ([(EY((Init * EG(!(EG(!((!(EG(!((i0.u4.p16==0)))) * (EG(((i9.i1.u35.p130==0)||(i8.u46.p155==0))) + (i10.u5.p20==...443
Reverse transition relation is NOT exact ! Due to transitions t61, u0.t29, i0.u2.t25, i0.u4.t21, i1.i0.u6.t17, i1.i1.u7.t15, i3.u18.t43, i5.t49, i6.u8.t13,...327
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,6.79476,188232,1,0,388785,241,1790,488047,176,511,434372
FORMULA AutoFlight-PT-06a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 143 transition count 120
Applied a total of 6 rules in 4 ms. Remains 143 /146 variables (removed 3) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-05-21 03:44:40] [INFO ] Computed 31 invariants in 5 ms
[2024-05-21 03:44:40] [INFO ] Implicit Places using invariants in 138 ms returned [14, 28, 35, 42, 47, 50, 55, 89, 124, 142]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 139 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/146 places, 120/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 130 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 130 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 129 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 129 transition count 116
Applied a total of 8 rules in 6 ms. Remains 129 /133 variables (removed 4) and now considering 116/120 (removed 4) transitions.
// Phase 1: matrix 116 rows 129 cols
[2024-05-21 03:44:40] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 03:44:40] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 03:44:40] [INFO ] Invariant cache hit.
[2024-05-21 03:44:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 03:44:40] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 129/146 places, 116/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 417 ms. Remains : 129/146 places, 116/123 transitions.
[2024-05-21 03:44:40] [INFO ] Flatten gal took : 8 ms
[2024-05-21 03:44:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:44:40] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-21 03:44:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:44:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:44:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3539432883560231591.gal : 2 ms
[2024-05-21 03:44:40] [INFO ] Time to serialize properties into /tmp/CTLFireability4184911392659415943.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/CTLFireability3539432883560231591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4184911392659415943.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.19536e+09,0.327682,13632,2,1782,5,35325,6,0,630,61860,0
Converting to forward existential form...Done !
original formula: E(AG((p31==1)) U (AX((EG(A(((p18==1)&&(p114==1)) U (p50==1))) + (p2==1))) + (!((((AX((p12==1)) * AF(((p41==1)&&(p151==1)))) + !(((p7==1)&...209
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !((p31==1))))) * !(EX(!((EG(!((E(!((p50==1)) U (!(((p18==1)&&(p114==1))) * !((p50==1))))...501
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t45, t61, Intersection with r...235
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 03:45:10] [INFO ] Flatten gal took : 6 ms
[2024-05-21 03:45:10] [INFO ] Applying decomposition
[2024-05-21 03:45:10] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11151432269678668461.txt' '-o' '/tmp/graph11151432269678668461.bin' '-w' '/tmp/graph11151432269678668461.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11151432269678668461.bin' '-l' '-1' '-v' '-w' '/tmp/graph11151432269678668461.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:45:10] [INFO ] Decomposing Gal with order
[2024-05-21 03:45:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:45:10] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-21 03:45:10] [INFO ] Flatten gal took : 16 ms
[2024-05-21 03:45:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 03:45:10] [INFO ] Time to serialize gal into /tmp/CTLFireability14233862825461263800.gal : 4 ms
[2024-05-21 03:45:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14797433627308849580.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/CTLFireability14233862825461263800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14797433627308849580.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19536e+09,0.041943,4868,207,18,2411,160,294,2388,30,282,0
Converting to forward existential form...Done !
original formula: E(AG((i9.u8.p31==1)) U (AX((EG(A(((i1.u5.p18==1)&&(i3.u38.p114==1)) U (i1.u14.p50==1))) + (i7.u0.p2==1))) + (!((((AX((i0.u3.p12==1)) * AF...307
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !((i9.u8.p31==1))))) * !(EX(!((EG(!((E(!((i1.u14.p50==1)) U (!(((i1.u5.p18==1)&&(i3.u38....671
Reverse transition relation is NOT exact ! Due to transitions t43, t45, t61, u10.t9, i0.u3.t23, i1.u5.t19, i2.u7.t15, i3.u9.t11, i4.u11.t7, i7.u0.t29, i8.u...307
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,3.40254,107564,1,0,191863,216,1889,242091,154,427,251577
FORMULA AutoFlight-PT-06a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 143 transition count 120
Applied a total of 6 rules in 4 ms. Remains 143 /146 variables (removed 3) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-05-21 03:45:14] [INFO ] Computed 31 invariants in 0 ms
[2024-05-21 03:45:14] [INFO ] Implicit Places using invariants in 151 ms returned [7, 14, 21, 28, 35, 42, 47, 50, 55, 124, 142]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 152 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/146 places, 120/123 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 131 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 131 transition count 119
Applied a total of 2 rules in 3 ms. Remains 131 /132 variables (removed 1) and now considering 119/120 (removed 1) transitions.
// Phase 1: matrix 119 rows 131 cols
[2024-05-21 03:45:14] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 03:45:14] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 03:45:14] [INFO ] Invariant cache hit.
[2024-05-21 03:45:14] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/146 places, 119/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 411 ms. Remains : 131/146 places, 119/123 transitions.
[2024-05-21 03:45:14] [INFO ] Flatten gal took : 6 ms
[2024-05-21 03:45:14] [INFO ] Flatten gal took : 6 ms
[2024-05-21 03:45:14] [INFO ] Input system was already deterministic with 119 transitions.
[2024-05-21 03:45:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 03:45:14] [INFO ] Flatten gal took : 5 ms
[2024-05-21 03:45:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9445621938892523169.gal : 9 ms
[2024-05-21 03:45:14] [INFO ] Time to serialize properties into /tmp/CTLFireability6774152626921166478.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/CTLFireability9445621938892523169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6774152626921166478.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.19887e+09,0.463757,16004,2,1939,5,44734,6,0,645,70744,0
Converting to forward existential form...Done !
original formula: AX(((E(A(E((p47==1) U (p50==1)) U ((p92==1)&&(p155==1))) U ((AG(E((p23==1) U (p56==1))) + AG((p70==1))) + (p47==1))) * EX(EG((p0==0)))) *...166
=> equivalent forward existential formula: (([(EY(Init) * !(E(!((E(!(((p92==1)&&(p155==1))) U (!(E((p47==1) U (p50==1))) * !(((p92==1)&&(p155==1))))) + EG(...360
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t61, t110, Intersection with reach...231
(forward)formula 0,1,19.8277,451568,1,0,1765,3.09596e+06,288,904,3829,2.28942e+06,2039
FORMULA AutoFlight-PT-06a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 143 transition count 120
Applied a total of 6 rules in 3 ms. Remains 143 /146 variables (removed 3) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-05-21 03:45:34] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 03:45:34] [INFO ] Implicit Places using invariants in 151 ms returned [7, 14, 28, 35, 42, 47, 50, 55, 124]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 152 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/146 places, 120/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 134/146 places, 120/123 transitions.
[2024-05-21 03:45:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 03:45:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 03:45:34] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-21 03:45:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 03:45:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 03:45:34] [INFO ] Time to serialize gal into /tmp/CTLFireability869314399714973334.gal : 1 ms
[2024-05-21 03:45:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13206041677718029661.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/CTLFireability869314399714973334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13206041677718029661.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.23288e+09,0.582075,19208,2,2939,5,59381,6,0,656,87742,0
Converting to forward existential form...Done !
original formula: (AG((((AX(((p52==1)&&(p140==1))) + AF(((p125==1)&&(p156==1)))) + (EX((p2==0)) + (p21==0))) + (p108==0))) + AG(EX(EG((((p92==0)||(p155==0)...171
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !((((!(EX(!(((p52==1)&&(p140==1))))) + !(EG(!(((p125==1)&&(p156==1)))))) + (EX((p2==...252
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t61, t111, Intersection with reach...231
(forward)formula 0,1,10.7736,276304,1,0,1297,1.83529e+06,276,674,3806,1.48577e+06,1523
FORMULA AutoFlight-PT-06a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 143 transition count 120
Applied a total of 6 rules in 2 ms. Remains 143 /146 variables (removed 3) and now considering 120/123 (removed 3) transitions.
[2024-05-21 03:45:45] [INFO ] Invariant cache hit.
[2024-05-21 03:45:45] [INFO ] Implicit Places using invariants in 156 ms returned [7, 14, 21, 28, 42, 47, 50, 55, 89, 124, 142]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 157 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/146 places, 120/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 130 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 130 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 129 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 129 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 128 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 128 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 127 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 127 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 126 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 126 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 125 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 125 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 124 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 124 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 123 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 123 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 122 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 122 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 121 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 121 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 120 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 120 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 119 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 119 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 118 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 118 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 117 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 117 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 116 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 116 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 115 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 115 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 114 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 114 transition count 102
Applied a total of 36 rules in 15 ms. Remains 114 /132 variables (removed 18) and now considering 102/120 (removed 18) transitions.
// Phase 1: matrix 102 rows 114 cols
[2024-05-21 03:45:45] [INFO ] Computed 20 invariants in 1 ms
[2024-05-21 03:45:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 03:45:45] [INFO ] Invariant cache hit.
[2024-05-21 03:45:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:45:46] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 114/146 places, 102/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 385 ms. Remains : 114/146 places, 102/123 transitions.
[2024-05-21 03:45:46] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:45:46] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:45:46] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-21 03:45:46] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:45:46] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:45:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5844646320526561899.gal : 2 ms
[2024-05-21 03:45:46] [INFO ] Time to serialize properties into /tmp/CTLFireability9330518449173418169.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/CTLFireability5844646320526561899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9330518449173418169.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.19169e+09,0.516832,19620,2,2359,5,55049,6,0,558,93946,0
Converting to forward existential form...Done !
original formula: EX(AX(AF(((p35==1)&&(p110==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(EG(!(((p35==1)&&(p110==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t61, t91, Intersection with r...234
(forward)formula 0,0,8.64514,247968,1,0,802,1.60732e+06,227,398,3211,1.31689e+06,907
FORMULA AutoFlight-PT-06a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 143 transition count 120
Applied a total of 6 rules in 2 ms. Remains 143 /146 variables (removed 3) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-05-21 03:45:54] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 03:45:54] [INFO ] Implicit Places using invariants in 150 ms returned [7, 14, 21, 28, 35, 42, 47, 50, 55, 89, 124, 142]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 151 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/146 places, 120/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 122 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 122 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 121 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 121 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 120 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 120 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 119 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 119 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 118 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 118 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 117 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 117 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 116 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 116 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 115 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 115 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 114 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 114 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 113 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 111 transition count 100
Applied a total of 40 rules in 20 ms. Remains 111 /131 variables (removed 20) and now considering 100/120 (removed 20) transitions.
// Phase 1: matrix 100 rows 111 cols
[2024-05-21 03:45:54] [INFO ] Computed 19 invariants in 0 ms
[2024-05-21 03:45:55] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 03:45:55] [INFO ] Invariant cache hit.
[2024-05-21 03:45:55] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/146 places, 100/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 392 ms. Remains : 111/146 places, 100/123 transitions.
[2024-05-21 03:45:55] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:45:55] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:45:55] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-21 03:45:55] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:45:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:45:55] [INFO ] Time to serialize gal into /tmp/CTLFireability16781774330327056486.gal : 2 ms
[2024-05-21 03:45:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16171655490950418427.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/CTLFireability16781774330327056486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16171655490950418427.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.19117e+09,0.388929,16428,2,1685,5,43974,6,0,546,79756,0
Converting to forward existential form...Done !
original formula: EF(EG(AF(((p44==1) + (EX((p10==1)) * AF((p17==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((p44==1) + (EX((p10==1)) * !(EG(!((p17==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t49, t61, Intersection with r...234
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 03:46:25] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:46:25] [INFO ] Applying decomposition
[2024-05-21 03:46:25] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15348084427711069255.txt' '-o' '/tmp/graph15348084427711069255.bin' '-w' '/tmp/graph15348084427711069255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15348084427711069255.bin' '-l' '-1' '-v' '-w' '/tmp/graph15348084427711069255.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:46:25] [INFO ] Decomposing Gal with order
[2024-05-21 03:46:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:46:25] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 03:46:25] [INFO ] Flatten gal took : 11 ms
[2024-05-21 03:46:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 03:46:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12233347338635234551.gal : 3 ms
[2024-05-21 03:46:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8719813962634695801.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/CTLFireability12233347338635234551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8719813962634695801.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19117e+09,0.066768,5740,197,16,4655,134,233,6078,30,232,0
Converting to forward existential form...Done !
original formula: EF(EG(AF(((i0.u12.p44==1) + (EX((i7.u2.p10==1)) * AF((i7.u4.p17==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((i0.u12.p44==1) + (EX((i7.u2.p10==1)) * !(EG(!((i7.u4.p17==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t61, i0.u0.t29, i0.u1.t27, i1.u6.t17, i1.u7.t15, i2.u9.t11, i3.u11.t7, i4.u18.t43, i6.t49, i7...320
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,2.5389,87316,1,0,190583,154,1607,233018,148,273,201901
FORMULA AutoFlight-PT-06a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 136 transition count 82
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 89 place count 96 transition count 82
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 89 place count 96 transition count 69
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 121 place count 77 transition count 69
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 121 place count 77 transition count 63
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 133 place count 71 transition count 63
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 68 transition count 60
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 68 transition count 60
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 165 place count 55 transition count 47
Applied a total of 165 rules in 16 ms. Remains 55 /146 variables (removed 91) and now considering 47/123 (removed 76) transitions.
// Phase 1: matrix 47 rows 55 cols
[2024-05-21 03:46:27] [INFO ] Computed 16 invariants in 1 ms
[2024-05-21 03:46:27] [INFO ] Implicit Places using invariants in 69 ms returned [31, 44, 54]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/146 places, 47/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 50 transition count 45
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 49 transition count 44
Applied a total of 6 rules in 6 ms. Remains 49 /52 variables (removed 3) and now considering 44/47 (removed 3) transitions.
// Phase 1: matrix 44 rows 49 cols
[2024-05-21 03:46:27] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 03:46:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 03:46:28] [INFO ] Invariant cache hit.
[2024-05-21 03:46:28] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 49/146 places, 44/123 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 216 ms. Remains : 49/146 places, 44/123 transitions.
[2024-05-21 03:46:28] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:46:28] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:46:28] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-21 03:46:28] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:46:28] [INFO ] Flatten gal took : 1 ms
[2024-05-21 03:46:28] [INFO ] Time to serialize gal into /tmp/CTLFireability2922570775267143624.gal : 1 ms
[2024-05-21 03:46:28] [INFO ] Time to serialize properties into /tmp/CTLFireability13281780295593518986.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/CTLFireability2922570775267143624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13281780295593518986.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,102400,0.01229,3648,2,163,5,1168,6,0,243,1116,0
Converting to forward existential form...Done !
original formula: AG(EF(((p8==1)&&(p87==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p8==1)&&(p87==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.03297,4496,1,0,9,5866,14,3,1088,2506,5
FORMULA AutoFlight-PT-06a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 143 transition count 120
Applied a total of 6 rules in 5 ms. Remains 143 /146 variables (removed 3) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-05-21 03:46:28] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 03:46:28] [INFO ] Implicit Places using invariants in 124 ms returned [7, 14, 21, 28, 35, 42, 47, 50, 55, 89, 124, 142]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 126 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/146 places, 120/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 129 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 129 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 126 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 126 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 125 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 125 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 124 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 124 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 123 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 123 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 122 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 122 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 121 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 121 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 120 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 120 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 119 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 119 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 118 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 118 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 117 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 117 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 116 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 116 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 115 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 115 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 114 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 114 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 113 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 113 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 112 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 112 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 111 transition count 100
Applied a total of 40 rules in 44 ms. Remains 111 /131 variables (removed 20) and now considering 100/120 (removed 20) transitions.
// Phase 1: matrix 100 rows 111 cols
[2024-05-21 03:46:28] [INFO ] Computed 19 invariants in 3 ms
[2024-05-21 03:46:28] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 03:46:28] [INFO ] Invariant cache hit.
[2024-05-21 03:46:28] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/146 places, 100/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 111/146 places, 100/123 transitions.
[2024-05-21 03:46:28] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:46:28] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:46:28] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-21 03:46:28] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:46:28] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:46:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12950211840325689907.gal : 1 ms
[2024-05-21 03:46:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4300980680466533937.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/CTLFireability12950211840325689907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4300980680466533937.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.19117e+09,0.405654,16428,2,1685,5,43974,6,0,546,79756,0
Converting to forward existential form...Done !
original formula: EF(((p34==0) * (EG(EX((p44==0))) + ((AG(AX((p47==0))) * (p36==1)) * (p91==1)))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * (p34==0)),EX((p44==0)))] != FALSE + [((((FwdU(Init,TRUE) * (p34==0)) * (p91==1)) * (p3...210
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t49, t61, Intersection with r...234
(forward)formula 0,1,1.06784,29620,1,0,247,138737,223,152,3134,133566,267
FORMULA AutoFlight-PT-06a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 144 transition count 121
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 144 transition count 121
Applied a total of 4 rules in 3 ms. Remains 144 /146 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 144 cols
[2024-05-21 03:46:29] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 03:46:29] [INFO ] Implicit Places using invariants in 104 ms returned [14, 21, 28, 35, 42, 47, 50, 55, 89, 124]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 105 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/146 places, 121/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 132 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 132 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 131 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 131 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 130 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 130 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 129 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 129 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 128 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 128 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 127 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 127 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 126 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 126 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 125 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 125 transition count 112
Applied a total of 18 rules in 8 ms. Remains 125 /134 variables (removed 9) and now considering 112/121 (removed 9) transitions.
// Phase 1: matrix 112 rows 125 cols
[2024-05-21 03:46:29] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 03:46:29] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 03:46:29] [INFO ] Invariant cache hit.
[2024-05-21 03:46:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:46:30] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 125/146 places, 112/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 374 ms. Remains : 125/146 places, 112/123 transitions.
[2024-05-21 03:46:30] [INFO ] Flatten gal took : 5 ms
[2024-05-21 03:46:30] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:46:30] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-21 03:46:30] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:46:30] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:46:30] [INFO ] Time to serialize gal into /tmp/CTLFireability8170339815750272874.gal : 6 ms
[2024-05-21 03:46:30] [INFO ] Time to serialize properties into /tmp/CTLFireability8482065979809031785.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/CTLFireability8170339815750272874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8482065979809031785.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.22806e+09,0.834762,25556,2,3028,5,71290,6,0,612,134182,0
Converting to forward existential form...Done !
original formula: ((EF(((((((((AG((p2==1)) + (p6==0)) + (p121==0)) * (p8==1)) * (p87==1)) + ((p34==0) * EF((p77==1)))) + ((((p7==1)&&(p106==1))||(p59==1))&...377
=> equivalent forward existential formula: (([(Init * !(E(TRUE U ((((((((!(E(TRUE U !((p2==1)))) + (p6==0)) + (p121==0)) * (p8==1)) * (p87==1)) + ((p34==0)...568
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t86, t97, Intersection with r...234
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 03:47:00] [INFO ] Flatten gal took : 5 ms
[2024-05-21 03:47:00] [INFO ] Applying decomposition
[2024-05-21 03:47:00] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7676462117854832494.txt' '-o' '/tmp/graph7676462117854832494.bin' '-w' '/tmp/graph7676462117854832494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7676462117854832494.bin' '-l' '-1' '-v' '-w' '/tmp/graph7676462117854832494.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:47:00] [INFO ] Decomposing Gal with order
[2024-05-21 03:47:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:47:00] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-21 03:47:00] [INFO ] Flatten gal took : 11 ms
[2024-05-21 03:47:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 03:47:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8771355467269102148.gal : 3 ms
[2024-05-21 03:47:00] [INFO ] Time to serialize properties into /tmp/CTLFireability176950061268195995.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/CTLFireability8771355467269102148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability176950061268195995.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22806e+09,0.064962,5620,204,21,3936,198,263,5165,37,346,0
Converting to forward existential form...Done !
original formula: ((EF(((((((((AG((u0.p2==1)) + (i11.u1.p6==0)) + (i11.u38.p121==0)) * (i9.u3.p8==1)) * (i9.u29.p87==1)) + ((i12.i0.u10.p34==0) * EF((i6.u2...572
=> equivalent forward existential formula: (([(Init * !(E(TRUE U ((((((((!(E(TRUE U !((u0.p2==1)))) + (i11.u1.p6==0)) + (i11.u38.p121==0)) * (i9.u3.p8==1))...777
Reverse transition relation is NOT exact ! Due to transitions u0.t29, u11.t9, i0.i0.u4.t23, i1.u6.t19, i2.u7.t17, i2.u9.t13, i3.u8.t15, i4.u12.t7, i5.t97, ...326
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1.66645,62908,1,0,130683,322,1824,195858,194,591,152194
FORMULA AutoFlight-PT-06a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 146 transition count 108
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 131 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 130 transition count 107
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 32 place count 130 transition count 98
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 50 place count 121 transition count 98
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 118 transition count 95
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 118 transition count 95
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 80 place count 106 transition count 83
Applied a total of 80 rules in 13 ms. Remains 106 /146 variables (removed 40) and now considering 83/123 (removed 40) transitions.
// Phase 1: matrix 83 rows 106 cols
[2024-05-21 03:47:01] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 03:47:01] [INFO ] Implicit Places using invariants in 121 ms returned [5, 10, 20, 25, 30, 33, 34, 35, 36, 37, 38, 39, 40, 61, 89, 105]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 126 ms to find 16 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 90/146 places, 83/123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 90 transition count 63
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 70 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 69 transition count 62
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 42 place count 69 transition count 58
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 50 place count 65 transition count 58
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 63 transition count 56
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 63 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 61 transition count 54
Applied a total of 58 rules in 7 ms. Remains 61 /90 variables (removed 29) and now considering 54/83 (removed 29) transitions.
// Phase 1: matrix 54 rows 61 cols
[2024-05-21 03:47:01] [INFO ] Computed 15 invariants in 0 ms
[2024-05-21 03:47:02] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 03:47:02] [INFO ] Invariant cache hit.
[2024-05-21 03:47:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 03:47:02] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 61/146 places, 54/123 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 292 ms. Remains : 61/146 places, 54/123 transitions.
[2024-05-21 03:47:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:47:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:47:02] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-21 03:47:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:47:02] [INFO ] Flatten gal took : 1 ms
[2024-05-21 03:47:02] [INFO ] Time to serialize gal into /tmp/CTLFireability15178815438514983965.gal : 1 ms
[2024-05-21 03:47:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16411919034991829108.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/CTLFireability15178815438514983965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16411919034991829108.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,270337,0.059499,5380,2,1330,5,8403,6,0,298,9487,0
Converting to forward existential form...Done !
original formula: EG(AF((((p44==0)&&((p1==0)||(p86==0)))||((p79==0)&&((p21==0)||(p96==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((p44==0)&&((p1==0)||(p86==0)))||((p79==0)&&((p21==0)||(p96==0))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.22118,10132,1,0,9,33357,21,6,1481,18194,9
FORMULA AutoFlight-PT-06a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 145 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 145 transition count 122
Applied a total of 2 rules in 3 ms. Remains 145 /146 variables (removed 1) and now considering 122/123 (removed 1) transitions.
// Phase 1: matrix 122 rows 145 cols
[2024-05-21 03:47:02] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 03:47:02] [INFO ] Implicit Places using invariants in 162 ms returned [7, 14, 21, 28, 35, 42, 50, 55, 89, 125]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 164 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/146 places, 122/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 126 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 126 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 125 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 125 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 122 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 122 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 121 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 121 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 120 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 120 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 119 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 119 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 118 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 118 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 117 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 117 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 116 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 116 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 115 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 115 transition count 102
Applied a total of 40 rules in 16 ms. Remains 115 /135 variables (removed 20) and now considering 102/122 (removed 20) transitions.
// Phase 1: matrix 102 rows 115 cols
[2024-05-21 03:47:02] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 03:47:02] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 03:47:02] [INFO ] Invariant cache hit.
[2024-05-21 03:47:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 03:47:02] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/146 places, 102/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 384 ms. Remains : 115/146 places, 102/123 transitions.
[2024-05-21 03:47:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:47:02] [INFO ] Flatten gal took : 7 ms
[2024-05-21 03:47:02] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-21 03:47:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:47:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:47:02] [INFO ] Time to serialize gal into /tmp/CTLFireability18315784875774457318.gal : 1 ms
[2024-05-21 03:47:02] [INFO ] Time to serialize properties into /tmp/CTLFireability2658719031455727291.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/CTLFireability18315784875774457318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2658719031455727291.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.25919e+09,0.554383,18832,2,3050,5,53746,6,0,562,88086,0
Converting to forward existential form...Done !
original formula: E(((p131==1)&&(p156==1)) U E((AG((p33==1)) + (((p10==1)&&(p126==1)) * (AG(((p48==1)&&(p129==1))) + AX(((p52==1)&&(p140==1)))))) U EG(!(((...179
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,((p131==1)&&(p156==1))),(!(E(TRUE U !((p33==1)))) + (((p10==1)&&(p126==1)) * (!(E(TRUE U !(...254
Hit Full ! (commute/partial/dont) 90/11/12
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t49, t61, Intersection with r...234
Hit Full ! (commute/partial/dont) 90/0/12
(forward)formula 0,1,3.03212,71520,1,0,206,291804,253,108,3649,381300,239
FORMULA AutoFlight-PT-06a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 143 transition count 120
Applied a total of 6 rules in 2 ms. Remains 143 /146 variables (removed 3) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-05-21 03:47:05] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 03:47:05] [INFO ] Implicit Places using invariants in 105 ms returned [7, 35, 42, 47, 55, 89, 124, 142]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 106 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/146 places, 120/123 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 116
Applied a total of 8 rules in 3 ms. Remains 131 /135 variables (removed 4) and now considering 116/120 (removed 4) transitions.
// Phase 1: matrix 116 rows 131 cols
[2024-05-21 03:47:05] [INFO ] Computed 23 invariants in 0 ms
[2024-05-21 03:47:06] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 03:47:06] [INFO ] Invariant cache hit.
[2024-05-21 03:47:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 03:47:06] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/146 places, 116/123 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 334 ms. Remains : 131/146 places, 116/123 transitions.
[2024-05-21 03:47:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 03:47:06] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:47:06] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-21 03:47:06] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:47:06] [INFO ] Flatten gal took : 3 ms
[2024-05-21 03:47:06] [INFO ] Time to serialize gal into /tmp/CTLFireability4725897763825503972.gal : 1 ms
[2024-05-21 03:47:06] [INFO ] Time to serialize properties into /tmp/CTLFireability6672934781061831903.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/CTLFireability4725897763825503972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6672934781061831903.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.19536e+09,0.411992,15760,2,2031,5,43827,6,0,634,74325,0
Converting to forward existential form...Done !
original formula: AF(((EF((AG(((p28==1)&&(p97==1))) * EX((p59==1)))) * A(E(EF((p70==1)) U (((p17==1)&&(p14==1))&&(p107==1))) U (EG((p74==1)) * (A((p10==1) ...393
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U (!(E(TRUE U !(((p28==1)&&(p97==1))))) * EX((p59==1)))) * !((E(!((EG((p74==1)) * (!((E(!(...953
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t43, t45, t61, Intersection with r...235
(forward)formula 0,0,29.6654,760160,1,0,2582,4.89595e+06,306,1516,4037,4.406e+06,3078
FORMULA AutoFlight-PT-06a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 146 transition count 107
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 130 transition count 107
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 130 transition count 97
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 120 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 117 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 117 transition count 94
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 78 place count 107 transition count 84
Applied a total of 78 rules in 11 ms. Remains 107 /146 variables (removed 39) and now considering 84/123 (removed 39) transitions.
// Phase 1: matrix 84 rows 107 cols
[2024-05-21 03:47:36] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 03:47:36] [INFO ] Implicit Places using invariants in 129 ms returned [5, 10, 20, 25, 32, 33, 34, 35, 36, 37, 40, 41, 42, 62, 90, 106]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 145 ms to find 16 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/146 places, 84/123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 91 transition count 62
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 69 transition count 62
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 44 place count 69 transition count 58
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 65 transition count 58
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 63 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 63 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 61 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 60 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 60 transition count 53
Applied a total of 62 rules in 12 ms. Remains 60 /91 variables (removed 31) and now considering 53/84 (removed 31) transitions.
// Phase 1: matrix 53 rows 60 cols
[2024-05-21 03:47:36] [INFO ] Computed 15 invariants in 0 ms
[2024-05-21 03:47:36] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 03:47:36] [INFO ] Invariant cache hit.
[2024-05-21 03:47:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 03:47:36] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 60/146 places, 53/123 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 325 ms. Remains : 60/146 places, 53/123 transitions.
[2024-05-21 03:47:36] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:47:36] [INFO ] Flatten gal took : 1 ms
[2024-05-21 03:47:36] [INFO ] Input system was already deterministic with 53 transitions.
[2024-05-21 03:47:36] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:47:36] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:47:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8210894933425585630.gal : 0 ms
[2024-05-21 03:47:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16128565314356049818.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/CTLFireability8210894933425585630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16128565314356049818.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,471041,0.038281,4588,2,1080,5,4496,6,0,293,5627,0
Converting to forward existential form...Done !
original formula: EF(EG((((p21==1)&&(p82==1)) + (AF((p40==0)) * (((p38==0)||(p150==0))||(p53==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((p21==1)&&(p82==1)) + (!(EG(!((p40==0)))) * (((p38==0)||(p150==0))||(p53==0)))))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t16, t45, t52, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,1,0.349713,14884,1,0,198,55476,135,88,1738,54809,220
FORMULA AutoFlight-PT-06a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 03:47:36] [INFO ] Flatten gal took : 5 ms
[2024-05-21 03:47:36] [INFO ] Flatten gal took : 4 ms
Total runtime 228979 ms.
BK_STOP 1716263256909
--------------------
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="AutoFlight-PT-06a"
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 AutoFlight-PT-06a, 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 r026-smll-171620167100138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06a.tgz
mv AutoFlight-PT-06a 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 ;