Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r288-smll-167863554200244.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
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 r288-smll-167863554200244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 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 1678908158803

Running Version 202205111006
[2023-03-15 19:22:41] [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]
[2023-03-15 19:22:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 19:22:41] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2023-03-15 19:22:41] [INFO ] Transformed 231 places.
[2023-03-15 19:22:41] [INFO ] Transformed 202 transitions.
[2023-03-15 19:22:41] [INFO ] Found NUPN structural information;
[2023-03-15 19:22:41] [INFO ] Parsed PT model containing 231 places and 202 transitions in 500 ms.
Built sparse matrix representations for Structural reductions in 17 ms.11236KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 59 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 in DEADLOCKS mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 27 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:22:42] [INFO ] Computed 59 place invariants in 43 ms
[2023-03-15 19:22:42] [INFO ] Implicit Places using invariants in 581 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:22:42] [INFO ] Computed 59 place invariants in 11 ms
[2023-03-15 19:22:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:22:43] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2023-03-15 19:22:43] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:22:43] [INFO ] Computed 59 place invariants in 9 ms
[2023-03-15 19:22:43] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2215 ms (no deadlock found). (steps per millisecond=564 )
Random directed walk for 1250000 steps, including 0 resets, run took 2037 ms (no deadlock found). (steps per millisecond=613 )
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:22:47] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-15 19:22:48] [INFO ] [Real]Absence check using 35 positive place invariants in 75 ms returned sat
[2023-03-15 19:22:48] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 153 ms returned sat
[2023-03-15 19:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:22:50] [INFO ] [Real]Absence check using state equation in 1877 ms returned sat
[2023-03-15 19:22:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:22:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 27 ms returned sat
[2023-03-15 19:22:50] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 45 ms returned sat
[2023-03-15 19:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:22:51] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2023-03-15 19:22:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:22:51] [INFO ] [Nat]Added 68 Read/Feed constraints in 242 ms returned sat
[2023-03-15 19:22:51] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 5 ms to minimize.
[2023-03-15 19:22:52] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 2 ms to minimize.
[2023-03-15 19:22:52] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 3 ms to minimize.
[2023-03-15 19:22:52] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2023-03-15 19:22:52] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 1 ms to minimize.
[2023-03-15 19:22:52] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2023-03-15 19:22:52] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 0 ms to minimize.
[2023-03-15 19:22:53] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-03-15 19:22:53] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2023-03-15 19:22:53] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2023-03-15 19:22:53] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2023-03-15 19:22:53] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2023-03-15 19:22:53] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2023-03-15 19:22:53] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2023-03-15 19:22:53] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2023-03-15 19:22:54] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2023-03-15 19:22:54] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2023-03-15 19:22:54] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2023-03-15 19:22:54] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2023-03-15 19:22:54] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2955 ms
[2023-03-15 19:22:54] [INFO ] Computed and/alt/rep : 194/512/194 causal constraints (skipped 5 transitions) in 36 ms.
[2023-03-15 19:22:56] [INFO ] Added : 166 causal constraints over 34 iterations in 1419 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Parikh directed walk for 47500 steps, including 281 resets, run took 172 ms. (steps per millisecond=276 )
Random directed walk for 500001 steps, including 0 resets, run took 745 ms (no deadlock found). (steps per millisecond=671 )
Random walk for 500000 steps, including 0 resets, run took 941 ms (no deadlock found). (steps per millisecond=531 )
Random directed walk for 500000 steps, including 0 resets, run took 672 ms (no deadlock found). (steps per millisecond=744 )
Random walk for 500000 steps, including 0 resets, run took 935 ms (no deadlock found). (steps per millisecond=534 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 19 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:22:59] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-15 19:22:59] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:22:59] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-15 19:23:00] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:23:00] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2023-03-15 19:23:00] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:23:00] [INFO ] Computed 59 place invariants in 12 ms
[2023-03-15 19:23:00] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2755 ms (no deadlock found). (steps per millisecond=453 )
Random directed walk for 1250000 steps, including 0 resets, run took 2057 ms (no deadlock found). (steps per millisecond=607 )
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:23:05] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-15 19:23:05] [INFO ] [Real]Absence check using 35 positive place invariants in 73 ms returned sat
[2023-03-15 19:23:05] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 163 ms returned sat
[2023-03-15 19:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:23:07] [INFO ] [Real]Absence check using state equation in 1458 ms returned sat
[2023-03-15 19:23:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:23:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2023-03-15 19:23:07] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 28 ms returned sat
[2023-03-15 19:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:23:08] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2023-03-15 19:23:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:23:08] [INFO ] [Nat]Added 68 Read/Feed constraints in 144 ms returned sat
[2023-03-15 19:23:08] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-15 19:23:08] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-15 19:23:08] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2023-03-15 19:23:08] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-15 19:23:08] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2023-03-15 19:23:09] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2023-03-15 19:23:09] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2023-03-15 19:23:09] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2023-03-15 19:23:09] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2023-03-15 19:23:09] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2023-03-15 19:23:09] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2023-03-15 19:23:09] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-15 19:23:09] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2023-03-15 19:23:09] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2023-03-15 19:23:09] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2023-03-15 19:23:10] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2023-03-15 19:23:10] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-15 19:23:10] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2023-03-15 19:23:10] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2023-03-15 19:23:10] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2297 ms
[2023-03-15 19:23:10] [INFO ] Computed and/alt/rep : 194/512/194 causal constraints (skipped 5 transitions) in 22 ms.
[2023-03-15 19:23:12] [INFO ] Added : 166 causal constraints over 34 iterations in 1455 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
Parikh directed walk for 47500 steps, including 281 resets, run took 155 ms. (steps per millisecond=306 )
Random directed walk for 500001 steps, including 0 resets, run took 905 ms (no deadlock found). (steps per millisecond=552 )
Random walk for 500000 steps, including 0 resets, run took 838 ms (no deadlock found). (steps per millisecond=596 )
Random directed walk for 500000 steps, including 0 resets, run took 572 ms (no deadlock found). (steps per millisecond=874 )
Random walk for 500000 steps, including 0 resets, run took 744 ms (no deadlock found). (steps per millisecond=672 )
[2023-03-15 19:23:15] [INFO ] Flatten gal took : 125 ms
Starting structural reductions in LIVENESS mode, 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 3 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 89 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2023-03-15 19:23:15] [INFO ] Computed 59 place invariants in 11 ms
[2023-03-15 19:23:16] [INFO ] Implicit Places using invariants in 407 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 420 ms to find 39 implicit places.
Starting structural reductions in LIVENESS mode, 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 2 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 27 ms. Remains 84 /154 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 84 cols
[2023-03-15 19:23:16] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 19:23:16] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2023-03-15 19:23:16] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 19:23:16] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 19:23:16] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 84/231 places, 94/202 transitions.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
Initial state reduction rules removed 2 formulas.
Finished random walk after 2815 steps, including 0 resets, run visited all 92 properties in 374 ms. (steps per millisecond=7 )
Able to resolve query QuasiLiveness after proving 94 properties.
Starting structural reductions in LIVENESS mode, 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 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 38 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2023-03-15 19:23:17] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-15 19:23:17] [INFO ] Implicit Places using invariants in 325 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 335 ms to find 39 implicit places.
Starting structural reductions in LIVENESS mode, 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 1 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 27 ms. Remains 84 /154 variables (removed 70) and now considering 94/164 (removed 70) transitions.
// Phase 1: matrix 94 rows 84 cols
[2023-03-15 19:23:17] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-15 19:23:17] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2023-03-15 19:23:17] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-15 19:23:17] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 19:23:17] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 84/231 places, 94/202 transitions.
Finished structural reductions, in 2 iterations. Remains : 84/231 places, 94/202 transitions.
[2023-03-15 19:23:17] [INFO ] Flatten gal took : 19 ms
[2023-03-15 19:23:17] [INFO ] Flatten gal took : 13 ms
[2023-03-15 19:23:17] [INFO ] Time to serialize gal into /tmp/CTLFireability1402701646360758596.gal : 10 ms
[2023-03-15 19:23:17] [INFO ] Time to serialize properties into /tmp/CTLFireability11316350661571354859.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1402701646360758596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11316350661571354859.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.096718,7176,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...1684
(forward)formula 0,1,1.28799,38204,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.7603,51412,1,0,279,283879,210,162,2654,187971,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.2185,61444,1,0,331,361550,211,196,2654,246621,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.70238,73852,1,0,383,455807,212,230,2654,314338,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.85616,79132,1,0,437,492637,213,264,2654,342864,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.86843,79396,1,0,491,494089,214,297,2654,345919,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.87199,79660,1,0,545,494181,215,331,2654,346262,797
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 7,1,2.91069,80452,1,0,599,502319,216,364,2654,353324,883
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 8,1,2.93036,81244,1,0,653,506091,217,398,2654,356460,969
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 9,1,2.94779,81772,1,0,707,509008,218,432,2654,359412,1055
Formula is TRUE !
Detected timeout of ITS tools.
[2023-03-15 19:23:20] [INFO ] Flatten gal took : 11 ms
[2023-03-15 19:23:20] [INFO ] Applying decomposition
[2023-03-15 19:23:20] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5042496002436720306.txt' '-o' '/tmp/graph5042496002436720306.bin' '-w' '/tmp/graph5042496002436720306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5042496002436720306.bin' '-l' '-1' '-v' '-w' '/tmp/graph5042496002436720306.weights' '-q' '0' '-e' '0.001'
[2023-03-15 19:23:21] [INFO ] Decomposing Gal with order
[2023-03-15 19:23:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 19:23:21] [INFO ] Removed a total of 18 redundant transitions.
[2023-03-15 19:23:21] [INFO ] Flatten gal took : 97 ms
[2023-03-15 19:23:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-15 19:23:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10475336798850460255.gal : 9 ms
[2023-03-15 19:23:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11556699999833879339.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10475336798850460255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11556699999833879339.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 84 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.093681,6412,310,135,2967,413,340,2957,108,1252,0


Converting to forward existential form...Done !
original formula: AG(EF(((i2.u6.belt2_light_barrier_false>=1)&&(i2.u7.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_false>=1)&&(i2.u7.DB_trans_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions crane_lock_output_area_CU_lower_Pstart, A2U_ret_Cstop_A2U_ret_Pstop_arm2_unlock_output_area_a...1780
(forward)formula 0,1,0.257041,11020,1,0,14420,1081,1245,14305,530,2666,33783
Formula is TRUE !

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

original formula: AG(EF(((i2.u6.belt2_light_barrier_true>=1)&&(i2.u6.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_true>=1)&&(i2.u6.DB_deliver_run>=1)))))] = FALSE
(forward)formula 1,1,0.292927,12604,1,0,17916,1081,1254,18083,531,2666,43483
Formula is TRUE !

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

original formula: AG(EF(((i1.i2.u8.belt1_light_barrier_false>=1)&&(i1.i2.u9.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u8.belt1_light_barrier_false>=1)&&(i1.i2.u9.FB_trans_run>=1)))))] = FALSE
(forward)formula 2,1,0.406697,17092,1,0,29613,1089,1264,28351,531,2675,71515
Formula is TRUE !

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

original formula: AG(EF(((i1.i2.u8.belt1_light_barrier_true>=1)&&(i1.i2.u8.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u8.belt1_light_barrier_true>=1)&&(i1.i2.u8.FB_deliver_run>=1)))))] = FALS...156
(forward)formula 3,1,0.506492,21316,1,0,39816,1090,1277,37180,532,2679,97490
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u14.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u14.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 4,1,0.601171,24748,1,0,48958,1110,1280,44954,532,2757,120571
Formula is TRUE !

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

