fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r162-smll-165277003100159
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ParamProductionCell-PT-0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
377.531 23165.00 39630.00 441.20 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-165277003100159.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-0, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-165277003100159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 9.2K Apr 29 17:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 17:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.2K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 149K 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 1652992133883

Running Version 0
[2022-05-19 20:28:57] [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:28:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:28:57] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2022-05-19 20:28:57] [INFO ] Transformed 198 places.
[2022-05-19 20:28:57] [INFO ] Transformed 176 transitions.
[2022-05-19 20:28:57] [INFO ] Found NUPN structural information;
[2022-05-19 20:28:57] [INFO ] Parsed PT model containing 198 places and 176 transitions in 232 ms.
Built sparse matrix representations for Structural reductions in 10 ms.18118KB memory used
Starting structural reductions, iteration 0 : 198/198 places, 176/176 transitions.
Applied a total of 0 rules in 42 ms. Remains 198 /198 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 176/176 transitions.
Starting structural reductions, iteration 0 : 198/198 places, 176/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 198 /198 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 198 cols
[2022-05-19 20:28:57] [INFO ] Computed 49 place invariants in 29 ms
[2022-05-19 20:28:57] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 176 rows 198 cols
[2022-05-19 20:28:57] [INFO ] Computed 49 place invariants in 7 ms
[2022-05-19 20:28:58] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-19 20:28:58] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2022-05-19 20:28:58] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 176 rows 198 cols
[2022-05-19 20:28:58] [INFO ] Computed 49 place invariants in 11 ms
[2022-05-19 20:28:58] [INFO ] Dead Transitions using invariants and state equation in 415 ms returned []
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 176/176 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2352 ms (no deadlock found). (steps per millisecond=531 )
Random directed walk for 1250002 steps, including 0 resets, run took 1385 ms (no deadlock found). (steps per millisecond=902 )
// Phase 1: matrix 176 rows 198 cols
[2022-05-19 20:29:02] [INFO ] Computed 49 place invariants in 5 ms
[2022-05-19 20:29:02] [INFO ] [Real]Absence check using 32 positive place invariants in 47 ms returned sat
[2022-05-19 20:29:02] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 46 ms returned sat
[2022-05-19 20:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:29:03] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2022-05-19 20:29:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:29:03] [INFO ] [Nat]Absence check using 32 positive place invariants in 37 ms returned sat
[2022-05-19 20:29:03] [INFO ] [Nat]Absence check using 32 positive and 17 generalized place invariants in 47 ms returned sat
[2022-05-19 20:29:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:29:04] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2022-05-19 20:29:04] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-19 20:29:04] [INFO ] [Nat]Added 59 Read/Feed constraints in 33 ms returned sat
[2022-05-19 20:29:04] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 5 ms to minimize.
[2022-05-19 20:29:04] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 3 ms to minimize.
[2022-05-19 20:29:05] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2022-05-19 20:29:05] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
[2022-05-19 20:29:05] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2022-05-19 20:29:05] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2022-05-19 20:29:05] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2022-05-19 20:29:05] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2022-05-19 20:29:06] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2022-05-19 20:29:06] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2022-05-19 20:29:06] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2022-05-19 20:29:06] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2022-05-19 20:29:06] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2022-05-19 20:29:06] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2022-05-19 20:29:06] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2022-05-19 20:29:07] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2022-05-19 20:29:07] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 16 ms to minimize.
[2022-05-19 20:29:07] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 0 ms to minimize.
[2022-05-19 20:29:07] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2022-05-19 20:29:07] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2022-05-19 20:29:07] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-05-19 20:29:07] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2022-05-19 20:29:07] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2022-05-19 20:29:07] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2022-05-19 20:29:08] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2022-05-19 20:29:08] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2022-05-19 20:29:08] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2022-05-19 20:29:08] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2022-05-19 20:29:08] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2022-05-19 20:29:08] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2022-05-19 20:29:08] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2022-05-19 20:29:08] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 0 ms to minimize.
[2022-05-19 20:29:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 32 trap constraints in 4376 ms
Starting structural reductions, iteration 0 : 198/198 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 198 transition count 164
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 164
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 180 transition count 158
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 180 transition count 158
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 20 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 74 place count 160 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 74 place count 160 transition count 139
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 77 place count 158 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 156 transition count 138
Applied a total of 80 rules in 103 ms. Remains 156 /198 variables (removed 42) and now considering 138/176 (removed 38) transitions.
// Phase 1: matrix 138 rows 156 cols
[2022-05-19 20:29:09] [INFO ] Computed 45 place invariants in 5 ms
[2022-05-19 20:29:09] [INFO ] Implicit Places using invariants in 267 ms returned [11, 12, 13, 14, 18, 24, 27, 28, 31, 32, 36, 37, 47, 50, 51, 57, 60, 61, 73, 74, 76, 88, 89, 91, 93, 94, 128, 129, 131, 133, 134]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 271 ms to find 31 implicit places.
// Phase 1: matrix 138 rows 125 cols
[2022-05-19 20:29:09] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-19 20:29:09] [INFO ] Dead Transitions using invariants and state equation in 169 ms returned []
Starting structural reductions, iteration 1 : 125/198 places, 138/176 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 125 transition count 122
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 109 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 109 transition count 118
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 105 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 103 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 103 transition count 116
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 118 place count 66 transition count 79
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 120 place count 65 transition count 78
Applied a total of 120 rules in 27 ms. Remains 65 /125 variables (removed 60) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-05-19 20:29:09] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-19 20:29:09] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-05-19 20:29:09] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-19 20:29:09] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-19 20:29:09] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 65/198 places, 78/176 transitions.
[2022-05-19 20:29:09] [INFO ] Initial state test concluded for 1 properties.
Finished random walk after 764 steps, including 0 resets, run visited all 77 properties in 18 ms. (steps per millisecond=42 )
Able to resolve query QuasiLiveness after proving 78 properties.
Starting structural reductions, iteration 0 : 198/198 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 198 transition count 164
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 164
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 180 transition count 158
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 180 transition count 158
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 20 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 74 place count 160 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 74 place count 160 transition count 139
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 77 place count 158 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 156 transition count 138
Applied a total of 80 rules in 48 ms. Remains 156 /198 variables (removed 42) and now considering 138/176 (removed 38) transitions.
// Phase 1: matrix 138 rows 156 cols
[2022-05-19 20:29:09] [INFO ] Computed 45 place invariants in 4 ms
[2022-05-19 20:29:10] [INFO ] Implicit Places using invariants in 385 ms returned [11, 12, 13, 14, 18, 24, 27, 28, 31, 32, 36, 37, 47, 50, 51, 57, 60, 61, 73, 74, 76, 88, 89, 91, 93, 94, 128, 129, 131, 133, 134]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 388 ms to find 31 implicit places.
// Phase 1: matrix 138 rows 125 cols
[2022-05-19 20:29:10] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-19 20:29:10] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Starting structural reductions, iteration 1 : 125/198 places, 138/176 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 125 transition count 122
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 109 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 109 transition count 118
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 105 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 103 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 103 transition count 116
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 118 place count 66 transition count 79
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 120 place count 65 transition count 78
Applied a total of 120 rules in 24 ms. Remains 65 /125 variables (removed 60) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-05-19 20:29:10] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-19 20:29:10] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-05-19 20:29:10] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-19 20:29:10] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-19 20:29:10] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 65/198 places, 78/176 transitions.
[2022-05-19 20:29:11] [INFO ] Flatten gal took : 99 ms
[2022-05-19 20:29:11] [INFO ] Flatten gal took : 25 ms
[2022-05-19 20:29:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5969103254653319319.gal : 14 ms
[2022-05-19 20:29:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9865471777715043553.ctl : 5 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/CTLFireability5969103254653319319.gal, -t, CGAL, -ctl, /tmp/CTLFireability9865471777715043553.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/CTLFireability5969103254653319319.gal -t CGAL -ctl /tmp/CTLFireability9865471777715043553.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 78 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,7928,0.094276,7028,2,1117,5,11534,6,0,341,11266,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 TL_rot_Cstop.TL_rot_Pstop.TL_lower_Pstart, TU_rot_Cstop.TU_rot_Pstop.TU_lift_Pstart, FB_deliver_Cstop.FB_deliver_Pstop.feed_belt_unlock_input_area.feed_belt_unlock_output_area.table_lock_input_area.TU_rot_Pstart, A2U_rot1_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, A2U_rot2_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, A2U_rot3_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, A2U_ret_Cstop.A2U_ret_Pstop.arm2_unlock_output_area.arm2_unlock_swivel_2.deposit_belt_lock_input_area.deposit_belt_lock_output_area.DB_trans_Pstart, 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, TL_lower_Cstop.TL_lower_Pstop.table_unlock_input_area.p_t2.p_t1.feed_belt_lock_input_area.feed_belt_lock_output_area.FB_trans_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/58/20/78
(forward)formula 0,1,0.484102,19080,1,0,186,76558,177,103,2099,52023,224
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,0.528705,20400,1,0,223,84410,178,126,2099,57969,285
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,0.614707,22248,1,0,260,94965,179,150,2099,66922,346
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,0.857421,26472,1,0,297,119942,180,174,2099,87204,407
Formula is TRUE !

***************************************

original formula: AG(EF(((table_unload_angle>=1)&&(TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_unload_angle>=1)&&(TL_rot_run>=1)))))] = FALSE
(forward)formula 4,1,1.06495,30552,1,0,336,148223,181,198,2099,110635,468
Formula is TRUE !

