About the Execution of 2021-gold for ParamProductionCell-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 807.439 | 42982.00 | 64851.00 | 464.80 | 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-165277003100174.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-3, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-165277003100174
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 9.3K Apr 29 17:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 17:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.8K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K 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 1652992337973
Running Version 0
[2022-05-19 20:32:21] [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:32:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:32:21] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2022-05-19 20:32:21] [INFO ] Transformed 231 places.
[2022-05-19 20:32:21] [INFO ] Transformed 202 transitions.
[2022-05-19 20:32:21] [INFO ] Found NUPN structural information;
[2022-05-19 20:32:21] [INFO ] Parsed PT model containing 231 places and 202 transitions in 204 ms.
Built sparse matrix representations for Structural reductions in 8 ms.18726KB memory used
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Applied a total of 0 rules in 35 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 14 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:32:21] [INFO ] Computed 59 place invariants in 28 ms
[2022-05-19 20:32:22] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-19 20:32:22] [INFO ] Computed 59 place invariants in 13 ms
[2022-05-19 20:32:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-19 20:32:22] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2022-05-19 20:32:22] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2022-05-19 20:32:22] [INFO ] Computed 59 place invariants in 12 ms
[2022-05-19 20:32:22] [INFO ] Dead Transitions using invariants and state equation in 346 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 2293 ms (no deadlock found). (steps per millisecond=545 )
Random directed walk for 1250002 steps, including 0 resets, run took 1702 ms (no deadlock found). (steps per millisecond=734 )
// Phase 1: matrix 202 rows 231 cols
[2022-05-19 20:32:26] [INFO ] Computed 59 place invariants in 7 ms
[2022-05-19 20:32:26] [INFO ] [Real]Absence check using 35 positive place invariants in 77 ms returned sat
[2022-05-19 20:32:27] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 160 ms returned sat
[2022-05-19 20:32:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:32:28] [INFO ] [Real]Absence check using state equation in 1656 ms returned sat
[2022-05-19 20:32:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:32:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 24 ms returned sat
[2022-05-19 20:32:29] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 45 ms returned sat
[2022-05-19 20:32:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:32:29] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2022-05-19 20:32:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-19 20:32:30] [INFO ] [Nat]Added 68 Read/Feed constraints in 30 ms returned sat
[2022-05-19 20:32:30] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 4 ms to minimize.
[2022-05-19 20:32:30] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
[2022-05-19 20:32:30] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
[2022-05-19 20:32:30] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2022-05-19 20:32:30] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 2 ms to minimize.
[2022-05-19 20:32:31] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2022-05-19 20:32:31] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2022-05-19 20:32:31] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2022-05-19 20:32:31] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2022-05-19 20:32:31] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2022-05-19 20:32:32] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2022-05-19 20:32:32] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2022-05-19 20:32:32] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2022-05-19 20:32:32] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2022-05-19 20:32:32] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2022-05-19 20:32:32] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2022-05-19 20:32:33] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2022-05-19 20:32:33] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2022-05-19 20:32:33] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2022-05-19 20:32:33] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2022-05-19 20:32:33] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2022-05-19 20:32:33] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2022-05-19 20:32:33] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2022-05-19 20:32:33] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2022-05-19 20:32:34] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2022-05-19 20:32:34] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 0 ms to minimize.
[2022-05-19 20:32:34] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 0 ms to minimize.
[2022-05-19 20:32:34] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2022-05-19 20:32:34] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2022-05-19 20:32:34] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2022-05-19 20:32:34] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2022-05-19 20:32:34] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 0 ms to minimize.
[2022-05-19 20:32:35] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2022-05-19 20:32:35] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2022-05-19 20:32:35] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2022-05-19 20:32:35] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2022-05-19 20:32:35] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2022-05-19 20:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 37 trap constraints in 5617 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 2 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 95 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:32:35] [INFO ] Computed 59 place invariants in 6 ms
[2022-05-19 20:32:36] [INFO ] Implicit Places using invariants in 343 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 349 ms to find 39 implicit places.
// Phase 1: matrix 164 rows 154 cols
[2022-05-19 20:32:36] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 20:32:36] [INFO ] Dead Transitions using invariants and state equation in 114 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 42 place count 133 transition count 138
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 128 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 126 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 126 transition count 136
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 138 place count 85 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 84 transition count 94
Applied a total of 140 rules in 19 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:32:36] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:32:36] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2022-05-19 20:32:36] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:32:36] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-19 20:32:36] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
[2022-05-19 20:32:36] [INFO ] Initial state test concluded for 2 properties.
Finished random walk after 3620 steps, including 1 resets, run visited all 92 properties in 17 ms. (steps per millisecond=212 )
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 19 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:32:36] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-19 20:32:36] [INFO ] Implicit Places using invariants in 214 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 216 ms to find 39 implicit places.
// Phase 1: matrix 164 rows 154 cols
[2022-05-19 20:32:36] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-19 20:32:36] [INFO ] Dead Transitions using invariants and state equation in 102 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 42 place count 133 transition count 138
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 128 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 126 transition count 136
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 126 transition count 136
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 138 place count 85 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 84 transition count 94
Applied a total of 140 rules in 13 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:32:36] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:32:36] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2022-05-19 20:32:36] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 20:32:36] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-19 20:32:37] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
[2022-05-19 20:32:37] [INFO ] Flatten gal took : 51 ms
[2022-05-19 20:32:37] [INFO ] Flatten gal took : 20 ms
[2022-05-19 20:32:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15394883061798382085.gal : 10 ms
[2022-05-19 20:32:37] [INFO ] Time to serialize properties into /tmp/CTLFireability471346263151555610.ctl : 4 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/CTLFireability15394883061798382085.gal, -t, CGAL, -ctl, /tmp/CTLFireability471346263151555610.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/CTLFireability15394883061798382085.gal -t CGAL -ctl /tmp/CTLFireability471346263151555610.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,36112,0.093678,6924,2,1815,5,9797,6,0,433,8324,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, 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, 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.32733,37968,1,0,227,208613,209,129,2654,132274,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.73166,50252,1,0,279,283879,210,162,2654,187947,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.23442,60548,1,0,331,361550,211,196,2654,246600,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,2.78779,73484,1,0,383,455807,212,230,2654,314318,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,2.95793,79028,1,0,437,492637,213,264,2654,342849,625
Formula is TRUE !
***************************************
original formula: AG(EF(((table_bottom_pos>=1)&&(TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_bottom_pos>=1)&&(TL_lower_run>=1)))))] = FALSE
(forward)formula 5,1,2.97188,79292,1,0,491,494089,214,297,2654,345904,711
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 6,1,2.97551,79556,1,0,545,494181,215,331,2654,346249,797
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-19 20:32:40] [INFO ] Flatten gal took : 21 ms
[2022-05-19 20:32:40] [INFO ] Applying decomposition
[2022-05-19 20:32:40] [INFO ] Flatten gal took : 19 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/graph10260486964251885202.txt, -o, /tmp/graph10260486964251885202.bin, -w, /tmp/graph10260486964251885202.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/graph10260486964251885202.bin, -l, -1, -v, -w, /tmp/graph10260486964251885202.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-19 20:32:40] [INFO ] Decomposing Gal with order
[2022-05-19 20:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 20:32:40] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-19 20:32:40] [INFO ] Flatten gal took : 79 ms
[2022-05-19 20:32:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-19 20:32:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12313460894574749137.gal : 9 ms
[2022-05-19 20:32:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1164375659677075137.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/CTLFireability12313460894574749137.gal, -t, CGAL, -ctl, /tmp/CTLFireability1164375659677075137.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/CTLFireability12313460894574749137.gal -t CGAL -ctl /tmp/CTLFireability1164375659677075137.ctl
No direction supplied, using forward translation only.
Parsed 87 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,36112,0.101232,6188,276,110,2969,401,342,2886,105,1229,0
Converting to forward existential form...Done !
original formula: AG(EF(((i2.i1.u5.table_top_pos>=1)&&(i2.i1.u6.TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i1.u5.table_top_pos>=1)&&(i2.i1.u6.TU_lift_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions crane_lock_output_area_CU_lower_Pstart, 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, u10.A2U_rot1_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u10.A2U_rot2_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u10.A2U_rot3_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u11.A2L_rot1_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u11.A2L_rot2_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u11.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.u2.deposit_belt_lock_input_area.deposit_belt_lock_output_area.DB_trans_Pstart, i2.FB_deliver_Cstop_FB_deliver_Pstop_feed_belt_unlock_input_area_feed_belt_unlock_output_area_table_lock_input_area_TU_rot_Pstart, i2.i0.u0.TL_lower_Pstop.table_unlock_input_area.feed_belt_lock_input_area.feed_belt_lock_output_area.FB_trans_Pstart, i2.i1.TL_rot_Cstop_TL_rot_Pstop_TL_lower_Pstart, i2.i1.TU_rot_Cstop_TU_rot_Pstop_TU_lift_Pstart, i9.CL_lift_Cstop_CL_lift_Pstop_CL_trans_Pstart, i9.u16.CU_lift_Cstop.CU_lift_Pstop.CU_trans_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/69/25/94
(forward)formula 0,1,0.336932,12436,1,0,19257,919,1278,16620,506,2248,46145
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i1.u5.table_bottom_pos>=1)&&(i2.i1.u6.TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i1.u5.table_bottom_pos>=1)&&(i2.i1.u6.TU_lift_run>=1)))))] = FALSE
(forward)formula 1,1,0.456123,15604,1,0,28084,920,1285,24264,506,2249,68803
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i1.u4.table_load_angle>=1)&&(i2.i1.u6.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i1.u4.table_load_angle>=1)&&(i2.i1.u6.TU_rot_run>=1)))))] = FALSE
(forward)formula 2,1,0.564143,19036,1,0,37183,920,1295,32038,506,2249,91584
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u8.belt2_light_barrier_false>=1)&&(i1.u2.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u8.belt2_light_barrier_false>=1)&&(i1.u2.DB_trans_run>=1)))))] = FALSE
(forward)formula 3,1,0.668568,21676,1,0,43817,920,1300,38347,506,2255,108687
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u8.belt2_light_barrier_true>=1)&&(i1.u8.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u8.belt2_light_barrier_true>=1)&&(i1.u8.DB_deliver_run>=1)))))] = FALSE
(forward)formula 4,1,0.746363,24052,1,0,50003,927,1308,43814,508,2296,125161
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i0.u9.belt1_light_barrier_false>=1)&&(i2.i0.u0.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i0.u9.belt1_light_barrier_false>=1)&&(i2.i0.u0.FB_trans_run>=1)))))] = FALSE
(forward)formula 5,1,0.849211,27748,1,0,59485,927,1318,51793,508,2296,148445
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i0.u9.belt1_light_barrier_true>=1)&&(i2.i0.u9.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i0.u9.belt1_light_barrier_true>=1)&&(i2.i0.u9.FB_deliver_run>=1)))))] = FALSE
(forward)formula 6,1,0.937127,31180,1,0,68427,928,1329,59231,509,2306,171599
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u10.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u10.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 7,1,1.01316,34084,1,0,76243,956,1332,65986,509,2408,192005
Formula is TRUE !
***************************************
original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u10.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u10.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 8,1,1.0631,36196,1,0,80935,964,1335,70245,509,2426,204513
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u10.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u10.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 9,1,1.12109,37780,1,0,83702,969,1339,73123,509,2444,212106
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_retract_ext>=1)&&(u10.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_retract_ext>=1)&&(u10.A2U_ext_run>=1)))))] = FALSE
(forward)formula 10,1,1.13893,38044,1,0,84953,969,1342,74785,509,2446,215873
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_release_ext>=1)&&(u12.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_release_ext>=1)&&(u12.A2U_ret_run>=1)))))] = FALSE
(forward)formula 11,1,1.15288,38572,1,0,85683,969,1348,75835,511,2446,218454
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_pick_up_angle>=1)&&(u11.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_angle>=1)&&(u11.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 12,1,1.20978,40684,1,0,91043,972,1351,80881,511,2457,232672
Formula is TRUE !
***************************************
original formula: AG(EF(((u15.arm1_release_angle>=1)&&(u11.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_angle>=1)&&(u11.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 13,1,1.25013,42004,1,0,94335,972,1354,84370,511,2458,241508
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u11.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u11.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 14,1,1.26806,42532,1,0,95210,972,1357,85598,511,2459,244564
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_retract_ext>=1)&&(u11.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_retract_ext>=1)&&(u11.A2L_ext_run>=1)))))] = FALSE
(forward)formula 15,1,1.28938,43324,1,0,96481,978,1359,87342,511,2468,248118
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_pick_up_ext>=1)&&(u12.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_ext>=1)&&(u12.A2L_ret_run>=1)))))] = FALSE
(forward)formula 16,1,1.30545,43852,1,0,97177,978,1365,88368,513,2468,250716
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 17,1,1.35301,45436,1,0,101065,978,1368,92094,513,2468,261866
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u14.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 18,1,1.39351,46756,1,0,104225,978,1371,95188,513,2470,271298
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u14.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u14.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 19,1,1.47775,48340,1,0,107725,978,1374,98464,513,2471,280717
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 20,1,1.50055,49132,1,0,109168,980,1377,100357,513,2472,284945
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 21,1,1.51344,49396,1,0,109762,984,1381,101221,513,2473,287384
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 22,1,1.53848,50188,1,0,111371,984,1384,103262,513,2480,292106
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u15.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u15.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 23,1,1.60118,51244,1,0,113290,984,1387,105608,513,2483,297864
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u15.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u15.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 24,1,1.6317,52564,1,0,115776,984,1390,108436,513,2485,305253
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 25,1,1.6482,53092,1,0,116795,1000,1392,109877,513,2514,308321
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 26,1,1.65699,53356,1,0,117260,1003,1398,110479,515,2515,310132
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 27,1,1.74516,57052,1,0,127333,1005,1406,118684,516,2536,335364
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u17.crane_above_feed_belt>=1)&&(i9.u16.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.crane_above_feed_belt>=1)&&(i9.u16.CU_trans_run>=1)))))] = FALSE
(forward)formula 28,1,1.83029,60484,1,0,136986,1005,1411,126621,516,2536,359216
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u16.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u16.CU_lower_run>=1)))))] = FALSE
(forward)formula 29,1,1.92282,64444,1,0,147354,1008,1419,135132,518,2555,384598
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_transport_height>=1)&&(i9.u18.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_transport_height>=1)&&(i9.u18.CL_lower_run>=1)))))] = FALSE
(forward)formula 30,1,2.01242,68140,1,0,156925,1009,1424,142992,518,2557,408070
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u17.crane_above_deposit_belt>=1)&&(i9.u17.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.crane_above_deposit_belt>=1)&&(i9.u17.CL_trans_run>=1)))))] = FALSE
(forward)formula 31,1,2.14679,72100,1,0,165761,1010,1430,150292,519,2562,429909
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u18.crane_pick_up_height>=1)&&(i9.u18.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u18.crane_pick_up_height>=1)&&(i9.u18.CL_lift_run>=1)))))] = FALSE
(forward)formula 32,1,2.22495,75004,1,0,174808,1010,1437,157769,519,2562,453191
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u2.ch_DC_free>=1)&&(i1.u2.ch_A2D_full>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.ch_DC_free>=1)&&(i1.u2.ch_A2D_full>=1)))))] = FALSE
(forward)formula 33,1,2.27809,77116,1,0,180248,1010,1444,162570,520,2562,467575
Formula is TRUE !
***************************************
original formula: AG(EF((((i1.u8.ch_A2D_free>=1)&&(u13.swivel>=1))&&(u12.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i1.u8.ch_A2D_free>=1)&&(u13.swivel>=1))&&(u12.arm2_storing>=1)))))] = FALSE
(forward)formula 34,1,2.29219,77644,1,0,181115,1010,1454,163592,520,2562,470648
Formula is TRUE !
***************************************
original formula: AG(EF((((i0.u1.ch_A1P_free>=1)&&(u13.swivel>=1))&&(u13.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u1.ch_A1P_free>=1)&&(u13.swivel>=1))&&(u13.arm1_storing>=1)))))] = FALSE
(forward)formula 35,1,2.30163,78172,1,0,181577,1010,1464,164249,522,2562,472374
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i0.u9.ch_CF_free>=1)&&(i9.u17.crane_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i0.u9.ch_CF_free>=1)&&(i9.u17.crane_storing>=1)))))] = FALSE
(forward)formula 36,1,2.3837,81340,1,0,191010,1010,1468,171816,522,2562,495531
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u8.ch_DC_full>=1)&&(i9.u18.crane_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u8.ch_DC_full>=1)&&(i9.u18.crane_store_free>=1)))))] = FALSE
(forward)formula 37,1,2.46597,84508,1,0,199776,1010,1474,178763,522,2562,516931
Formula is TRUE !
***************************************
original formula: AG(EF((((u13.swivel>=1)&&(i2.i1.u6.TU_lift_rs>=1))&&(u13.arm1_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u13.swivel>=1)&&(i2.i1.u6.TU_lift_rs>=1))&&(u13.arm1_store_free>=1)))))] = FALSE
(forward)formula 38,1,2.47971,85036,1,0,200526,1010,1484,179677,524,2562,519488
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i0.u0.ch_CF_full>=1)&&(i2.i0.u0.TL_lower_rs>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i0.u0.ch_CF_full>=1)&&(i2.i0.u0.TL_lower_rs>=1)))))] = FALSE
(forward)formula 39,1,2.56445,88204,1,0,209361,1010,1494,186786,526,2562,541108
Formula is TRUE !
***************************************
original formula: AG(EF((((u13.swivel>=1)&&(i0.u3.PU_lower_rs>=1))&&(u12.arm2_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u13.swivel>=1)&&(i0.u3.PU_lower_rs>=1))&&(u12.arm2_store_free>=1)))))] = FALSE
(forward)formula 40,1,2.68647,88732,1,0,209992,1010,1501,187651,526,2562,543581
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u3.press_at_upper_pos>=1)&&(i0.u3.forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u3.press_at_upper_pos>=1)&&(i0.u3.forge_run>=1)))))] = FALSE
(forward)formula 41,1,2.71909,90052,1,0,212648,1011,1507,190357,526,2576,550128
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u1.press_at_middle_pos>=1)&&(i0.u1.PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u1.press_at_middle_pos>=1)&&(i0.u1.PL_lower_run>=1)))))] = FALSE
(forward)formula 42,1,2.74879,91108,1,0,214924,1011,1511,192876,526,2576,555943
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i1.u4.table_load_angle>=1)&&(i2.i1.u7.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i1.u4.table_load_angle>=1)&&(i2.i1.u7.TL_rot_run>=1)))))] = FALSE
(forward)formula 43,1,2.81814,93484,1,0,221697,1011,1519,198577,526,2576,572749
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.i1.u4.table_unload_angle>=1)&&(i2.i1.u6.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.i1.u4.table_unload_angle>=1)&&(i2.i1.u6.TU_rot_run>=1)))))] = FALSE
(forward)formula 44,1,2.90164,96652,1,0,229804,1011,1526,205203,526,2576,593687
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-19 20:32:43] [INFO ] Flatten gal took : 10 ms
[2022-05-19 20:32:43] [INFO ] Flatten gal took : 9 ms
[2022-05-19 20:32:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9568927529716869110.gal : 3 ms
[2022-05-19 20:32:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11123248406641208577.ctl : 1 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/CTLFireability9568927529716869110.gal, -t, CGAL, -ctl, /tmp/CTLFireability11123248406641208577.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/CTLFireability9568927529716869110.gal -t CGAL -ctl /tmp/CTLFireability11123248406641208577.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 42 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,36112,0.085252,7040,2,1815,5,9797,6,0,433,8324,0
Converting to forward existential form...Done !
original formula: AG(EF(((belt2_light_barrier_true>=1)&&(DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_true>=1)&&(DB_trans_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, 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, 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.23676,37392,1,0,228,205452,209,129,2653,130037,281
Formula is TRUE !
***************************************
original formula: AG(EF(((belt2_light_barrier_false>=1)&&(DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_false>=1)&&(DB_deliver_run>=1)))))] = FALSE
(forward)formula 1,1,1.56347,45576,1,0,281,257339,210,162,2653,166964,367
Formula is TRUE !
***************************************
original formula: AG(EF(((belt1_light_barrier_true>=1)&&(FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_true>=1)&&(FB_trans_run>=1)))))] = FALSE
(forward)formula 2,1,1.71313,49680,1,0,337,283357,211,195,2653,186228,453
Formula is TRUE !
***************************************
original formula: AG(EF(((A2U_in>=1)&&(arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((A2U_in>=1)&&(arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 3,1,2.41021,64992,1,0,425,393590,212,244,2653,268122,579
Formula is TRUE !
***************************************
original formula: AG(EF(((A2U_in>=1)&&(arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((A2U_in>=1)&&(arm1_release_angle>=1)))))] = FALSE
(forward)formula 4,1,2.87737,75024,1,0,488,462574,213,281,2653,318507,675
Formula is TRUE !
***************************************
original formula: AG(EF(((A2U_in>=1)&&(arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((A2U_in>=1)&&(arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 5,1,3.35509,88936,1,0,545,553579,214,314,2653,389205,761
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_angle>=1)&&(A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A2U_rot1_run>=1)))))] = FALSE
(forward)formula 6,1,3.74936,98372,1,0,609,600464,215,347,2653,428425,847
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_angle>=1)&&(A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A2U_rot2_run>=1)))))] = FALSE
(forward)formula 7,1,4.0141,106028,1,0,666,647093,216,380,2653,466376,933
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_angle>=1)&&(A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A2U_rot3_run>=1)))))] = FALSE
(forward)formula 8,1,4.56008,116060,1,0,721,717940,217,412,2653,524685,1014
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_ext>=1)&&(A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_ext>=1)&&(A2U_ext_run>=1)))))] = FALSE
(forward)formula 9,1,4.99672,127412,1,0,778,804449,218,445,2653,591064,1100
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_retract_ext>=1)&&(A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_retract_ext>=1)&&(A2U_ret_run>=1)))))] = FALSE
(forward)formula 10,1,5.57383,137180,1,0,832,866628,219,476,2653,643638,1181
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A2L_in>=1)))))] = FALSE
(forward)formula 11,1,6.08309,153548,1,0,918,979483,220,529,2653,728323,1317
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_release_angle>=1)&&(A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A2L_in>=1)))))] = FALSE
(forward)formula 12,1,6.65454,172444,1,0,989,1.0952e+06,221,572,2653,815961,1428
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_angle>=1)&&(A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A2L_in>=1)))))] = FALSE
(forward)formula 13,1,7.29502,184852,1,0,1049,1.17796e+06,222,608,2653,879432,1519
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A2L_rot1_run>=1)))))] = FALSE
(forward)formula 14,1,7.51171,191188,1,0,1105,1.21784e+06,223,641,2653,912158,1605
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A2L_rot2_run>=1)))))] = FALSE
(forward)formula 15,1,7.9534,203860,1,0,1161,1.3011e+06,224,674,2653,977409,1691
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A2L_rot3_run>=1)))))] = FALSE
(forward)formula 16,1,8.35692,216464,1,0,1217,1.36954e+06,225,707,2653,1.03145e+06,1777
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_ext>=1)&&(A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_ext>=1)&&(A2L_ext_run>=1)))))] = FALSE
(forward)formula 17,1,9.253,230456,1,0,1273,1.46224e+06,226,740,2653,1.10099e+06,1863
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_retract_ext>=1)&&(A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_retract_ext>=1)&&(A2L_ret_run>=1)))))] = FALSE
(forward)formula 18,1,9.59807,238376,1,0,1327,1.52759e+06,227,772,2653,1.15625e+06,1944
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_release_angle>=1)&&(A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A1L_in>=1)))))] = FALSE
(forward)formula 19,1,10.1165,252300,1,0,1416,1.62249e+06,228,821,2653,1.22899e+06,2070
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A1L_in>=1)))))] = FALSE
(forward)formula 20,1,10.926,261804,1,0,1488,1.68029e+06,229,862,2653,1.27342e+06,2176
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_angle>=1)&&(A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A1L_in>=1)))))] = FALSE
(forward)formula 21,1,11.3204,272364,1,0,1554,1.76276e+06,230,899,2653,1.337e+06,2272
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A1L_rot1_run>=1)))))] = FALSE
(forward)formula 22,1,11.4141,275004,1,0,1613,1.77994e+06,231,930,2653,1.35144e+06,2356
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A1L_rot2_run>=1)))))] = FALSE
(forward)formula 23,1,11.5131,277908,1,0,1673,1.79832e+06,232,963,2653,1.36622e+06,2442
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A1L_rot3_run>=1)))))] = FALSE
(forward)formula 24,1,11.6753,282660,1,0,1733,1.8291e+06,233,996,2653,1.39128e+06,2528
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_ext>=1)&&(A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_ext>=1)&&(A1L_ext_run>=1)))))] = FALSE
(forward)formula 25,1,11.912,289260,1,0,1798,1.87588e+06,234,1029,2653,1.42759e+06,2614
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_retract_ext>=1)&&(A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_retract_ext>=1)&&(A1L_ret_run>=1)))))] = FALSE
(forward)formula 26,1,12.0143,292164,1,0,1856,1.89374e+06,235,1059,2653,1.44273e+06,2694
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A1U_in>=1)))))] = FALSE
(forward)formula 27,1,12.4377,304044,1,0,1924,1.97672e+06,236,1100,2653,1.50757e+06,2800
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A1U_in>=1)))))] = FALSE
(forward)formula 28,1,12.7077,311700,1,0,1998,2.02913e+06,237,1145,2653,1.54805e+06,2916
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_angle>=1)&&(A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle>=1)&&(A1U_in>=1)))))] = FALSE
(forward)formula 29,1,13.1626,324500,1,0,2063,2.11267e+06,238,1184,2653,1.61206e+06,3017
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_release_angle>=1)&&(A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A1U_rot1_run>=1)))))] = FALSE
(forward)formula 30,1,13.548,336576,1,0,2119,2.18021e+06,239,1217,2653,1.66687e+06,3103
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_release_angle>=1)&&(A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A1U_rot2_run>=1)))))] = FALSE
(forward)formula 31,1,14.2078,343176,1,0,2175,2.21992e+06,240,1250,2653,1.69909e+06,3189
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_release_angle>=1)&&(A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A1U_rot3_run>=1)))))] = FALSE
(forward)formula 32,1,14.5713,354264,1,0,2231,2.29039e+06,241,1283,2653,1.75498e+06,3275
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_release_ext>=1)&&(A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_ext>=1)&&(A1U_ext_run>=1)))))] = FALSE
(forward)formula 33,1,15.0099,366672,1,0,2287,2.37495e+06,242,1316,2653,1.81973e+06,3361
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_retract_ext>=1)&&(A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_retract_ext>=1)&&(A1U_ret_run>=1)))))] = FALSE
(forward)formula 34,1,15.3346,377692,1,0,2341,2.4359e+06,243,1348,2653,1.87184e+06,3442
Formula is TRUE !
***************************************
original formula: AG(EF(((crane_transport_height>=1)&&(CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_transport_height>=1)&&(CU_lift_run>=1)))))] = FALSE
(forward)formula 35,1,15.444,380596,1,0,2394,2.45755e+06,244,1380,2653,1.88879e+06,3524
Formula is TRUE !
***************************************
original formula: AG(EF(((crane_above_deposit_belt>=1)&&(CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_above_deposit_belt>=1)&&(CU_trans_run>=1)))))] = FALSE
(forward)formula 36,1,15.4717,381124,1,0,2448,2.46174e+06,245,1413,2653,1.89379e+06,3610
Formula is TRUE !
***************************************
original formula: AG(EF(((crane_release_height>=1)&&(CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_release_height>=1)&&(CU_lower_run>=1)))))] = FALSE
(forward)formula 37,1,15.5198,382444,1,0,2502,2.46943e+06,246,1446,2653,1.90119e+06,3696
Formula is TRUE !
***************************************
original formula: AG(EF(((crane_pick_up_height>=1)&&(CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_pick_up_height>=1)&&(CL_lower_run>=1)))))] = FALSE
(forward)formula 38,1,15.7151,387724,1,0,2555,2.50563e+06,247,1479,2653,1.92872e+06,3782
Formula is TRUE !
***************************************
original formula: AG(EF(((crane_above_feed_belt>=1)&&(CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_above_feed_belt>=1)&&(CL_trans_run>=1)))))] = FALSE
(forward)formula 39,1,15.7732,389044,1,0,2608,2.51569e+06,248,1512,2653,1.93847e+06,3868
Formula is TRUE !
***************************************
original formula: AG(EF(((crane_transport_height>=1)&&(CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((crane_transport_height>=1)&&(CL_lift_run>=1)))))] = FALSE
(forward)formula 40,1,15.8289,390364,1,0,2660,2.52501e+06,249,1544,2653,1.9469e+06,3950
Formula is TRUE !
***************************************
original formula: AG(EF(((belt1_light_barrier_false>=1)&&(FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_false>=1)&&(FB_deliver_run>=1)))))] = FALSE
(forward)formula 41,1,15.8518,390892,1,0,2715,2.52885e+06,250,1576,2653,1.95035e+06,4032
Formula is TRUE !
***************************************
Able to resolve query Liveness after proving 94 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1652992380955
--------------------
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-3"
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-3, 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-165277003100174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 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 ;