original formula: AG(EF(((u11.arm1_release_angle>=1)&&(u14.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_release_angle>=1)&&(u14.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 5,1,0.67666,26596,1,0,53493,1115,1283,49273,532,2799,132763
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u14.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u14.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 6,1,0.705526,27916,1,0,56083,1115,1286,52116,532,2836,140062
Formula is TRUE !

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

original formula: AG(EF(((i2.u13.arm2_retract_ext>=1)&&(u14.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u13.arm2_retract_ext>=1)&&(u14.A2U_ext_run>=1)))))] = FALSE
(forward)formula 7,1,0.740228,28444,1,0,57376,1115,1290,53805,532,2836,143666
Formula is TRUE !

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

original formula: AG(EF(((i2.u13.arm2_release_ext>=1)&&(i2.u13.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u13.arm2_release_ext>=1)&&(i2.u13.A2U_ret_run>=1)))))] = FALSE
(forward)formula 8,1,0.750523,28972,1,0,58011,1115,1300,54595,534,2836,146098
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 9,1,0.804422,31348,1,0,63721,1115,1303,60159,534,2842,161491
Formula is TRUE !

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

original formula: AG(EF(((u11.arm1_release_angle>=1)&&(u12.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_release_angle>=1)&&(u12.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 10,1,0.837409,32668,1,0,66508,1115,1306,63132,534,2846,169443
Formula is TRUE !

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

original formula: AG(EF(((u14.arm2_release_angle>=1)&&(u12.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm2_release_angle>=1)&&(u12.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 11,1,0.856389,33196,1,0,67683,1116,1309,64682,534,2849,173378
Formula is TRUE !

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

original formula: AG(EF(((i2.u13.arm2_retract_ext>=1)&&(u12.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u13.arm2_retract_ext>=1)&&(u12.A2L_ext_run>=1)))))] = FALSE
(forward)formula 12,1,0.876702,33988,1,0,69072,1119,1311,66441,534,2850,177371
Formula is TRUE !

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

original formula: AG(EF(((i2.u13.arm2_pick_up_ext>=1)&&(i2.u13.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u13.arm2_pick_up_ext>=1)&&(i2.u13.A2L_ret_run>=1)))))] = FALSE
(forward)formula 13,1,0.8933,34516,1,0,69797,1119,1320,67510,536,2850,179973
Formula is TRUE !

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

original formula: AG(EF(((u11.arm1_release_angle>=1)&&(u10.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_release_angle>=1)&&(u10.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 14,1,0.942209,36100,1,0,74134,1119,1323,71546,536,2851,191374
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u10.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u10.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 15,1,0.975096,37420,1,0,76844,1119,1326,74347,536,2852,199203
Formula is TRUE !

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

original formula: AG(EF(((u14.arm2_release_angle>=1)&&(u10.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm2_release_angle>=1)&&(u10.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 16,1,1.00963,39004,1,0,79949,1119,1329,77256,536,2854,208688
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_retract_ext>=1)&&(u10.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_retract_ext>=1)&&(u10.A1L_ext_run>=1)))))] = FALSE
(forward)formula 17,1,1.05537,40060,1,0,81895,1121,1332,79371,536,2855,214235
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_pick_up_ext>=1)&&(u15.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_pick_up_ext>=1)&&(u15.A1L_ret_run>=1)))))] = FALSE
(forward)formula 18,1,1.06772,40324,1,0,82511,1125,1336,80270,536,2856,216628
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u11.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u11.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 19,1,1.08875,41116,1,0,84233,1125,1339,82259,536,2857,221915
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u11.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u11.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 20,1,1.11838,42172,1,0,86671,1125,1342,85006,536,2861,229034
Formula is TRUE !

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