***************************************

original formula: AG(EF(((table_top_pos>=1)&&(TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_top_pos>=1)&&(TL_lower_run>=1)))))] = FALSE
(forward)formula 5,1,1.07024,30816,1,0,375,148441,182,222,2099,111573,529
Formula is TRUE !

***************************************

original formula: AG(EF(((table_top_pos>=1)&&(TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_top_pos>=1)&&(TU_lift_run>=1)))))] = FALSE
(forward)formula 6,1,1.07587,31080,1,0,414,148861,183,245,2099,112181,590
Formula is TRUE !

***************************************

original formula: AG(EF(((table_bottom_pos>=1)&&(TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_bottom_pos>=1)&&(TU_lift_run>=1)))))] = FALSE
(forward)formula 7,1,1.07961,31080,1,0,453,149068,184,269,2099,112755,651
Formula is TRUE !

***************************************

original formula: AG(EF(((table_load_angle>=1)&&(TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_load_angle>=1)&&(TU_rot_run>=1)))))] = FALSE
(forward)formula 8,1,1.0819,31080,1,0,492,149138,185,293,2099,112983,712
Formula is TRUE !

***************************************

original formula: AG(EF(((belt2_light_barrier_false>=1)&&(DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_false>=1)&&(DB_trans_run>=1)))))] = FALSE
(forward)formula 9,1,1.21572,35304,1,0,527,178252,186,317,2099,134594,773
Formula is TRUE !

