About the Execution of ITS-Tools for ParamProductionCell-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1044.172 | 20119.00 | 31734.00 | 323.70 | 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/mcc2021-input.r147-tall-162089138000254.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ParamProductionCell-PT-5, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-162089138000254
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 25K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 158K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K May 5 16:51 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 1620948050047
Running Version 0
[2021-05-13 23:20:51] [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]
[2021-05-13 23:20:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:20:51] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-13 23:20:51] [INFO ] Transformed 231 places.
[2021-05-13 23:20:51] [INFO ] Transformed 202 transitions.
[2021-05-13 23:20:51] [INFO ] Found NUPN structural information;
[2021-05-13 23:20:51] [INFO ] Parsed PT model containing 231 places and 202 transitions in 105 ms.
Built sparse matrix representations for Structural reductions in 6 ms.19459KB memory used
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Applied a total of 0 rules in 22 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 10 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:20:51] [INFO ] Computed 59 place invariants in 16 ms
[2021-05-13 23:20:51] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:20:51] [INFO ] Computed 59 place invariants in 8 ms
[2021-05-13 23:20:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:20:52] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2021-05-13 23:20:52] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:20:52] [INFO ] Computed 59 place invariants in 7 ms
[2021-05-13 23:20:52] [INFO ] Dead Transitions using invariants and state equation in 155 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 3149 ms (no deadlock found). (steps per millisecond=396 )
Random directed walk for 1250001 steps, including 0 resets, run took 1945 ms (no deadlock found). (steps per millisecond=642 )
// Phase 1: matrix 202 rows 231 cols
[2021-05-13 23:20:57] [INFO ] Computed 59 place invariants in 8 ms
[2021-05-13 23:20:57] [INFO ] [Real]Absence check using 35 positive place invariants in 38 ms returned sat
[2021-05-13 23:20:57] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 61 ms returned sat
[2021-05-13 23:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:20:58] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2021-05-13 23:20:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:20:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-13 23:20:58] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 31 ms returned sat
[2021-05-13 23:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:20:59] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2021-05-13 23:20:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:20:59] [INFO ] [Nat]Added 68 Read/Feed constraints in 31 ms returned sat
[2021-05-13 23:20:59] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 3 ms to minimize.
[2021-05-13 23:20:59] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2021-05-13 23:20:59] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2021-05-13 23:20:59] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
[2021-05-13 23:20:59] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2021-05-13 23:20:59] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2021-05-13 23:20:59] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2021-05-13 23:20:59] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2021-05-13 23:20:59] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2021-05-13 23:20:59] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2021-05-13 23:21:00] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 5 ms to minimize.
[2021-05-13 23:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 35 trap constraints in 2512 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 0 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 0 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 45 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2021-05-13 23:21:01] [INFO ] Computed 59 place invariants in 4 ms
[2021-05-13 23:21:01] [INFO ] Implicit Places using invariants in 171 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 173 ms to find 39 implicit places.
// Phase 1: matrix 164 rows 154 cols
[2021-05-13 23:21:01] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-13 23:21:02] [INFO ] Dead Transitions using invariants and state equation in 91 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 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 42 place count 133 transition count 137
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 127 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 125 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 125 transition count 135
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 136 place count 86 transition count 96
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 140 place count 84 transition count 94
Applied a total of 140 rules in 15 ms. Remains 84 /154 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 84 cols
[2021-05-13 23:21:02] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-13 23:21:02] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2021-05-13 23:21:02] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-13 23:21:02] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-13 23:21:02] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
[2021-05-13 23:21:02] [INFO ] Initial state test concluded for 3 properties.
Finished random walk after 602 steps, including 0 resets, run visited all 91 properties in 7 ms. (steps per millisecond=86 )
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 0 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 14 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2021-05-13 23:21:02] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-13 23:21:02] [INFO ] Implicit Places using invariants in 145 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 146 ms to find 39 implicit places.
// Phase 1: matrix 164 rows 154 cols
[2021-05-13 23:21:02] [INFO ] Computed 20 place invariants in 4 ms
[2021-05-13 23:21:02] [INFO ] Dead Transitions using invariants and state equation in 89 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 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 42 place count 133 transition count 137
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 127 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 125 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 125 transition count 135
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 136 place count 86 transition count 96
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 140 place count 84 transition count 94
Applied a total of 140 rules in 11 ms. Remains 84 /154 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 84 cols
[2021-05-13 23:21:02] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-13 23:21:02] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2021-05-13 23:21:02] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-13 23:21:02] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-13 23:21:02] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
[2021-05-13 23:21:02] [INFO ] Flatten gal took : 43 ms
[2021-05-13 23:21:02] [INFO ] Flatten gal took : 16 ms
[2021-05-13 23:21:02] [INFO ] Time to serialize gal into /tmp/CTLFireability18315515370263180186.gal : 7 ms
[2021-05-13 23:21:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14992609707157252961.ctl : 3 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/CTLFireability18315515370263180186.gal, -t, CGAL, -ctl, /tmp/CTLFireability14992609707157252961.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/CTLFireability18315515370263180186.gal -t CGAL -ctl /tmp/CTLFireability14992609707157252961.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,41064,0.150399,10264,2,3514,5,25668,6,0,433,22913,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, crane_lock_output_area.CU_lower_Pstart, crane_lock_input_area.CL_lower_Pstart, TL_lower_Pstop.table_unlock_input_area.feed_belt_lock_input_area.feed_belt_lock_output_area.FB_trans_Pstart, TL_rot_Cstop.TL_rot_Pstop.TL_lower_Pstart, TU_rot_Cstop.TU_rot_Pstop.TU_lift_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, CU_lift_Cstop.CU_lift_Pstop.CU_trans_Pstart, CL_lift_Cstop.CL_lift_Pstop.CL_trans_Pstart, A1U_ret_Cstop.A1U_ret_Pstop.arm1_unlock_output_area.arm1_unlock_swivel_2.press_lock_input_area.forge_Pstart, FB_deliver_Cstop.FB_deliver_Pstop.feed_belt_unlock_input_area.feed_belt_unlock_output_area.table_lock_input_area.TU_rot_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/69/25/94
(forward)formula 0,1,1.7314,63568,1,0,227,317043,209,129,2646,205385,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.96332,70168,1,0,279,358338,210,162,2646,234183,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,2.15634,76768,1,0,331,399341,211,196,2646,265469,453
Formula is TRUE !
***************************************
original formula: AG(EF(((press_at_middle_pos>=1)&&(PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_middle_pos>=1)&&(PL_lower_run>=1)))))] = FALSE
(forward)formula 3,1,2.9205,94192,1,0,383,515165,212,229,2646,347826,539
Formula is TRUE !
Detected timeout of ITS tools.
[2021-05-13 23:21:06] [INFO ] Flatten gal took : 10 ms
[2021-05-13 23:21:06] [INFO ] Applying decomposition
[2021-05-13 23:21:06] [INFO ] Flatten gal took : 9 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/graph16333570339377909352.txt, -o, /tmp/graph16333570339377909352.bin, -w, /tmp/graph16333570339377909352.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/graph16333570339377909352.bin, -l, -1, -v, -w, /tmp/graph16333570339377909352.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 23:21:06] [INFO ] Decomposing Gal with order
[2021-05-13 23:21:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 23:21:06] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-13 23:21:06] [INFO ] Flatten gal took : 37 ms
[2021-05-13 23:21:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-13 23:21:06] [INFO ] Time to serialize gal into /tmp/CTLFireability261732995889172640.gal : 4 ms
[2021-05-13 23:21:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16203986925206386394.ctl : 2 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/CTLFireability261732995889172640.gal, -t, CGAL, -ctl, /tmp/CTLFireability16203986925206386394.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/CTLFireability261732995889172640.gal -t CGAL -ctl /tmp/CTLFireability16203986925206386394.ctl
No direction supplied, using forward translation only.
Parsed 90 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,41064,0.038188,5720,267,147,1984,441,305,1783,108,1175,0
Converting to forward existential form...Done !
original formula: AG(EF(((i1.u1.press_at_lower_pos>=1)&&(i1.u2.PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u1.press_at_lower_pos>=1)&&(i1.u2.PL_lower_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions crane_lock_input_area_CL_lower_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, FB_deliver_Cstop_FB_deliver_Pstop_feed_belt_unlock_input_area_feed_belt_unlock_output_area_table_lock_input_area_TU_rot_Pstart, u8.A2U_rot1_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u8.A2U_rot2_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u8.A2U_rot3_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u9.A1U_rot1_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u9.A1U_rot2_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u9.A1U_rot3_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u10.A2L_rot1_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u10.A2L_rot2_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u10.A2L_rot3_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u12.A1L_rot1_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u12.A1L_rot2_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u12.A1L_rot3_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u6.deposit_belt_lock_input_area.deposit_belt_lock_output_area.DB_trans_Pstart, i0.i0.u0.TL_lower_Pstop.table_unlock_input_area.feed_belt_lock_input_area.feed_belt_lock_output_area.FB_trans_Pstart, i0.i1.u3.TL_rot_Cstop.TL_rot_Pstop.TL_lower_Pstart, i0.i1.u4.TU_rot_Cstop.TU_rot_Pstop.TU_lift_Pstart, i8.u14.CU_lift_Cstop.CU_lift_Pstop.CU_trans_Pstart, i8.u14.CL_lift_Cstop.CL_lift_Pstop.CL_trans_Pstart, i8.u16.crane_lock_output_area.CU_lower_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/69/25/94
(forward)formula 0,1,0.129078,10264,1,0,13106,1164,1198,11892,550,2989,31995
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i1.u4.table_unload_angle>=1)&&(i0.i1.u3.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i1.u4.table_unload_angle>=1)&&(i0.i1.u3.TL_rot_run>=1)))))] = FALSE
(forward)formula 1,1,0.167831,12112,1,0,18034,1167,1209,16605,550,3021,43982
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i1.u5.table_bottom_pos>=1)&&(i0.i1.u3.TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i1.u5.table_bottom_pos>=1)&&(i0.i1.u3.TL_lower_run>=1)))))] = FALSE
(forward)formula 2,1,0.207832,13960,1,0,22851,1167,1218,20997,550,3023,55927
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i1.u5.table_top_pos>=1)&&(i0.i1.u3.TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i1.u5.table_top_pos>=1)&&(i0.i1.u3.TL_lower_run>=1)))))] = FALSE
(forward)formula 3,1,0.254614,16072,1,0,27657,1167,1227,25524,550,3025,67805
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i1.u5.table_top_pos>=1)&&(i0.i1.u4.TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i1.u5.table_top_pos>=1)&&(i0.i1.u4.TU_lift_run>=1)))))] = FALSE
(forward)formula 4,1,0.300677,18184,1,0,33797,1167,1235,30722,550,3025,83077
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i1.u5.table_bottom_pos>=1)&&(i0.i1.u4.TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i1.u5.table_bottom_pos>=1)&&(i0.i1.u4.TU_lift_run>=1)))))] = FALSE
(forward)formula 5,1,0.341252,20560,1,0,39475,1167,1241,35727,550,3026,96780
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i1.u3.table_load_angle>=1)&&(i0.i1.u4.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i1.u3.table_load_angle>=1)&&(i0.i1.u4.TU_rot_run>=1)))))] = FALSE
(forward)formula 6,1,0.393238,22672,1,0,45149,1167,1252,40729,550,3027,110478
Formula is TRUE !
***************************************
original formula: AG(EF(((u6.belt2_light_barrier_false>=1)&&(u6.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.belt2_light_barrier_false>=1)&&(u6.DB_trans_run>=1)))))] = FALSE
(forward)formula 7,1,0.492237,26368,1,0,54958,1198,1258,48564,552,3119,135612
Formula is TRUE !
***************************************
original formula: AG(EF(((u6.belt2_light_barrier_true>=1)&&(u6.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.belt2_light_barrier_true>=1)&&(u6.DB_deliver_run>=1)))))] = FALSE
(forward)formula 8,1,0.578016,29800,1,0,63884,1232,1262,55555,553,3254,159844
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i0.u7.belt1_light_barrier_false>=1)&&(i0.i0.u0.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i0.u7.belt1_light_barrier_false>=1)&&(i0.i0.u0.FB_trans_run>=1)))))] = FALSE
(forward)formula 9,1,0.620416,31912,1,0,69545,1232,1271,60619,553,3254,173567
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i0.u7.belt1_light_barrier_true>=1)&&(i0.i0.u7.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i0.u7.belt1_light_barrier_true>=1)&&(i0.i0.u7.FB_deliver_run>=1)))))] = FALSE
(forward)formula 10,1,0.662591,34024,1,0,74919,1232,1278,65236,553,3254,187197
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_pick_up_angle>=1)&&(u8.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_angle>=1)&&(u8.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 11,1,0.708965,36400,1,0,81150,1256,1281,70271,553,3285,204082
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_release_angle>=1)&&(u8.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_release_angle>=1)&&(u8.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 12,1,0.76129,38248,1,0,85551,1260,1284,74274,553,3292,215024
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u8.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u8.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 13,1,0.798717,40096,1,0,90979,1260,1287,79153,553,3295,228805
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_retract_ext>=1)&&(u8.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_retract_ext>=1)&&(u8.A2U_ext_run>=1)))))] = FALSE
(forward)formula 14,1,0.821988,41152,1,0,93489,1271,1290,81930,553,3310,235454
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_ext>=1)&&(u11.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_ext>=1)&&(u11.A2U_ret_run>=1)))))] = FALSE
(forward)formula 15,1,0.836739,41680,1,0,94616,1274,1296,83310,555,3311,239197
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_pick_up_angle>=1)&&(u10.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_angle>=1)&&(u10.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 16,1,0.877126,43792,1,0,99560,1274,1299,87995,555,3311,251695
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_release_angle>=1)&&(u10.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_release_angle>=1)&&(u10.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 17,1,0.909405,45376,1,0,103179,1274,1302,91584,555,3311,261807
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u10.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u10.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 18,1,0.926428,46168,1,0,104680,1275,1305,93316,555,3346,266335
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_retract_ext>=1)&&(u10.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_retract_ext>=1)&&(u10.A2L_ext_run>=1)))))] = FALSE
(forward)formula 19,1,0.985304,46696,1,0,106049,1303,1307,94964,555,3378,270609
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_pick_up_ext>=1)&&(u11.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_ext>=1)&&(u11.A2L_ret_run>=1)))))] = FALSE
(forward)formula 20,1,0.997297,47224,1,0,106952,1306,1313,96125,557,3379,273740
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_release_angle>=1)&&(u12.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_release_angle>=1)&&(u12.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 21,1,1.02082,48544,1,0,109867,1306,1316,98859,557,3388,281256
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u12.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u12.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 22,1,1.04101,49336,1,0,112033,1306,1319,101119,557,3388,287502
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u12.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u12.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 23,1,1.0639,50656,1,0,114910,1306,1322,103747,557,3388,294893
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_retract_ext>=1)&&(u12.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_retract_ext>=1)&&(u12.A1L_ext_run>=1)))))] = FALSE
(forward)formula 24,1,1.07358,50920,1,0,115589,1306,1325,104703,557,3388,296915
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 25,1,1.10875,51184,1,0,115932,1307,1329,105166,557,3388,298158
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_pick_up_angle>=1)&&(u9.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_angle>=1)&&(u9.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 26,1,1.11998,51712,1,0,116960,1307,1332,106445,557,3388,301306
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u9.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u9.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 27,1,1.13959,52768,1,0,119060,1307,1335,108787,557,3388,306758
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u9.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u9.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 28,1,1.1557,53560,1,0,120839,1307,1338,110701,557,3388,311744
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_retract_ext>=1)&&(u9.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_retract_ext>=1)&&(u9.A1U_ext_run>=1)))))] = FALSE
(forward)formula 29,1,1.16787,54088,1,0,121953,1322,1340,112175,557,3410,314827
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 30,1,1.17478,54352,1,0,122340,1322,1346,112762,559,3410,316205
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u14.crane_release_height>=1)&&(i8.u14.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u14.crane_release_height>=1)&&(i8.u14.CU_lift_run>=1)))))] = FALSE
(forward)formula 31,1,1.2311,57520,1,0,130722,1323,1358,119627,560,3421,337372
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u15.crane_above_feed_belt>=1)&&(i8.u14.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u15.crane_above_feed_belt>=1)&&(i8.u14.CU_trans_run>=1)))))] = FALSE
(forward)formula 32,1,1.28497,60688,1,0,138889,1323,1363,126273,560,3421,357531
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u14.crane_transport_height>=1)&&(i8.u16.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u14.crane_transport_height>=1)&&(i8.u16.CU_lower_run>=1)))))] = FALSE
(forward)formula 33,1,1.34476,63856,1,0,147491,1325,1370,133330,560,3421,378735
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u14.crane_transport_height>=1)&&(i8.u14.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u14.crane_transport_height>=1)&&(i8.u14.CL_lower_run>=1)))))] = FALSE
(forward)formula 34,1,1.41246,67288,1,0,157075,1354,1378,141083,561,3537,401986
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u15.crane_above_deposit_belt>=1)&&(i8.u14.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u15.crane_above_deposit_belt>=1)&&(i8.u14.CL_trans_run>=1)))))] = FALSE
(forward)formula 35,1,1.51659,71776,1,0,166187,1354,1378,148329,561,3542,424308
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u14.crane_pick_up_height>=1)&&(i8.u14.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u14.crane_pick_up_height>=1)&&(i8.u14.CL_lift_run>=1)))))] = FALSE
(forward)formula 36,1,1.57631,74152,1,0,175245,1368,1386,155700,563,3591,447464
Formula is TRUE !
***************************************
original formula: AG(EF(((u6.ch_DC_free>=1)&&(u6.ch_A2D_full>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.ch_DC_free>=1)&&(u6.ch_A2D_full>=1)))))] = FALSE
(forward)formula 37,1,1.63247,77320,1,0,183649,1368,1392,162355,564,3593,469473
Formula is TRUE !
***************************************
original formula: AG(EF((((u6.ch_A2D_free>=1)&&(u11.swivel>=1))&&(u11.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u6.ch_A2D_free>=1)&&(u11.swivel>=1))&&(u11.arm2_storing>=1)))))] = FALSE
(forward)formula 38,1,1.64551,77848,1,0,184789,1368,1402,163588,566,3593,473306
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u16.ch_CF_free>=1)&&(i8.u16.crane_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.ch_CF_free>=1)&&(i8.u16.crane_storing>=1)))))] = FALSE
(forward)formula 39,1,1.69964,80752,1,0,192513,1368,1408,169716,566,3593,492350
Formula is TRUE !
***************************************
original formula: AG(EF(((u6.ch_DC_full>=1)&&(i8.u14.crane_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.ch_DC_full>=1)&&(i8.u14.crane_store_free>=1)))))] = FALSE
(forward)formula 40,1,1.76038,83920,1,0,201211,1368,1413,176541,566,3593,513300
Formula is TRUE !
***************************************
original formula: AG(EF((((u11.swivel>=1)&&(i1.u2.PL_lower_rs>=1))&&(u13.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u11.swivel>=1)&&(i1.u2.PL_lower_rs>=1))&&(u13.arm1_storing>=1)))))] = FALSE
(forward)formula 41,1,1.76952,84184,1,0,201997,1368,1419,177415,566,3593,515737
Formula is TRUE !
***************************************
original formula: AG(EF((((u11.swivel>=1)&&(i0.i1.u5.TU_lift_rs>=1))&&(u13.arm1_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u11.swivel>=1)&&(i0.i1.u5.TU_lift_rs>=1))&&(u13.arm1_store_free>=1)))))] = FALSE
(forward)formula 42,1,1.77603,84448,1,0,202498,1368,1426,177963,566,3593,517416
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i0.u0.ch_CF_full>=1)&&(i0.i0.u0.TL_lower_rs>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i0.u0.ch_CF_full>=1)&&(i0.i0.u0.TL_lower_rs>=1)))))] = FALSE
(forward)formula 43,1,1.81577,86560,1,0,207405,1368,1430,182144,566,3593,529679
Formula is TRUE !
***************************************
original formula: AG(EF((((u11.swivel>=1)&&(i1.u1.PU_lower_rs>=1))&&(u11.arm2_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u11.swivel>=1)&&(i1.u1.PU_lower_rs>=1))&&(u11.arm2_store_free>=1)))))] = FALSE
(forward)formula 44,1,1.82779,87088,1,0,208408,1368,1439,183251,568,3593,533018
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u1.press_at_upper_pos>=1)&&(i1.u1.forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u1.press_at_upper_pos>=1)&&(i1.u1.forge_run>=1)))))] = FALSE
(forward)formula 45,1,1.9288,88144,1,0,210614,1368,1445,185585,568,3603,539416
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i1.u3.table_load_angle>=1)&&(i0.i1.u3.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i1.u3.table_load_angle>=1)&&(i0.i1.u3.TL_rot_run>=1)))))] = FALSE
(forward)formula 46,1,1.96115,89728,1,0,214674,1368,1449,189229,568,3603,549853
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i1.u4.table_unload_angle>=1)&&(i0.i1.u4.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i1.u4.table_unload_angle>=1)&&(i0.i1.u4.TU_rot_run>=1)))))] = FALSE
(forward)formula 47,1,1.9973,91576,1,0,219585,1368,1455,193375,568,3603,562056
Formula is TRUE !
***************************************
original formula: AG(EF(((u6.belt2_light_barrier_true>=1)&&(u6.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.belt2_light_barrier_true>=1)&&(u6.DB_trans_run>=1)))))] = FALSE
(forward)formula 48,1,2.06203,95008,1,0,228466,1394,1459,200311,569,3715,586288
Formula is TRUE !
***************************************
original formula: AG(EF(((u6.belt2_light_barrier_false>=1)&&(u6.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.belt2_light_barrier_false>=1)&&(u6.DB_deliver_run>=1)))))] = FALSE
(forward)formula 49,1,2.12768,98176,1,0,237299,1410,1463,207195,571,3735,610478
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i0.u7.belt1_light_barrier_true>=1)&&(i0.i0.u0.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i0.u7.belt1_light_barrier_true>=1)&&(i0.i0.u0.FB_trans_run>=1)))))] = FALSE
(forward)formula 50,1,2.22919,100552,1,0,242734,1410,1469,211891,571,3735,624324
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.A2U_in>=1)&&(u12.arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.A2U_in>=1)&&(u12.arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 51,1,2.23578,100816,1,0,243376,1411,1472,212486,571,3735,626411
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.A2U_in>=1)&&(u9.arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.A2U_in>=1)&&(u9.arm1_release_angle>=1)))))] = FALSE
(forward)formula 52,1,2.24392,101080,1,0,243991,1411,1474,213187,571,3738,628564
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.A2U_in>=1)&&(u10.arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.A2U_in>=1)&&(u10.arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 53,1,2.2556,101608,1,0,244862,1411,1476,214219,571,3738,631660
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u8.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u8.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 54,1,2.26581,101872,1,0,245525,1411,1480,215181,572,3738,633668
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u8.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u8.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 55,1,2.27393,102400,1,0,246091,1411,1484,215887,573,3738,635563
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u8.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u8.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 56,1,2.28633,102928,1,0,247033,1411,1488,217097,574,3738,638707
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_release_ext>=1)&&(u8.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_release_ext>=1)&&(u8.A2U_ext_run>=1)))))] = FALSE
(forward)formula 57,1,2.2986,103456,1,0,247884,1411,1490,218246,574,3738,641771
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_retract_ext>=1)&&(u11.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_retract_ext>=1)&&(u11.A2U_ret_run>=1)))))] = FALSE
(forward)formula 58,1,2.31326,103984,1,0,248967,1411,1492,219568,574,3738,645323
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_pick_up_angle>=1)&&(u10.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_angle>=1)&&(u10.A2L_in>=1)))))] = FALSE
(forward)formula 59,1,2.31917,104248,1,0,249460,1411,1495,220075,574,3739,646919
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_release_angle>=1)&&(u10.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_release_angle>=1)&&(u10.A2L_in>=1)))))] = FALSE
(forward)formula 60,1,2.32629,104512,1,0,249948,1411,1497,220671,574,3741,648630
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u10.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u10.A2L_in>=1)))))] = FALSE
(forward)formula 61,1,2.33503,104776,1,0,250556,1412,1499,221394,574,3745,650797
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 62,1,2.34468,105304,1,0,251236,1412,1501,222319,574,3754,652694
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 63,1,2.35375,105568,1,0,251881,1413,1503,223175,574,3759,654689
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u10.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 64,1,2.36364,106096,1,0,252518,1413,1505,223982,574,3762,656877
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_pick_up_ext>=1)&&(u10.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_ext>=1)&&(u10.A2L_ext_run>=1)))))] = FALSE
(forward)formula 65,1,2.37333,106360,1,0,253130,1413,1507,224863,574,3762,659271
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_retract_ext>=1)&&(u11.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_retract_ext>=1)&&(u11.A2L_ret_run>=1)))))] = FALSE
(forward)formula 66,1,2.38415,106888,1,0,253950,1413,1511,225948,576,3762,662078
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_release_angle>=1)&&(u12.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_release_angle>=1)&&(u12.A1L_in>=1)))))] = FALSE
(forward)formula 67,1,2.38707,107152,1,0,254082,1413,1514,226148,576,3762,662584
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u12.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u12.A1L_in>=1)))))] = FALSE
(forward)formula 68,1,2.38959,107152,1,0,254213,1413,1516,226320,576,3762,663080
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u12.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u12.A1L_in>=1)))))] = FALSE
(forward)formula 69,1,2.39235,107416,1,0,254356,1413,1518,226505,576,3762,663676
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_pick_up_angle>=1)&&(u12.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_angle>=1)&&(u12.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 70,1,2.39586,107680,1,0,254568,1413,1522,226862,577,3762,664235
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_pick_up_angle>=1)&&(u12.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_angle>=1)&&(u12.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 71,1,2.39873,107680,1,0,254752,1413,1524,227144,577,3762,664764
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_pick_up_angle>=1)&&(u12.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_angle>=1)&&(u12.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 72,1,2.40186,107680,1,0,254941,1413,1528,227444,579,3764,665294
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_pick_up_ext>=1)&&(u12.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_pick_up_ext>=1)&&(u12.A1L_ext_run>=1)))))] = FALSE
(forward)formula 73,1,2.40541,107944,1,0,255058,1413,1530,227711,579,3764,665856
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 74,1,2.4113,107944,1,0,255441,1413,1532,228246,579,3764,667025
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm1_pick_up_angle>=1)&&(u9.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_angle>=1)&&(u9.A1U_in>=1)))))] = FALSE
(forward)formula 75,1,2.41543,108208,1,0,255692,1413,1535,228555,579,3764,667968
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_pick_up_angle>=1)&&(u9.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_pick_up_angle>=1)&&(u9.A1U_in>=1)))))] = FALSE
(forward)formula 76,1,2.42107,108208,1,0,255999,1413,1537,228986,579,3764,669106
Formula is TRUE !
***************************************
original formula: AG(EF(((u8.arm2_release_angle>=1)&&(u9.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_release_angle>=1)&&(u9.A1U_in>=1)))))] = FALSE
(forward)formula 77,1,2.42636,108472,1,0,256291,1413,1539,229369,579,3764,670221
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_release_angle>=1)&&(u9.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_release_angle>=1)&&(u9.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 78,1,2.4327,108736,1,0,256716,1413,1541,230023,579,3764,671411
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_release_angle>=1)&&(u9.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_release_angle>=1)&&(u9.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 79,1,2.43877,109000,1,0,257099,1413,1543,230592,579,3764,672536
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_release_angle>=1)&&(u9.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_release_angle>=1)&&(u9.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 80,1,2.44431,109264,1,0,257437,1413,1545,231077,579,3764,673660
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm1_release_ext>=1)&&(u9.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_ext>=1)&&(u9.A1U_ext_run>=1)))))] = FALSE
(forward)formula 81,1,2.45025,109528,1,0,257725,1413,1547,231560,579,3764,674794
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u14.crane_transport_height>=1)&&(i8.u14.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u14.crane_transport_height>=1)&&(i8.u14.CU_lift_run>=1)))))] = FALSE
(forward)formula 82,1,2.50233,112168,1,0,264893,1413,1553,237338,581,3767,692835
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u15.crane_above_deposit_belt>=1)&&(i8.u14.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u15.crane_above_deposit_belt>=1)&&(i8.u14.CU_trans_run>=1)))))] = FALSE
(forward)formula 83,1,2.55817,114808,1,0,272522,1413,1557,243414,581,3767,712702
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u14.crane_release_height>=1)&&(i8.u16.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u14.crane_release_height>=1)&&(i8.u16.CU_lower_run>=1)))))] = FALSE
(forward)formula 84,1,2.62105,117976,1,0,280972,1413,1561,250136,581,3767,734150
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u14.crane_pick_up_height>=1)&&(i8.u14.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u14.crane_pick_up_height>=1)&&(i8.u14.CL_lower_run>=1)))))] = FALSE
(forward)formula 85,1,2.69045,121408,1,0,290044,1436,1567,257366,582,3867,757646
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u15.crane_above_feed_belt>=1)&&(i8.u14.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u15.crane_above_feed_belt>=1)&&(i8.u14.CL_trans_run>=1)))))] = FALSE
(forward)formula 86,1,2.75579,124576,1,0,298628,1436,1567,264116,582,3867,779921
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u14.crane_transport_height>=1)&&(i8.u14.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u14.crane_transport_height>=1)&&(i8.u14.CL_lift_run>=1)))))] = FALSE
(forward)formula 87,1,2.81738,127480,1,0,306566,1453,1573,270411,584,3890,800089
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 88,1,2.82505,127744,1,0,306986,1453,1575,271059,584,3890,801386
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.i0.u7.belt1_light_barrier_false>=1)&&(i0.i0.u7.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.i0.u7.belt1_light_barrier_false>=1)&&(i0.i0.u7.FB_deliver_run>=1)))))] = FALSE
(forward)formula 89,1,2.86558,129592,1,0,311737,1453,1579,275085,584,3890,813576
Formula is TRUE !
***************************************
Able to resolve query Liveness after proving 94 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1620948070166
--------------------
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-5"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ParamProductionCell-PT-5, 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 r147-tall-162089138000254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-5.tgz
mv ParamProductionCell-PT-5 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 ;