original formula: AG(EF(((u14.arm2_release_angle>=1)&&(u11.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm2_release_angle>=1)&&(u11.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 21,1,1.1434,43228,1,0,88920,1125,1345,87553,536,2861,235698
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_retract_ext>=1)&&(u11.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_retract_ext>=1)&&(u11.A1U_ext_run>=1)))))] = FALSE
(forward)formula 22,1,1.16356,44020,1,0,90601,1140,1347,89448,536,2886,240358
Formula is TRUE !

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

original formula: AG(EF(((u15.arm1_release_ext>=1)&&(u15.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u15.arm1_release_ext>=1)&&(u15.A1U_ret_run>=1)))))] = FALSE
(forward)formula 23,1,1.17619,44284,1,0,91170,1143,1353,90198,538,2887,242500
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_release_height>=1)&&(i8.u16.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_release_height>=1)&&(i8.u16.CU_lift_run>=1)))))] = FALSE
(forward)formula 24,1,1.28079,48508,1,0,101599,1147,1365,99199,539,2913,267675
Formula is TRUE !

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

original formula: AG(EF(((i8.u17.crane_above_feed_belt>=1)&&(i8.u16.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u17.crane_above_feed_belt>=1)&&(i8.u16.CU_trans_run>=1)))))] = FALSE
(forward)formula 25,1,1.46157,52468,1,0,111546,1147,1370,107759,539,2913,291406
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_transport_height>=1)&&(i8.u16.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_transport_height>=1)&&(i8.u16.CU_lower_run>=1)))))] = FALSE
(forward)formula 26,1,1.56341,56692,1,0,122257,1151,1381,117057,541,2933,316674
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_transport_height>=1)&&(i8.u18.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_transport_height>=1)&&(i8.u18.CL_lower_run>=1)))))] = FALSE
(forward)formula 27,1,1.64176,59860,1,0,130092,1151,1386,124227,541,2933,336248
Formula is TRUE !

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