***************************************

original formula: AG(EF(((belt2_light_barrier_true>=1)&&(DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_true>=1)&&(DB_deliver_run>=1)))))] = FALSE
(forward)formula 10,1,1.27055,36888,1,0,562,187880,187,340,2099,143415,834
Formula is TRUE !

***************************************

original formula: AG(EF(((belt1_light_barrier_false>=1)&&(FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_false>=1)&&(FB_trans_run>=1)))))] = FALSE
(forward)formula 11,1,1.33729,39000,1,0,601,199807,188,364,2099,152851,895
Formula is TRUE !

***************************************

original formula: AG(EF(((belt1_light_barrier_true>=1)&&(FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt1_light_barrier_true>=1)&&(FB_deliver_run>=1)))))] = FALSE
(forward)formula 12,1,1.45887,41112,1,0,640,212483,189,387,2099,161950,956
Formula is TRUE !

***************************************

original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A2U_rot1_run>=1)))))] = FALSE
(forward)formula 13,1,1.69031,48240,1,0,699,255167,190,422,2099,197361,1047
Formula is TRUE !

***************************************

original formula: AG(EF(((arm1_release_angle>=1)&&(A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A2U_rot2_run>=1)))))] = FALSE
(forward)formula 14,1,1.97229,55372,1,0,746,293955,191,449,2099,229968,1118
Formula is TRUE !

***************************************

original formula: AG(EF(((arm2_pick_up_angle>=1)&&(A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle>=1)&&(A2U_rot3_run>=1)))))] = FALSE
(forward)formula 15,1,2.16211,58276,1,0,787,315889,192,472,2099,248830,1179
Formula is TRUE !

***************************************

