About the Execution of 2021-gold for ParamProductionCell-PT-2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 880.067 | 52139.00 | 78876.00 | 495.30 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r162-smll-165277003100169.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is ParamProductionCell-PT-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-165277003100169
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 9.0K Apr 29 17:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 29 17:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 17:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 174K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME Liveness
=== Now, execution of the tool begins
BK_START 1652992265172
Running Version 0
[2022-05-19 20:31:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-19 20:31:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:31:08] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2022-05-19 20:31:08] [INFO ] Transformed 231 places.
[2022-05-19 20:31:08] [INFO ] Transformed 202 transitions.
[2022-05-19 20:31:08] [INFO ] Found NUPN structural information;
[2022-05-19 20:31:08] [INFO ] Parsed PT model containing 231 places and 202 transitions in 307 ms.
Built sparse matrix representations for Structural reductions in 12 ms.22817KB memory used
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Applied a total of 0 rules in 57 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Applied a total of 0 rules in 21 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2022-05-19 20:31:09] [INFO ] Computed 59 place invariants in 32 ms
[2022-05-19 20:31:09] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-19 20:31:09] [INFO ] Computed 59 place invariants in 15 ms
[2022-05-19 20:31:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-19 20:31:10] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
[2022-05-19 20:31:10] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-19 20:31:10] [INFO ] Computed 59 place invariants in 11 ms
[2022-05-19 20:31:10] [INFO ] Dead Transitions using invariants and state equation in 443 ms returned []
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2695 ms (no deadlock found). (steps per millisecond=463 )
Random directed walk for 1250001 steps, including 0 resets, run took 1828 ms (no deadlock found). (steps per millisecond=683 )
// Phase 1: matrix 202 rows 231 cols
[2022-05-19 20:31:15] [INFO ] Computed 59 place invariants in 8 ms
[2022-05-19 20:31:15] [INFO ] [Real]Absence check using 35 positive place invariants in 90 ms returned sat
[2022-05-19 20:31:15] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 264 ms returned sat
[2022-05-19 20:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:31:17] [INFO ] [Real]Absence check using state equation in 1676 ms returned sat
[2022-05-19 20:31:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:31:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 25 ms returned sat
[2022-05-19 20:31:17] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 42 ms returned sat
[2022-05-19 20:31:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:31:18] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2022-05-19 20:31:18] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-19 20:31:18] [INFO ] [Nat]Added 68 Read/Feed constraints in 29 ms returned sat
[2022-05-19 20:31:18] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 4 ms to minimize.
[2022-05-19 20:31:18] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 3 ms to minimize.
[2022-05-19 20:31:19] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2022-05-19 20:31:19] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 3 ms to minimize.
[2022-05-19 20:31:19] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2022-05-19 20:31:19] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2022-05-19 20:31:19] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 0 ms to minimize.
[2022-05-19 20:31:19] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2022-05-19 20:31:19] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2022-05-19 20:31:19] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2022-05-19 20:31:20] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2022-05-19 20:31:20] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2022-05-19 20:31:20] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2022-05-19 20:31:20] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
[2022-05-19 20:31:21] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2022-05-19 20:31:21] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2022-05-19 20:31:21] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2022-05-19 20:31:21] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2022-05-19 20:31:21] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2022-05-19 20:31:21] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 3 ms to minimize.
[2022-05-19 20:31:21] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2022-05-19 20:31:22] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2022-05-19 20:31:22] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2022-05-19 20:31:22] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2022-05-19 20:31:22] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2022-05-19 20:31:22] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2022-05-19 20:31:22] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2022-05-19 20:31:22] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2022-05-19 20:31:23] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2022-05-19 20:31:23] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2022-05-19 20:31:23] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2022-05-19 20:31:23] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2022-05-19 20:31:23] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2022-05-19 20:31:23] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
[2022-05-19 20:31:23] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 7 ms to minimize.
[2022-05-19 20:31:23] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2022-05-19 20:31:23] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 5440 ms
[2022-05-19 20:31:23] [INFO ] Computed and/alt/rep : 195/512/195 causal constraints (skipped 5 transitions) in 16 ms.
[2022-05-19 20:31:26] [INFO ] Added : 195 causal constraints over 39 iterations in 2193 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
Parikh directed walk for 40300 steps, including 434 resets, run took 181 ms. (steps per millisecond=222 )
Random directed walk for 500001 steps, including 0 resets, run took 845 ms (no deadlock found). (steps per millisecond=591 )
Random walk for 500000 steps, including 0 resets, run took 1001 ms (no deadlock found). (steps per millisecond=499 )
Random directed walk for 500000 steps, including 0 resets, run took 782 ms (no deadlock found). (steps per millisecond=639 )
Random walk for 500000 steps, including 0 resets, run took 732 ms (no deadlock found). (steps per millisecond=683 )
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2022-05-19 20:31:29] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-19 20:31:29] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-19 20:31:29] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-19 20:31:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-19 20:31:29] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2022-05-19 20:31:29] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-19 20:31:29] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-19 20:31:30] [INFO ] Dead Transitions using invariants and state equation in 255 ms returned []
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2042 ms (no deadlock found). (steps per millisecond=612 )
Random directed walk for 1250000 steps, including 0 resets, run took 1873 ms (no deadlock found). (steps per millisecond=667 )
// Phase 1: matrix 202 rows 231 cols
[2022-05-19 20:31:34] [INFO ] Computed 59 place invariants in 5 ms
[2022-05-19 20:31:34] [INFO ] [Real]Absence check using 35 positive place invariants in 65 ms returned sat
[2022-05-19 20:31:34] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 238 ms returned sat
[2022-05-19 20:31:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:31:35] [INFO ] [Real]Absence check using state equation in 1120 ms returned sat
[2022-05-19 20:31:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:31:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2022-05-19 20:31:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 32 ms returned sat
[2022-05-19 20:31:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:31:36] [INFO ] [Nat]Absence check using state equation in 866 ms returned sat
[2022-05-19 20:31:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-19 20:31:36] [INFO ] [Nat]Added 68 Read/Feed constraints in 36 ms returned sat
[2022-05-19 20:31:36] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2022-05-19 20:31:36] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2022-05-19 20:31:37] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2022-05-19 20:31:37] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2022-05-19 20:31:37] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2022-05-19 20:31:37] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2022-05-19 20:31:37] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2022-05-19 20:31:37] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2022-05-19 20:31:37] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2022-05-19 20:31:37] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2022-05-19 20:31:37] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2022-05-19 20:31:38] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2022-05-19 20:31:38] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2022-05-19 20:31:38] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 1 ms to minimize.
[2022-05-19 20:31:38] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2022-05-19 20:31:38] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2022-05-19 20:31:39] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2022-05-19 20:31:39] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2022-05-19 20:31:39] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2022-05-19 20:31:39] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2022-05-19 20:31:39] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2022-05-19 20:31:39] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2022-05-19 20:31:40] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2022-05-19 20:31:40] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 13 ms to minimize.
[2022-05-19 20:31:40] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2022-05-19 20:31:40] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2022-05-19 20:31:40] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2022-05-19 20:31:40] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2022-05-19 20:31:41] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 1 ms to minimize.
[2022-05-19 20:31:41] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 4 ms to minimize.
[2022-05-19 20:31:41] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2022-05-19 20:31:41] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2022-05-19 20:31:41] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2022-05-19 20:31:41] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2022-05-19 20:31:41] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2022-05-19 20:31:42] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-05-19 20:31:42] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 5344 ms
[2022-05-19 20:31:42] [INFO ] Computed and/alt/rep : 195/512/195 causal constraints (skipped 5 transitions) in 22 ms.
[2022-05-19 20:31:44] [INFO ] Added : 195 causal constraints over 39 iterations in 2297 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
Parikh directed walk for 40300 steps, including 432 resets, run took 88 ms. (steps per millisecond=457 )
Random directed walk for 500000 steps, including 0 resets, run took 823 ms (no deadlock found). (steps per millisecond=607 )
Random walk for 500000 steps, including 0 resets, run took 1255 ms (no deadlock found). (steps per millisecond=398 )
Random directed walk for 500000 steps, including 0 resets, run took 604 ms (no deadlock found). (steps per millisecond=827 )
Random walk for 500000 steps, including 0 resets, run took 719 ms (no deadlock found). (steps per millisecond=695 )
[2022-05-19 20:31:48] [INFO ] Flatten gal took : 141 ms
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
Applied a total of 76 rules in 87 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2022-05-19 20:31:48] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-19 20:31:48] [INFO ] Implicit Places using invariants in 322 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 92, 93, 95, 97, 98, 132, 133, 135, 137, 138, 162, 163, 166, 167, 172, 173, 175, 184]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 326 ms to find 39 implicit places.
// Phase 1: matrix 164 rows 154 cols
[2022-05-19 20:31:48] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 20:31:48] [INFO ] Dead Transitions using invariants and state equation in 158 ms returned []
Starting structural reductions, iteration 1 : 154/231 places, 164/202 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 154 transition count 143
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 133 transition count 143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 42 place count 133 transition count 139
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 129 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 127 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 127 transition count 137
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 140 place count 84 transition count 94
Applied a total of 140 rules in 24 ms. Remains 84 /154 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 84 cols
[2022-05-19 20:31:48] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:31:49] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2022-05-19 20:31:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:31:49] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-19 20:31:49] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
[2022-05-19 20:31:49] [INFO ] Initial state test concluded for 2 properties.
Finished random walk after 1692 steps, including 0 resets, run visited all 92 properties in 21 ms. (steps per millisecond=80 )
Able to resolve query QuasiLiveness after proving 94 properties.
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
Applied a total of 76 rules in 32 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2022-05-19 20:31:49] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-19 20:31:49] [INFO ] Implicit Places using invariants in 274 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 92, 93, 95, 97, 98, 132, 133, 135, 137, 138, 162, 163, 166, 167, 172, 173, 175, 184]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 276 ms to find 39 implicit places.
// Phase 1: matrix 164 rows 154 cols
[2022-05-19 20:31:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:31:49] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Starting structural reductions, iteration 1 : 154/231 places, 164/202 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 154 transition count 143
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 133 transition count 143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 42 place count 133 transition count 139
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 129 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 127 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 127 transition count 137
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 140 place count 84 transition count 94
Applied a total of 140 rules in 21 ms. Remains 84 /154 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 84 cols
[2022-05-19 20:31:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:31:49] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2022-05-19 20:31:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:31:49] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-19 20:31:50] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
[2022-05-19 20:31:50] [INFO ] Flatten gal took : 23 ms
[2022-05-19 20:31:50] [INFO ] Flatten gal took : 20 ms
[2022-05-19 20:31:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14918159821697224270.gal : 15 ms
[2022-05-19 20:31:50] [INFO ] Time to serialize properties into /tmp/CTLFireability3651098645903536931.ctl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14918159821697224270.gal, -t, CGAL, -ctl, /tmp/CTLFireability3651098645903536931.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14918159821697224270.gal -t CGAL -ctl /tmp/CTLFireability3651098645903536931.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 94 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,8382,0.133674,8160,2,2656,5,16101,6,0,433,13479,0
Converting to forward existential form...Done !
original formula: AG(EF(((press_at_lower_pos>=1)&&(PU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_lower_pos>=1)&&(PU_lower_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions deposit_belt_lock_input_area.deposit_belt_lock_output_area.DB_trans_Pstart, feed_belt_lock_input_area.feed_belt_lock_output_area.FB_trans_Pstart, crane_lock_output_area.CU_lower_Pstart, crane_lock_input_area.CL_lower_Pstart, TL_rot_Cstop.TL_rot_Pstop.TL_lower_Pstart, TU_rot_Cstop.TU_rot_Pstop.TU_lift_Pstart, FB_deliver_Cstop.FB_deliver_Pstop.feed_belt_unlock_input_area.feed_belt_unlock_output_area.table_lock_input_area.TU_rot_Pstart, A2U_rot1_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, A2U_rot2_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, A2U_rot3_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, A2U_ret_Cstop.A2U_ret_Pstop.arm2_unlock_output_area.arm2_unlock_swivel_2, A2L_rot1_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, A2L_rot2_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, A2L_rot3_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, A2L_ret_Cstop.A2L_ret_Pstop.arm2_unlock_input_area.arm2_unlock_swivel_1.press_lock_output_area.PL_lower_Pstart, A1L_rot1_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, A1L_rot2_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, A1L_rot3_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, A1L_ret_Cstop.A1L_ret_Pstop.arm1_unlock_input_area.arm1_unlock_swivel_1.table_lock_output_area.TL_rot_Pstart, A1U_rot1_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, A1U_rot2_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, A1U_rot3_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, A1U_ret_Cstop.A1U_ret_Pstop.arm1_unlock_output_area.arm1_unlock_swivel_2.press_lock_input_area.forge_Pstart, CU_lift_Cstop.CU_lift_Pstop.CU_trans_Pstart, CL_lift_Cstop.CL_lift_Pstop.CL_trans_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/69/25/94
(forward)formula 0,1,1.30193,42324,1,0,227,172593,209,129,2645,113302,281
Formula is TRUE !
***************************************
original formula: AG(EF(((press_at_upper_pos>=1)&&(PU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_upper_pos>=1)&&(PU_lower_run>=1)))))] = FALSE
(forward)formula 1,1,1.34647,43644,1,0,279,181980,210,162,2645,120620,367
Formula is TRUE !
***************************************
original formula: AG(EF(((press_at_middle_pos>=1)&&(forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_middle_pos>=1)&&(forge_run>=1)))))] = FALSE
(forward)formula 2,1,1.40346,45228,1,0,331,193100,211,196,2645,130100,453
Formula is TRUE !
***************************************
original formula: AG(EF(((press_at_lower_pos>=1)&&(PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_lower_pos>=1)&&(PL_lower_run>=1)))))] = FALSE
(forward)formula 3,1,1.62885,51300,1,0,383,234670,212,230,2645,162974,539
Formula is TRUE !
***************************************
original formula: AG(EF(((table_unload_angle>=1)&&(TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_unload_angle>=1)&&(TL_rot_run>=1)))))] = FALSE
(forward)formula 4,1,1.79602,58488,1,0,437,271739,213,264,2645,191887,625
Formula is TRUE !
***************************************
original formula: AG(EF(((table_top_pos>=1)&&(TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_top_pos>=1)&&(TL_lower_run>=1)))))] = FALSE
(forward)formula 5,1,1.80387,58752,1,0,491,271949,214,298,2645,194080,711
Formula is TRUE !
***************************************
original formula: AG(EF(((table_top_pos>=1)&&(TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_top_pos>=1)&&(TU_lift_run>=1)))))] = FALSE
(forward)formula 6,1,1.94986,61920,1,0,545,292340,215,331,2645,209769,797
Formula is TRUE !
***************************************
original formula: AG(EF(((table_bottom_pos>=1)&&(TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_bottom_pos>=1)&&(TU_lift_run>=1)))))] = FALSE
(forward)formula 7,1,1.97488,62712,1,0,599,297138,216,365,2645,213387,883
Formula is TRUE !
***************************************
original formula: AG(EF(((table_load_angle>=1)&&(TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_load_angle>=1)&&(TU_rot_run>=1)))))] = FALSE
(forward)formula 8,1,1.98836,63240,1,0,653,299364,217,399,2645,216109,969
Formula is TRUE !
***************************************
original formula: AG(EF(((belt2_light_barrier_false>=1)&&(DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_false>=1)&&(DB_trans_run>=1)))))] = FALSE
(forward)formula 9,1,2.3737,75384,1,0,706,380135,218,433,2645,273508,1055
Formula is TRUE !
***************************************
original formula: AG(EF(((belt2_light_barrier_true>=1)&&(DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_true>=1)&&(DB_deliver_run>=1)))))] = FALSE
(forward)formula 10,1,2.80544,85152,1,0,759,441451,219,466,2645,318209,1141
Formula is TRUE !
***************************************
original formula: AG(EF(((belt1_light_barrier_false>=1)&&(FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_false>=1)&&(FB_trans_run>=1)))))] = FALSE
(forward)formula 11,1,2.87056,87264,1,0,815,454105,220,500,2645,328192,1227
Formula is TRUE !
***************************************
original formula: AG(EF(((belt1_light_barrier_true>=1)&&(FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_true>=1)&&(FB_deliver_run>=1)))))] = FALSE
(forward)formula 12,1,2.94041,89376,1,0,871,466074,221,533,2645,336950,1313
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-19 20:31:53] [INFO ] Flatten gal took : 27 ms
[2022-05-19 20:31:53] [INFO ] Applying decomposition
[2022-05-19 20:31:53] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17229438462900035661.txt, -o, /tmp/graph17229438462900035661.bin, -w, /tmp/graph17229438462900035661.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17229438462900035661.bin, -l, -1, -v, -w, /tmp/graph17229438462900035661.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-19 20:31:53] [INFO ] Decomposing Gal with order
[2022-05-19 20:31:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 20:31:53] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-19 20:31:53] [INFO ] Flatten gal took : 80 ms
[2022-05-19 20:31:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-19 20:31:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17135838095794035980.gal : 8 ms
[2022-05-19 20:31:53] [INFO ] Time to serialize properties into /tmp/CTLFireability5470955834328440947.ctl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17135838095794035980.gal, -t, CGAL, -ctl, /tmp/CTLFireability5470955834328440947.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17135838095794035980.gal -t CGAL -ctl /tmp/CTLFireability5470955834328440947.ctl
No direction supplied, using forward translation only.
Parsed 81 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,8382,0.080753,5780,270,113,1940,398,335,1857,100,1161,0
Converting to forward existential form...Done !
original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u11.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u11.A2U_rot1_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions FB_deliver_Cstop_FB_deliver_Pstop_feed_belt_unlock_input_area_feed_belt_unlock_output_area_table_lock_input_area_TU_rot_Pstart, A2U_ret_Cstop_A2U_ret_Pstop_arm2_unlock_output_area_arm2_unlock_swivel_2, A2L_ret_Cstop_A2L_ret_Pstop_arm2_unlock_input_area_arm2_unlock_swivel_1_press_lock_output_area_PL_lower_Pstart, A1L_ret_Cstop_A1L_ret_Pstop_arm1_unlock_input_area_arm1_unlock_swivel_1_table_lock_output_area_TL_rot_Pstart, A1U_ret_Cstop_A1U_ret_Pstop_arm1_unlock_output_area_arm1_unlock_swivel_2_press_lock_input_area_forge_Pstart, u11.A2U_rot1_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u11.A2U_rot2_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u11.A2U_rot3_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u12.A2L_rot1_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u12.A2L_rot2_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u12.A2L_rot3_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u14.A1L_rot1_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u14.A1L_rot2_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u14.A1L_rot3_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u15.A1U_rot1_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u15.A1U_rot2_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u15.A1U_rot3_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, i1.TU_rot_Cstop_TU_rot_Pstop_TU_lift_Pstart, i1.i1.TL_rot_Cstop_TL_rot_Pstop_TL_lower_Pstart, i1.i2.u9.feed_belt_lock_input_area.feed_belt_lock_output_area.FB_trans_Pstart, i2.u7.deposit_belt_lock_input_area.deposit_belt_lock_output_area.DB_trans_Pstart, i9.u16.CU_lift_Cstop.CU_lift_Pstop.CU_trans_Pstart, i9.u16.CL_lift_Cstop.CL_lift_Pstop.CL_trans_Pstart, i9.u17.crane_lock_output_area.CU_lower_Pstart, i9.u19.crane_lock_input_area.CL_lower_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/69/25/94
(forward)formula 0,1,0.267299,10120,1,0,12403,1018,1220,11972,479,2496,34984
Formula is TRUE !
***************************************
original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u11.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u11.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 1,1,0.328325,11440,1,0,15235,1031,1223,14875,479,2521,44051
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u11.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u11.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 2,1,0.355639,11968,1,0,16392,1036,1227,16464,479,2533,47931
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_retract_ext>=1)&&(u11.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_retract_ext>=1)&&(u11.A2U_ext_run>=1)))))] = FALSE
(forward)formula 3,1,0.378928,12496,1,0,17259,1036,1230,17725,479,2533,50749
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_release_ext>=1)&&(u10.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_ext>=1)&&(u10.A2U_ret_run>=1)))))] = FALSE
(forward)formula 4,1,0.410848,13024,1,0,17949,1036,1236,18731,481,2533,53262
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 5,1,0.451373,14080,1,0,19983,1036,1239,21063,481,2533,60423
Formula is TRUE !
***************************************
original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u12.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u12.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 6,1,0.480042,14608,1,0,21259,1036,1242,22735,481,2535,64201
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u12.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u12.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 7,1,0.498934,15136,1,0,21795,1036,1245,23581,481,2536,66372
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_retract_ext>=1)&&(u12.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_retract_ext>=1)&&(u12.A2L_ext_run>=1)))))] = FALSE
(forward)formula 8,1,0.522737,15400,1,0,22505,1036,1247,24633,481,2536,68833
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_ext>=1)&&(u10.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_ext>=1)&&(u10.A2L_ret_run>=1)))))] = FALSE
(forward)formula 9,1,0.546366,15928,1,0,23192,1037,1253,25662,483,2536,71398
Formula is TRUE !
***************************************
original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u14.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u14.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 10,1,0.585851,16720,1,0,24489,1037,1256,27096,483,2536,76015
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 11,1,0.595782,16984,1,0,24763,1037,1259,27475,483,2536,77229
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u14.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u14.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 12,1,0.623212,17512,1,0,26054,1037,1262,28923,483,2542,81258
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_retract_ext>=1)&&(u14.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_retract_ext>=1)&&(u14.A1L_ext_run>=1)))))] = FALSE
(forward)formula 13,1,0.661376,18040,1,0,26926,1039,1265,30210,483,2547,84415
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_pick_up_ext>=1)&&(u13.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_pick_up_ext>=1)&&(u13.A1L_ret_run>=1)))))] = FALSE
(forward)formula 14,1,0.679005,18304,1,0,27471,1043,1269,30927,483,2548,86830
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u15.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u15.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 15,1,0.695202,18832,1,0,28311,1043,1272,32079,483,2569,89710
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u15.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u15.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 16,1,0.707196,19096,1,0,28952,1043,1275,32911,483,2570,92179
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u15.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u15.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 17,1,0.724084,19624,1,0,29940,1043,1278,34271,483,2572,95570
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_retract_ext>=1)&&(u15.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_retract_ext>=1)&&(u15.A1U_ext_run>=1)))))] = FALSE
(forward)formula 18,1,0.744519,20152,1,0,30794,1061,1280,35560,483,2597,98320
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_release_ext>=1)&&(u13.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_ext>=1)&&(u13.A1U_ret_run>=1)))))] = FALSE
(forward)formula 19,1,0.757992,20680,1,0,31261,1064,1286,36145,485,2598,100183
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_release_height>=1)&&(i9.u16.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_release_height>=1)&&(i9.u16.CU_lift_run>=1)))))] = FALSE
(forward)formula 20,1,0.845448,22528,1,0,36209,1078,1297,40785,486,2643,113642
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u18.crane_above_feed_belt>=1)&&(i9.u16.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u18.crane_above_feed_belt>=1)&&(i9.u16.CU_trans_run>=1)))))] = FALSE
(forward)formula 21,1,0.908715,24376,1,0,41043,1078,1302,45224,486,2643,126590
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u17.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u17.CU_lower_run>=1)))))] = FALSE
(forward)formula 22,1,0.979888,26488,1,0,46072,1078,1308,49843,486,2645,139951
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u19.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u19.CL_lower_run>=1)))))] = FALSE
(forward)formula 23,1,1.05385,27808,1,0,49564,1079,1313,53399,486,2658,149332
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u18.crane_above_deposit_belt>=1)&&(i9.u16.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u18.crane_above_deposit_belt>=1)&&(i9.u16.CL_trans_run>=1)))))] = FALSE
(forward)formula 24,1,1.1329,29392,1,0,53087,1079,1318,56907,486,2658,159112
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_pick_up_height>=1)&&(i9.u16.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_pick_up_height>=1)&&(i9.u16.CL_lift_run>=1)))))] = FALSE
(forward)formula 25,1,1.18853,30712,1,0,56470,1091,1325,60376,488,2697,168542
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u7.ch_DC_free>=1)&&(i2.u7.ch_A2D_full>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u7.ch_DC_free>=1)&&(i2.u7.ch_A2D_full>=1)))))] = FALSE
(forward)formula 26,1,1.22649,31768,1,0,58561,1091,1333,62707,489,2697,174442
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.i2.u9.ch_CF_full>=1)&&(i1.i2.u9.ch_FT_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u9.ch_CF_full>=1)&&(i1.i2.u9.ch_FT_free>=1)))))] = FALSE
(forward)formula 27,1,1.28965,33616,1,0,63189,1091,1344,66788,490,2697,186485
Formula is TRUE !
***************************************
original formula: AG(EF((((i2.u6.ch_A2D_free>=1)&&(u13.swivel>=1))&&(u10.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i2.u6.ch_A2D_free>=1)&&(u13.swivel>=1))&&(u10.arm2_storing>=1)))))] = FALSE
(forward)formula 28,1,1.30629,33880,1,0,63719,1091,1353,67524,490,2697,188701
Formula is TRUE !
***************************************
original formula: AG(EF((((i0.u0.ch_A1P_free>=1)&&(u13.swivel>=1))&&(u13.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u0.ch_A1P_free>=1)&&(u13.swivel>=1))&&(u13.arm1_storing>=1)))))] = FALSE
(forward)formula 29,1,1.31466,34144,1,0,63936,1091,1363,67868,492,2697,189791
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u17.ch_CF_free>=1)&&(i9.u17.crane_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.ch_CF_free>=1)&&(i9.u17.crane_storing>=1)))))] = FALSE
(forward)formula 30,1,1.3804,35992,1,0,68501,1091,1369,71993,492,2697,201842
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u19.ch_DC_full>=1)&&(i9.u19.crane_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u19.ch_DC_full>=1)&&(i9.u19.crane_store_free>=1)))))] = FALSE
(forward)formula 31,1,1.47184,37840,1,0,71483,1091,1377,74985,492,2697,209885
Formula is TRUE !
***************************************
original formula: AG(EF((((u13.swivel>=1)&&(i1.i0.u5.TU_lift_rs>=1))&&(u13.arm1_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u13.swivel>=1)&&(i1.i0.u5.TU_lift_rs>=1))&&(u13.arm1_store_free>=1)))))] = FALSE
(forward)formula 32,1,1.48582,38104,1,0,72015,1091,1384,75680,492,2697,212071
Formula is TRUE !
***************************************
original formula: AG(EF((((u13.swivel>=1)&&(i0.u1.PU_lower_rs>=1))&&(u10.arm2_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u13.swivel>=1)&&(i0.u1.PU_lower_rs>=1))&&(u10.arm2_store_free>=1)))))] = FALSE
(forward)formula 33,1,1.49688,38368,1,0,72387,1091,1391,76171,492,2697,213738
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u1.press_at_upper_pos>=1)&&(i0.u1.forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u1.press_at_upper_pos>=1)&&(i0.u1.forge_run>=1)))))] = FALSE
(forward)formula 34,1,1.53693,38896,1,0,74469,1092,1397,78473,492,2710,219396
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u0.press_at_middle_pos>=1)&&(i0.u0.PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u0.press_at_middle_pos>=1)&&(i0.u0.PL_lower_run>=1)))))] = FALSE
(forward)formula 35,1,1.5753,39688,1,0,76635,1092,1403,80867,492,2710,225121
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.i1.u2.table_load_angle>=1)&&(i1.i1.u4.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i1.u2.table_load_angle>=1)&&(i1.i1.u4.TL_rot_run>=1)))))] = FALSE
(forward)formula 36,1,1.64731,41800,1,0,81754,1093,1413,85571,492,2713,239174
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.i0.u3.table_bottom_pos>=1)&&(i1.i1.u4.TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i0.u3.table_bottom_pos>=1)&&(i1.i1.u4.TL_lower_run>=1)))))] = FALSE
(forward)formula 37,1,1.71005,44176,1,0,87803,1093,1419,90917,492,2713,255024
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.i1.u2.table_unload_angle>=1)&&(i1.i0.u5.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i1.u2.table_unload_angle>=1)&&(i1.i0.u5.TU_rot_run>=1)))))] = FALSE
(forward)formula 38,1,1.75257,46024,1,0,92523,1093,1425,94964,492,2713,268197
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u6.belt2_light_barrier_true>=1)&&(i2.u7.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_true>=1)&&(i2.u7.DB_trans_run>=1)))))] = FALSE
(forward)formula 39,1,1.78011,47080,1,0,94826,1093,1430,97477,492,2713,275169
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u6.belt2_light_barrier_false>=1)&&(i2.u6.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_false>=1)&&(i2.u6.DB_deliver_run>=1)))))] = FALSE
(forward)formula 40,1,1.80816,48136,1,0,97078,1093,1439,99942,494,2713,282061
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.i2.u8.belt1_light_barrier_true>=1)&&(i1.i2.u9.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u8.belt1_light_barrier_true>=1)&&(i1.i2.u9.FB_trans_run>=1)))))] = FALSE
(forward)formula 41,1,1.85768,49984,1,0,101914,1093,1447,104256,494,2713,295297
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.i2.u8.belt1_light_barrier_false>=1)&&(i1.i2.u8.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u8.belt1_light_barrier_false>=1)&&(i1.i2.u8.FB_deliver_run>=1)))))] = FALSE
(forward)formula 42,1,1.96731,51832,1,0,105793,1093,1457,107803,496,2713,307889
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.A2U_in>=1)&&(u14.arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.A2U_in>=1)&&(u14.arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 43,1,1.97433,52096,1,0,106176,1093,1460,108249,496,2713,309578
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.A2U_in>=1)&&(u15.arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.A2U_in>=1)&&(u15.arm1_release_angle>=1)))))] = FALSE
(forward)formula 44,1,1.98128,52360,1,0,106570,1093,1462,108697,496,2713,311098
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.A2U_in>=1)&&(u12.arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.A2U_in>=1)&&(u12.arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 45,1,1.99213,52624,1,0,107117,1093,1464,109500,496,2713,313236
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u11.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u11.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 46,1,2.00173,52888,1,0,107662,1093,1468,110229,497,2714,315366
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u11.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u11.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 47,1,2.01262,53152,1,0,108191,1093,1472,110983,498,2714,317407
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u11.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u11.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 48,1,2.02421,53680,1,0,108818,1093,1476,111915,499,2714,319565
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_release_ext>=1)&&(u11.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_ext>=1)&&(u11.A2U_ext_run>=1)))))] = FALSE
(forward)formula 49,1,2.03599,53944,1,0,109369,1093,1478,112775,499,2714,321697
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_retract_ext>=1)&&(u10.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_retract_ext>=1)&&(u10.A2U_ret_run>=1)))))] = FALSE
(forward)formula 50,1,2.04825,54472,1,0,109987,1093,1480,113701,499,2714,323952
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 51,1,2.05674,54736,1,0,110424,1093,1483,114254,499,2714,325754
Formula is TRUE !
***************************************
original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 52,1,2.06225,55000,1,0,110710,1093,1485,114598,499,2714,326915
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 53,1,2.07221,55264,1,0,111167,1094,1487,115251,499,2717,328774
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 54,1,2.08103,55528,1,0,111624,1094,1489,115840,499,2717,330636
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 55,1,2.092,55792,1,0,112170,1095,1491,116704,499,2730,332443
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 56,1,2.10223,56056,1,0,112621,1095,1493,117377,499,2733,334299
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_ext>=1)&&(u12.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_ext>=1)&&(u12.A2L_ext_run>=1)))))] = FALSE
(forward)formula 57,1,2.11338,56584,1,0,113083,1095,1495,118166,499,2733,336244
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_retract_ext>=1)&&(u10.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_retract_ext>=1)&&(u10.A2L_ret_run>=1)))))] = FALSE
(forward)formula 58,1,2.12652,56848,1,0,113714,1095,1497,119129,499,2733,338581
Formula is TRUE !
***************************************
original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u14.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u14.A1L_in>=1)))))] = FALSE
(forward)formula 59,1,2.13108,57112,1,0,113847,1095,1500,119333,499,2733,339448
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u14.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u14.A1L_in>=1)))))] = FALSE
(forward)formula 60,1,2.13668,57376,1,0,114056,1095,1502,119658,499,2733,340658
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u14.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u14.A1L_in>=1)))))] = FALSE
(forward)formula 61,1,2.14391,57376,1,0,114366,1095,1504,120088,499,2733,342027
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 62,1,2.15043,57640,1,0,114555,1095,1508,120470,500,2733,343207
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 63,1,2.15614,57904,1,0,114735,1095,1510,120790,500,2733,344341
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u14.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 64,1,2.16357,57904,1,0,115087,1095,1514,121322,502,2733,345704
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_pick_up_ext>=1)&&(u14.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_pick_up_ext>=1)&&(u14.A1L_ext_run>=1)))))] = FALSE
(forward)formula 65,1,2.17147,58168,1,0,115363,1095,1516,121813,502,2733,347011
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_retract_ext>=1)&&(u13.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_retract_ext>=1)&&(u13.A1L_ret_run>=1)))))] = FALSE
(forward)formula 66,1,2.18218,58432,1,0,115875,1095,1520,122498,504,2733,349217
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u15.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u15.A1U_in>=1)))))] = FALSE
(forward)formula 67,1,2.18619,58696,1,0,116010,1095,1523,122698,504,2733,349752
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u15.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u15.A1U_in>=1)))))] = FALSE
(forward)formula 68,1,2.19013,58696,1,0,116150,1095,1525,122895,504,2733,350312
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_angle>=1)&&(u15.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_angle>=1)&&(u15.A1U_in>=1)))))] = FALSE
(forward)formula 69,1,2.19352,58960,1,0,116266,1095,1527,123057,504,2733,350808
Formula is TRUE !
***************************************
original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u15.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u15.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 70,1,2.19792,58960,1,0,116479,1095,1529,123406,504,2741,351357
Formula is TRUE !
***************************************
original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u15.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u15.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 71,1,2.20275,58960,1,0,116661,1095,1531,123740,504,2742,351934
Formula is TRUE !
***************************************
original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u15.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u15.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 72,1,2.20673,59224,1,0,116850,1095,1533,124015,504,2742,352452
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_release_ext>=1)&&(u15.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_ext>=1)&&(u15.A1U_ext_run>=1)))))] = FALSE
(forward)formula 73,1,2.21147,59224,1,0,116970,1095,1535,124296,504,2742,353051
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_retract_ext>=1)&&(u13.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_retract_ext>=1)&&(u13.A1U_ret_run>=1)))))] = FALSE
(forward)formula 74,1,2.21939,59488,1,0,117409,1095,1537,124845,504,2742,354707
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u16.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u16.CU_lift_run>=1)))))] = FALSE
(forward)formula 75,1,2.2615,61072,1,0,121760,1099,1541,128778,504,2753,366459
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u18.crane_above_deposit_belt>=1)&&(i9.u16.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u18.crane_above_deposit_belt>=1)&&(i9.u16.CU_trans_run>=1)))))] = FALSE
(forward)formula 76,1,2.30776,62920,1,0,126429,1099,1545,132851,504,2753,379388
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_release_height>=1)&&(i9.u17.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_release_height>=1)&&(i9.u17.CU_lower_run>=1)))))] = FALSE
(forward)formula 77,1,2.35815,65032,1,0,131365,1101,1549,137283,504,2757,392881
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_pick_up_height>=1)&&(i9.u19.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_pick_up_height>=1)&&(i9.u19.CL_lower_run>=1)))))] = FALSE
(forward)formula 78,1,2.39691,66352,1,0,134825,1102,1553,140660,504,2757,402353
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u18.crane_above_feed_belt>=1)&&(i9.u16.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u18.crane_above_feed_belt>=1)&&(i9.u16.CL_trans_run>=1)))))] = FALSE
(forward)formula 79,1,2.43601,67672,1,0,138147,1102,1557,143900,504,2757,411881
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u16.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u16.CL_lift_run>=1)))))] = FALSE
(forward)formula 80,1,2.52393,70312,1,0,141146,1112,1561,146925,504,2770,420470
Formula is TRUE !
***************************************
Able to resolve query Liveness after proving 94 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1652992317311
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination Liveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="ParamProductionCell-PT-2"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-4028"
echo " Executing tool gold2021"
echo " Input is ParamProductionCell-PT-2, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-165277003100169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-2.tgz
mv ParamProductionCell-PT-2 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;