original formula: AG(EF(((i8.u17.crane_above_deposit_belt>=1)&&(i8.u16.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u17.crane_above_deposit_belt>=1)&&(i8.u16.CL_trans_run>=1)))))] = FALSE
(forward)formula 28,1,1.71622,62764,1,0,137236,1151,1390,130601,541,2933,354843
Formula is TRUE !

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

original formula: AG(EF(((i8.u16.crane_pick_up_height>=1)&&(i8.u16.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_pick_up_height>=1)&&(i8.u16.CL_lift_run>=1)))))] = FALSE
(forward)formula 29,1,1.79801,65668,1,0,144554,1173,1398,137296,542,2986,374193
Formula is TRUE !

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

original formula: AG(EF(((i2.u7.ch_DC_free>=1)&&(i2.u7.ch_A2D_full>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u7.ch_DC_free>=1)&&(i2.u7.ch_A2D_full>=1)))))] = FALSE
(forward)formula 30,1,1.83421,66988,1,0,147480,1173,1404,140264,542,2986,382291
Formula is TRUE !

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

original formula: AG(EF((((i2.u6.ch_A2D_free>=1)&&(u15.swivel>=1))&&(i2.u13.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i2.u6.ch_A2D_free>=1)&&(u15.swivel>=1))&&(i2.u13.arm2_storing>=1)))))] = FALSE
(forward)formula 31,1,1.84266,67252,1,0,147946,1173,1415,140751,542,2986,384017
Formula is TRUE !

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