original formula: AG(EF(((arm2_retract_ext>=1)&&(A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_retract_ext>=1)&&(A2U_ext_run>=1)))))] = FALSE
(forward)formula 16,1,2.27412,61444,1,0,828,338852,193,496,2099,267281,1240
Formula is TRUE !

***************************************

original formula: AG(EF(((arm2_release_ext>=1)&&(A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_ext>=1)&&(A2U_ret_run>=1)))))] = FALSE
(forward)formula 17,1,2.35414,63820,1,0,869,354246,194,519,2099,281162,1301
Formula is TRUE !

***************************************

original formula: AG(EF(((arm1_pick_up_angle>=1)&&(A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle>=1)&&(A2L_rot1_run>=1)))))] = FALSE
(forward)formula 18,1,2.58252,70420,1,0,928,396784,195,554,2099,315491,1392
Formula is TRUE !

***************************************

original formula: AG(EF(((arm1_release_angle>=1)&&(A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle>=1)&&(A2L_rot2_run>=1)))))] = FALSE
(forward)formula 19,1,2.95455,78604,1,0,981,444971,196,585,2099,355164,1473
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-19 20:29:14] [INFO ] Flatten gal took : 18 ms
[2022-05-19 20:29:14] [INFO ] Applying decomposition
[2022-05-19 20:29:14] [INFO ] Flatten gal took : 18 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/graph15500774642622933221.txt, -o, /tmp/graph15500774642622933221.bin, -w, /tmp/graph15500774642622933221.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/graph15500774642622933221.bin, -l, -1, -v, -w, /tmp/graph15500774642622933221.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-19 20:29:14] [INFO ] Decomposing Gal with order
[2022-05-19 20:29:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 20:29:14] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-19 20:29:14] [INFO ] Flatten gal took : 76 ms
[2022-05-19 20:29:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-19 20:29:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6832863773999132753.gal : 7 ms
[2022-05-19 20:29:14] [INFO ] Time to serialize properties into /tmp/CTLFireability6952379905686290827.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/CTLFireability6832863773999132753.gal, -t, CGAL, -ctl, /tmp/CTLFireability6952379905686290827.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/CTLFireability6832863773999132753.gal -t CGAL -ctl /tmp/CTLFireability6952379905686290827.ctl
No direction supplied, using forward translation only.
Parsed 58 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,7928,0.083819,5700,187,107,1992,352,239,2193,91,1050,0


Converting to forward existential form...Done !
original formula: AG(EF(((u7.arm2_release_angle>=1)&&(u8.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.arm2_release_angle>=1)&&(u8.A2L_rot3_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions A2U_ret_Cstop_A2U_ret_Pstop_arm2_unlock_output_area_arm2_unlock_swivel_2_deposit_belt_lock_input_area_deposit_belt_lock_output_area_DB_trans_Pstart, 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, u7.A2U_rot1_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u7.A2U_rot2_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u7.A2U_rot3_Cstop.A2U_rot1_Pstop.A2U_ext_Pstart, u8.A2L_rot1_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u8.A2L_rot2_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u8.A2L_rot3_Cstop.A2L_rot1_Pstop.A2L_ext_Pstart, u11.A1L_rot1_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u11.A1L_rot2_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u11.A1L_rot3_Cstop.A1L_rot1_Pstop.A1L_ext_Pstart, u12.A1U_rot1_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u12.A1U_rot2_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, u12.A1U_rot3_Cstop.A1U_rot1_Pstop.A1U_ext_Pstart, i1.TL_lower_Cstop_TL_lower_Pstop_table_unlock_input_area_p_t2_p_t1_feed_belt_lock_input_area_feed_belt_lock_output_area_FB_trans_Pstart, i1.TU_rot_Cstop_TU_rot_Pstop_TU_lift_Pstart, i1.TL_rot_Cstop_TL_rot_Pstop_TL_lower_Pstart, i1.u6.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/58/20/78
(forward)formula 0,1,0.186345,7668,1,0,6028,871,872,6466,439,2186,19199
Formula is TRUE !

***************************************

original formula: AG(EF(((u9.arm2_retract_ext>=1)&&(u8.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_retract_ext>=1)&&(u8.A2L_ext_run>=1)))))] = FALSE
(forward)formula 1,1,0.212607,8196,1,0,7021,914,875,7748,439,2260,22497
Formula is TRUE !

***************************************

original formula: AG(EF(((u9.arm2_pick_up_ext>=1)&&(u9.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_pick_up_ext>=1)&&(u9.A2L_ret_run>=1)))))] = FALSE
(forward)formula 2,1,0.229445,8724,1,0,7618,918,879,8575,441,2261,24724
Formula is TRUE !

***************************************

original formula: AG(EF(((u12.arm1_release_angle>=1)&&(u11.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_angle>=1)&&(u11.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 3,1,0.264208,9516,1,0,9461,918,882,10401,441,2265,30234
Formula is TRUE !

***************************************

original formula: AG(EF(((u8.arm2_pick_up_angle>=1)&&(u11.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_pick_up_angle>=1)&&(u11.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 4,1,0.28837,10044,1,0,10915,918,885,11873,441,2271,34579
Formula is TRUE !

***************************************

original formula: AG(EF(((u7.arm2_release_angle>=1)&&(u11.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.arm2_release_angle>=1)&&(u11.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 5,1,0.308258,10572,1,0,12055,918,888,12975,441,2271,38037
Formula is TRUE !

***************************************

original formula: AG(EF(((u10.arm1_retract_ext>=1)&&(u11.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_retract_ext>=1)&&(u11.A1L_ext_run>=1)))))] = FALSE
(forward)formula 6,1,0.325419,10836,1,0,12596,918,892,13608,441,2271,39665
Formula is TRUE !

***************************************

original formula: AG(EF(((u10.arm1_pick_up_ext>=1)&&(u10.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_ext>=1)&&(u10.A1L_ret_run>=1)))))] = FALSE
(forward)formula 7,1,0.335425,11100,1,0,12817,919,896,13987,441,2271,40644
Formula is TRUE !

***************************************

original formula: AG(EF(((u11.arm1_pick_up_angle>=1)&&(u12.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_pick_up_angle>=1)&&(u12.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 8,1,0.354365,11364,1,0,13270,919,899,14638,441,2294,42286
Formula is TRUE !

***************************************

original formula: AG(EF(((u8.arm2_pick_up_angle>=1)&&(u12.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_pick_up_angle>=1)&&(u12.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 9,1,0.377861,11892,1,0,14379,919,902,15871,441,2302,45951
Formula is TRUE !

***************************************

original formula: AG(EF(((u7.arm2_release_angle>=1)&&(u12.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.arm2_release_angle>=1)&&(u12.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 10,1,0.402755,12420,1,0,15099,919,905,16753,441,2310,48474
Formula is TRUE !

***************************************

original formula: AG(EF(((u10.arm1_retract_ext>=1)&&(u12.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_retract_ext>=1)&&(u12.A1U_ext_run>=1)))))] = FALSE
(forward)formula 11,1,0.413857,12684,1,0,15460,934,907,17272,441,2337,49649
Formula is TRUE !

***************************************

original formula: AG(EF(((u10.arm1_release_ext>=1)&&(u10.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_release_ext>=1)&&(u10.A1U_ret_run>=1)))))] = FALSE
(forward)formula 12,1,0.422027,12684,1,0,15698,934,913,17572,443,2337,50459
Formula is TRUE !

***************************************

original formula: AG(EF((((u5.ch_A2D_free>=1)&&(u9.swivel>=1))&&(u9.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u5.ch_A2D_free>=1)&&(u9.swivel>=1))&&(u9.arm2_storing>=1)))))] = FALSE
(forward)formula 13,1,0.433803,12948,1,0,16115,934,924,18083,445,2337,52095
Formula is TRUE !

***************************************

original formula: AG(EF((((i0.u1.ch_A1P_free>=1)&&(u9.swivel>=1))&&(u10.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u1.ch_A1P_free>=1)&&(u9.swivel>=1))&&(u10.arm1_storing>=1)))))] = FALSE
(forward)formula 14,1,0.448858,13212,1,0,16215,934,931,18208,445,2337,52548
Formula is TRUE !

***************************************

original formula: AG(EF((((u9.swivel>=1)&&(i1.u3.TU_lift_rs>=1))&&(u10.arm1_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u9.swivel>=1)&&(i1.u3.TU_lift_rs>=1))&&(u10.arm1_store_free>=1)))))] = FALSE
(forward)formula 15,1,0.454451,13476,1,0,16393,934,937,18372,445,2337,53370
Formula is TRUE !

***************************************

original formula: AG(EF((((u9.swivel>=1)&&(i0.u0.PU_lower_rs>=1))&&(u9.arm2_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u9.swivel>=1)&&(i0.u0.PU_lower_rs>=1))&&(u9.arm2_store_free>=1)))))] = FALSE
(forward)formula 16,1,0.464711,13476,1,0,16835,934,946,18868,447,2337,55136
Formula is TRUE !

***************************************

original formula: AG(EF(((i0.u0.press_at_upper_pos>=1)&&(i0.u0.forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u0.press_at_upper_pos>=1)&&(i0.u0.forge_run>=1)))))] = FALSE
(forward)formula 17,1,0.493303,14004,1,0,18383,935,954,20585,447,2341,59537
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 18,1,0.524205,14796,1,0,19750,938,964,22296,449,2345,64095
Formula is TRUE !

***************************************

original formula: AG(EF(((i1.u2.table_load_angle>=1)&&(i1.u4.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.table_load_angle>=1)&&(i1.u4.TL_rot_run>=1)))))] = FALSE
(forward)formula 19,1,0.55253,15588,1,0,21247,938,970,23889,449,2348,68807
Formula is TRUE !

***************************************

original formula: AG(EF(((i1.u2.table_unload_angle>=1)&&(i1.u6.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.table_unload_angle>=1)&&(i1.u6.TU_rot_run>=1)))))] = FALSE
(forward)formula 20,1,0.585816,16380,1,0,23132,938,976,25598,449,2350,74602
Formula is TRUE !