original formula: AG(EF((((i0.u0.ch_A1P_free>=1)&&(u15.swivel>=1))&&(u15.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u0.ch_A1P_free>=1)&&(u15.swivel>=1))&&(u15.arm1_storing>=1)))))] = FALSE
(forward)formula 32,1,1.85134,67516,1,0,148355,1173,1423,141288,544,2986,385509
Formula is TRUE !

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

original formula: AG(EF(((i1.i2.u8.ch_CF_free>=1)&&(i8.u16.crane_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u8.ch_CF_free>=1)&&(i8.u16.crane_storing>=1)))))] = FALSE
(forward)formula 33,1,1.95262,71212,1,0,158104,1173,1428,149566,544,2986,408460
Formula is TRUE !

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

original formula: AG(EF(((i8.u18.ch_DC_full>=1)&&(i8.u18.crane_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u18.ch_DC_full>=1)&&(i8.u18.crane_store_free>=1)))))] = FALSE
(forward)formula 34,1,2.07882,75172,1,0,165000,1173,1434,155732,544,2986,425699
Formula is TRUE !

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

original formula: AG(EF((((u15.swivel>=1)&&(i1.i1.u5.TU_lift_rs>=1))&&(u15.arm1_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u15.swivel>=1)&&(i1.i1.u5.TU_lift_rs>=1))&&(u15.arm1_store_free>=1)))))] = FAL...157
(forward)formula 35,1,2.09225,75436,1,0,165775,1173,1444,156602,546,2986,428599
Formula is TRUE !

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