***************************************

original formula: AG(EF(((u5.belt2_light_barrier_true>=1)&&(u5.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u5.belt2_light_barrier_true>=1)&&(u5.DB_trans_run>=1)))))] = FALSE
(forward)formula 21,1,0.629745,17172,1,0,24705,941,976,27497,449,2362,80178
Formula is TRUE !

***************************************

original formula: AG(EF(((u5.belt2_light_barrier_false>=1)&&(u5.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u5.belt2_light_barrier_false>=1)&&(u5.DB_deliver_run>=1)))))] = FALSE
(forward)formula 22,1,0.676374,17964,1,0,26233,944,981,29362,450,2366,85697
Formula is TRUE !

***************************************

original formula: AG(EF(((i1.u6.belt1_light_barrier_true>=1)&&(i1.u6.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u6.belt1_light_barrier_true>=1)&&(i1.u6.FB_trans_run>=1)))))] = FALSE
(forward)formula 23,1,0.710185,18756,1,0,28248,961,990,31383,451,2482,91723
Formula is TRUE !

***************************************

original formula: AG(EF(((i1.u6.belt1_light_barrier_false>=1)&&(i1.u6.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u6.belt1_light_barrier_false>=1)&&(i1.u6.FB_deliver_run>=1)))))] = FALSE
(forward)formula 24,1,0.739712,19548,1,0,29853,961,1000,32965,453,2482,96861
Formula is TRUE !