original formula: AG(EF(((i1.i2.u9.ch_CF_full>=1)&&(i1.i2.u9.TL_lower_rs>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u9.ch_CF_full>=1)&&(i1.i2.u9.TL_lower_rs>=1)))))] = FALSE
(forward)formula 36,1,2.18792,78604,1,0,175633,1173,1456,164909,548,2986,452563
Formula is TRUE !

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

original formula: AG(EF((((u15.swivel>=1)&&(i0.u1.PU_lower_rs>=1))&&(i2.u13.arm2_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u15.swivel>=1)&&(i0.u1.PU_lower_rs>=1))&&(i2.u13.arm2_store_free>=1)))))] = FA...158
(forward)formula 37,1,2.20469,79132,1,0,176713,1173,1463,166141,548,2986,456153
Formula is TRUE !

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

original formula: AG(EF(((i0.u1.press_at_upper_pos>=1)&&(i0.u1.forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u1.press_at_upper_pos>=1)&&(i0.u1.forge_run>=1)))))] = FALSE
(forward)formula 38,1,2.24242,80716,1,0,180206,1174,1471,169592,548,3000,464927
Formula is TRUE !

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

original formula: AG(EF(((i0.u0.press_at_middle_pos>=1)&&(i0.u0.PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u0.press_at_middle_pos>=1)&&(i0.u0.PL_lower_run>=1)))))] = FALSE
(forward)formula 39,1,2.28125,82036,1,0,183646,1175,1475,173051,548,3000,474023
Formula is TRUE !

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

original formula: AG(EF(((i1.i0.u2.table_load_angle>=1)&&(i1.i0.u4.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i0.u2.table_load_angle>=1)&&(i1.i0.u4.TL_rot_run>=1)))))] = FALSE
(forward)formula 40,1,2.36161,85204,1,0,191684,1175,1481,180145,548,3000,493001
Formula is TRUE !

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

original formula: AG(EF(((i1.i0.u2.table_unload_angle>=1)&&(i1.i1.u5.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i0.u2.table_unload_angle>=1)&&(i1.i1.u5.TU_rot_run>=1)))))] = FALSE
(forward)formula 41,1,2.45772,88900,1,0,201361,1175,1487,188228,548,3000,517264
Formula is TRUE !

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

original formula: AG(EF(((i2.u6.belt2_light_barrier_true>=1)&&(i2.u7.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_true>=1)&&(i2.u7.DB_trans_run>=1)))))] = FALSE
(forward)formula 42,1,2.50231,90484,1,0,204861,1175,1491,191979,548,3000,526957
Formula is TRUE !

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

original formula: AG(EF(((i2.u6.belt2_light_barrier_false>=1)&&(i2.u6.DB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_false>=1)&&(i2.u6.DB_deliver_run>=1)))))] = FALSE
(forward)formula 43,1,2.5443,92068,1,0,208228,1175,1497,195237,549,3000,536373
Formula is TRUE !

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