***************************************

original formula: AG(EF(((u7.A2U_in>=1)&&(u11.arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.A2U_in>=1)&&(u11.arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 25,1,0.753383,19812,1,0,30546,961,1002,33663,453,2482,98972
Formula is TRUE !

***************************************

original formula: AG(EF(((u7.A2U_in>=1)&&(u12.arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.A2U_in>=1)&&(u12.arm1_release_angle>=1)))))] = FALSE
(forward)formula 26,1,0.767182,20076,1,0,31178,961,1004,34368,453,2482,100945
Formula is TRUE !

***************************************

original formula: AG(EF(((u7.A2U_in>=1)&&(u8.arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.A2U_in>=1)&&(u8.arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 27,1,0.782529,20604,1,0,31725,961,1006,35093,453,2482,103000
Formula is TRUE !

***************************************

original formula: AG(EF(((u7.arm2_release_angle>=1)&&(u7.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.arm2_release_angle>=1)&&(u7.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 28,1,0.795292,20868,1,0,32241,961,1010,35694,454,2482,104839
Formula is TRUE !

***************************************

original formula: AG(EF(((u7.arm2_release_angle>=1)&&(u7.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.arm2_release_angle>=1)&&(u7.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 29,1,0.827493,21396,1,0,32720,961,1014,36286,455,2482,106432
Formula is TRUE !

***************************************

original formula: AG(EF(((u7.arm2_release_angle>=1)&&(u7.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.arm2_release_angle>=1)&&(u7.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 30,1,0.838002,21660,1,0,33336,961,1019,37110,456,2485,108636
Formula is TRUE !

***************************************

original formula: AG(EF(((u9.arm2_release_ext>=1)&&(u7.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_ext>=1)&&(u7.A2U_ext_run>=1)))))] = FALSE
(forward)formula 31,1,0.848403,21924,1,0,34014,961,1022,38008,456,2485,111069
Formula is TRUE !

***************************************

original formula: AG(EF(((u9.arm2_retract_ext>=1)&&(u9.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_retract_ext>=1)&&(u9.A2U_ret_run>=1)))))] = FALSE
(forward)formula 32,1,0.857066,22188,1,0,34520,961,1025,38724,456,2485,113030
Formula is TRUE !

***************************************

original formula: AG(EF(((u11.arm1_pick_up_angle>=1)&&(u8.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_pick_up_angle>=1)&&(u8.A2L_in>=1)))))] = FALSE
(forward)formula 33,1,0.866316,22452,1,0,35166,961,1028,39500,456,2485,115122
Formula is TRUE !

***************************************

original formula: AG(EF(((u12.arm1_release_angle>=1)&&(u8.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_angle>=1)&&(u8.A2L_in>=1)))))] = FALSE
(forward)formula 34,1,0.876407,22980,1,0,35909,964,1030,40399,456,2490,117504
Formula is TRUE !

***************************************

original formula: AG(EF(((u7.arm2_release_angle>=1)&&(u8.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.arm2_release_angle>=1)&&(u8.A2L_in>=1)))))] = FALSE
(forward)formula 35,1,0.883492,23244,1,0,36331,964,1032,40906,456,2496,119130
Formula is TRUE !

***************************************

original formula: AG(EF(((u8.arm2_pick_up_angle>=1)&&(u8.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_pick_up_angle>=1)&&(u8.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 36,1,0.890462,23508,1,0,36784,965,1035,41443,456,2504,120707
Formula is TRUE !

***************************************

original formula: AG(EF(((u8.arm2_pick_up_angle>=1)&&(u8.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_pick_up_angle>=1)&&(u8.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 37,1,0.899552,23772,1,0,37277,966,1038,42104,456,2510,122419
Formula is TRUE !

***************************************

original formula: AG(EF(((u8.arm2_pick_up_angle>=1)&&(u8.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_pick_up_angle>=1)&&(u8.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 38,1,0.906708,24300,1,0,37677,966,1040,42606,456,2513,123982
Formula is TRUE !

***************************************

original formula: AG(EF(((u9.arm2_pick_up_ext>=1)&&(u8.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_pick_up_ext>=1)&&(u8.A2L_ext_run>=1)))))] = FALSE
(forward)formula 39,1,0.915703,24300,1,0,38168,966,1042,43304,456,2513,125962
Formula is TRUE !

***************************************

original formula: AG(EF(((u9.arm2_retract_ext>=1)&&(u9.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_retract_ext>=1)&&(u9.A2L_ret_run>=1)))))] = FALSE
(forward)formula 40,1,0.925091,24564,1,0,38710,966,1046,44037,458,2513,127992
Formula is TRUE !

***************************************

original formula: AG(EF(((u12.arm1_release_angle>=1)&&(u11.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_angle>=1)&&(u11.A1L_in>=1)))))] = FALSE
(forward)formula 41,1,0.928601,24828,1,0,38823,966,1049,44190,458,2513,128592
Formula is TRUE !

***************************************

original formula: AG(EF(((u8.arm2_pick_up_angle>=1)&&(u11.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_pick_up_angle>=1)&&(u11.A1L_in>=1)))))] = FALSE
(forward)formula 42,1,0.932838,25092,1,0,39001,966,1051,44419,458,2513,129467
Formula is TRUE !

***************************************

original formula: AG(EF(((u7.arm2_release_angle>=1)&&(u11.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.arm2_release_angle>=1)&&(u11.A1L_in>=1)))))] = FALSE
(forward)formula 43,1,0.936878,25092,1,0,39180,966,1053,44651,458,2513,130335
Formula is TRUE !

***************************************

original formula: AG(EF(((u11.arm1_pick_up_angle>=1)&&(u11.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_pick_up_angle>=1)&&(u11.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 44,1,0.94166,25092,1,0,39324,966,1057,44928,459,2513,131103
Formula is TRUE !

***************************************

original formula: AG(EF(((u11.arm1_pick_up_angle>=1)&&(u11.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_pick_up_angle>=1)&&(u11.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 45,1,0.946079,25356,1,0,39488,966,1059,45173,459,2513,131949
Formula is TRUE !

***************************************

original formula: AG(EF(((u11.arm1_pick_up_angle>=1)&&(u11.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_pick_up_angle>=1)&&(u11.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 46,1,0.950302,25356,1,0,39652,966,1063,45416,461,2513,132794
Formula is TRUE !

***************************************

original formula: AG(EF(((u10.arm1_pick_up_ext>=1)&&(u11.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_ext>=1)&&(u11.A1L_ext_run>=1)))))] = FALSE
(forward)formula 47,1,0.955406,25620,1,0,39794,966,1065,45705,461,2513,133639
Formula is TRUE !

***************************************

original formula: AG(EF(((u10.arm1_retract_ext>=1)&&(u10.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_retract_ext>=1)&&(u10.A1L_ret_run>=1)))))] = FALSE
(forward)formula 48,1,0.961806,25884,1,0,39972,966,1067,46022,461,2513,134562
Formula is TRUE !

***************************************

original formula: AG(EF(((u11.arm1_pick_up_angle>=1)&&(u12.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_pick_up_angle>=1)&&(u12.A1U_in>=1)))))] = FALSE
(forward)formula 49,1,0.964706,25884,1,0,40087,966,1070,46161,461,2513,134942
Formula is TRUE !

***************************************

original formula: AG(EF(((u8.arm2_pick_up_angle>=1)&&(u12.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm2_pick_up_angle>=1)&&(u12.A1U_in>=1)))))] = FALSE
(forward)formula 50,1,0.967808,26148,1,0,40202,966,1072,46301,461,2513,135322
Formula is TRUE !

***************************************

original formula: AG(EF(((u7.arm2_release_angle>=1)&&(u12.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.arm2_release_angle>=1)&&(u12.A1U_in>=1)))))] = FALSE
(forward)formula 51,1,0.970267,26148,1,0,40308,966,1074,46412,461,2513,135692
Formula is TRUE !

***************************************

original formula: AG(EF(((u12.arm1_release_angle>=1)&&(u12.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_angle>=1)&&(u12.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 52,1,0.973688,26148,1,0,40461,966,1076,46647,461,2523,136101
Formula is TRUE !

***************************************

original formula: AG(EF(((u12.arm1_release_angle>=1)&&(u12.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_angle>=1)&&(u12.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 53,1,0.976972,26148,1,0,40601,966,1078,46850,461,2524,136510
Formula is TRUE !

***************************************

original formula: AG(EF(((u12.arm1_release_angle>=1)&&(u12.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_angle>=1)&&(u12.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 54,1,0.979963,26412,1,0,40725,966,1080,47014,461,2525,136917
Formula is TRUE !

***************************************

original formula: AG(EF(((u10.arm1_release_ext>=1)&&(u12.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_release_ext>=1)&&(u12.A1U_ext_run>=1)))))] = FALSE
(forward)formula 55,1,0.983535,26412,1,0,40826,966,1082,47219,461,2527,137375
Formula is TRUE !

***************************************

original formula: AG(EF(((u10.arm1_retract_ext>=1)&&(u10.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_retract_ext>=1)&&(u10.A1U_ret_run>=1)))))] = FALSE
(forward)formula 56,1,0.988329,26412,1,0,41078,966,1086,47543,463,2527,138138
Formula is TRUE !

***************************************

original formula: AG(EF(((i1.u3.table_bottom_pos>=1)&&(i1.u4.TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u3.table_bottom_pos>=1)&&(i1.u4.TL_lower_run>=1)))))] = FALSE
(forward)formula 57,1,1.00747,26940,1,0,42760,966,1092,49274,463,2527,143038
Formula is TRUE !

***************************************

Able to resolve query Liveness after proving 78 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1652992157048

--------------------
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-0"
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-0, 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-165277003100159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-0.tgz
mv ParamProductionCell-PT-0 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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;