original formula: AG(EF(((i1.i2.u8.belt1_light_barrier_true>=1)&&(i1.i2.u9.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i2.u8.belt1_light_barrier_true>=1)&&(i1.i2.u9.FB_trans_run>=1)))))] = FALSE
(forward)formula 44,1,2.75148,96028,1,0,218153,1175,1503,203684,549,3000,562525
Formula is TRUE !

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

original formula: AG(EF(((u14.A2U_in>=1)&&(u10.arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.A2U_in>=1)&&(u10.arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 45,1,2.75596,96292,1,0,218302,1175,1506,203892,549,3000,563114
Formula is TRUE !

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

original formula: AG(EF(((u14.A2U_in>=1)&&(u11.arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.A2U_in>=1)&&(u11.arm1_release_angle>=1)))))] = FALSE
(forward)formula 46,1,2.75996,96556,1,0,218434,1175,1508,204068,549,3000,563610
Formula is TRUE !

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

original formula: AG(EF(((u14.A2U_in>=1)&&(u12.arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.A2U_in>=1)&&(u12.arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 47,1,2.76462,96820,1,0,218567,1175,1510,204285,549,3000,564106
Formula is TRUE !

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

original formula: AG(EF(((u14.arm2_release_angle>=1)&&(u14.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm2_release_angle>=1)&&(u14.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 48,1,2.76987,96820,1,0,218790,1175,1514,204652,550,3000,564664
Formula is TRUE !

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

original formula: AG(EF(((u14.arm2_release_angle>=1)&&(u14.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm2_release_angle>=1)&&(u14.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 49,1,2.77472,96820,1,0,218992,1175,1518,204963,551,3000,565193
Formula is TRUE !

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

original formula: AG(EF(((u14.arm2_release_angle>=1)&&(u14.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm2_release_angle>=1)&&(u14.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 50,1,2.78011,97084,1,0,219224,1175,1522,205384,553,3000,565693
Formula is TRUE !

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

original formula: AG(EF(((i2.u13.arm2_release_ext>=1)&&(u14.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u13.arm2_release_ext>=1)&&(u14.A2U_ext_run>=1)))))] = FALSE
(forward)formula 51,1,2.78534,97084,1,0,219333,1175,1524,205677,553,3000,566206
Formula is TRUE !

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

original formula: AG(EF(((i2.u13.arm2_retract_ext>=1)&&(i2.u13.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u13.arm2_retract_ext>=1)&&(i2.u13.A2U_ret_run>=1)))))] = FALSE
(forward)formula 52,1,2.79514,97348,1,0,219860,1175,1528,206346,553,3000,568185
Formula is TRUE !

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

original formula: AG(EF(((u10.arm1_pick_up_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_pick_up_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 53,1,2.80722,97612,1,0,220421,1175,1531,207053,553,3000,570298
Formula is TRUE !

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

original formula: AG(EF(((u11.arm1_release_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_release_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 54,1,2.81568,97876,1,0,220838,1175,1533,207544,553,3000,571862
Formula is TRUE !

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

original formula: AG(EF(((u14.arm2_release_angle>=1)&&(u12.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm2_release_angle>=1)&&(u12.A2L_in>=1)))))] = FALSE
(forward)formula 55,1,2.82346,98140,1,0,221238,1175,1535,207997,553,3000,573422
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 56,1,2.83523,98404,1,0,221772,1175,1537,208738,553,3000,575406
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 57,1,2.84641,98668,1,0,222327,1175,1539,209495,553,3000,577297
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u12.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 58,1,2.92949,99196,1,0,222967,1175,1541,210481,553,3000,579488
Formula is TRUE !

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

original formula: AG(EF(((i2.u13.arm2_pick_up_ext>=1)&&(u12.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u13.arm2_pick_up_ext>=1)&&(u12.A2L_ext_run>=1)))))] = FALSE
(forward)formula 59,1,2.9415,99724,1,0,223507,1175,1543,211274,553,3000,581557
Formula is TRUE !

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

original formula: AG(EF(((i2.u13.arm2_retract_ext>=1)&&(i2.u13.A2L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u13.arm2_retract_ext>=1)&&(i2.u13.A2L_ret_run>=1)))))] = FALSE
(forward)formula 60,1,2.95327,99988,1,0,224118,1175,1547,212132,553,3000,583767
Formula is TRUE !

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

original formula: AG(EF(((u11.arm1_release_angle>=1)&&(u10.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm1_release_angle>=1)&&(u10.A1L_in>=1)))))] = FALSE
(forward)formula 61,1,2.96297,100516,1,0,224582,1175,1550,212703,553,3000,585634
Formula is TRUE !

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

original formula: AG(EF(((u12.arm2_pick_up_angle>=1)&&(u10.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_angle>=1)&&(u10.A1L_in>=1)))))] = FALSE
(forward)formula 62,1,2.97259,100780,1,0,225050,1175,1552,213305,553,3000,587478
Formula is TRUE !

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

original formula: AG(EF(((u14.arm2_release_angle>=1)&&(u10.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm2_release_angle>=1)&&(u10.A1L_in>=1)))))] = FALSE
(forward)formula 63,1,2.97948,101044,1,0,225461,1175,1554,213707,553,3000,589077
Formula is TRUE !
Detected timeout of ITS tools.
[2023-03-15 19:23:24] [INFO ] Flatten gal took : 9 ms
[2023-03-15 19:23:24] [INFO ] Flatten gal took : 8 ms
[2023-03-15 19:23:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4406600820594887460.gal : 2 ms
[2023-03-15 19:23:24] [INFO ] Time to serialize properties into /tmp/CTLFireability364637863066065476.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4406600820594887460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability364637863066065476.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 20 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.078808,6672,2,1815,5,9797,6,0,433,8324,0


Converting to forward existential form...Done !
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
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...1684
(forward)formula 0,1,1.4668,41068,1,0,264,228020,209,145,2654,150120,321
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 1,1,2.10914,57040,1,0,339,328936,210,188,2654,224961,432
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 2,1,2.65526,69712,1,0,405,422875,211,225,2654,295034,528
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 3,1,2.9435,77632,1,0,470,473497,212,258,2654,333854,614
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 4,1,3.06384,80536,1,0,528,491932,213,288,2654,349377,694
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 5,1,3.5132,94224,1,0,596,576545,214,329,2654,415871,800
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 6,1,4.40715,113692,1,0,688,690124,215,386,2654,502608,946
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 7,1,4.8989,125572,1,0,771,789136,216,437,2654,578089,1077
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 8,1,5.55526,135868,1,0,827,856683,217,470,2654,633106,1163
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 9,1,5.75556,141412,1,0,883,896388,218,503,2654,665337,1249
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 10,1,6.11365,151972,1,0,939,966860,219,536,2654,721125,1335
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 11,1,6.57416,166088,1,0,995,1.05164e+06,220,569,2654,786087,1421
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 12,1,6.92587,174800,1,0,1049,1.11273e+06,221,601,2654,838230,1502
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 13,1,7.28333,178496,1,0,1102,1.1376e+06,222,633,2654,857829,1584
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 14,1,7.31141,179288,1,0,1156,1.14185e+06,223,666,2654,863037,1670
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 15,1,7.35832,180344,1,0,1210,1.1496e+06,224,699,2654,870485,1756
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 16,1,7.58588,186944,1,0,1263,1.19297e+06,225,732,2654,903877,1842
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 17,1,7.64814,188264,1,0,1316,1.2031e+06,226,765,2654,913716,1928
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 18,1,7.70577,191628,1,0,1368,1.2126e+06,227,797,2654,922259,2010
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 19,1,7.78967,193740,1,0,1423,1.22798e+06,228,829,2654,934647,2092
Formula is TRUE !

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

Able to resolve query Liveness after proving 94 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 50733 ms.

BK_STOP 1678908212209

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="gold2022"
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-5348"
echo " Executing tool gold2022"
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 r288-smll-167863554200244"
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 '' 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 ;