fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r288-smll-167863554200239
Last Updated
May 14, 2023

About the Execution of 2022-gold for ParamProductionCell-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1272.312 37547.00 56379.00 236.30 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r288-smll-167863554200239.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-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r288-smll-167863554200239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 8.4K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.1K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 18K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 17:17 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 1678908073465

Running Version 202205111006
[2023-03-15 19:21:15] [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:21:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 19:21:15] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2023-03-15 19:21:15] [INFO ] Transformed 231 places.
[2023-03-15 19:21:15] [INFO ] Transformed 202 transitions.
[2023-03-15 19:21:15] [INFO ] Found NUPN structural information;
[2023-03-15 19:21:15] [INFO ] Parsed PT model containing 231 places and 202 transitions in 390 ms.
Built sparse matrix representations for Structural reductions in 14 ms.13606KB 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 50 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 33 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:21:16] [INFO ] Computed 59 place invariants in 48 ms
[2023-03-15 19:21:16] [INFO ] Implicit Places using invariants in 537 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:21:16] [INFO ] Computed 59 place invariants in 9 ms
[2023-03-15 19:21:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:21:17] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
[2023-03-15 19:21:17] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:21:17] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-15 19:21:17] [INFO ] Dead Transitions using invariants and state equation in 511 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 2251 ms (no deadlock found). (steps per millisecond=555 )
Random directed walk for 1250002 steps, including 0 resets, run took 1643 ms (no deadlock found). (steps per millisecond=760 )
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:21:21] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-15 19:21:21] [INFO ] [Real]Absence check using 35 positive place invariants in 60 ms returned sat
[2023-03-15 19:21:21] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 162 ms returned sat
[2023-03-15 19:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:21:22] [INFO ] [Real]Absence check using state equation in 1120 ms returned sat
[2023-03-15 19:21:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:21:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2023-03-15 19:21:23] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 34 ms returned sat
[2023-03-15 19:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:21:24] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-15 19:21:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:21:24] [INFO ] [Nat]Added 68 Read/Feed constraints in 37 ms returned sat
[2023-03-15 19:21:24] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 25 ms to minimize.
[2023-03-15 19:21:24] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 12 ms to minimize.
[2023-03-15 19:21:24] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2023-03-15 19:21:24] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2023-03-15 19:21:25] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-15 19:21:25] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2023-03-15 19:21:25] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 1 ms to minimize.
[2023-03-15 19:21:25] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-15 19:21:25] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2023-03-15 19:21:25] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 0 ms to minimize.
[2023-03-15 19:21:25] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2023-03-15 19:21:26] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2023-03-15 19:21:26] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2023-03-15 19:21:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1997 ms
[2023-03-15 19:21:26] [INFO ] Computed and/alt/rep : 195/512/195 causal constraints (skipped 5 transitions) in 28 ms.
[2023-03-15 19:21:27] [INFO ] Added : 170 causal constraints over 34 iterations in 1093 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Parikh directed walk for 34700 steps, including 615 resets, run took 114 ms. (steps per millisecond=304 )
Random directed walk for 500002 steps, including 0 resets, run took 610 ms (no deadlock found). (steps per millisecond=819 )
Random walk for 500000 steps, including 0 resets, run took 765 ms (no deadlock found). (steps per millisecond=653 )
Random directed walk for 500000 steps, including 0 resets, run took 588 ms (no deadlock found). (steps per millisecond=850 )
Random walk for 500000 steps, including 0 resets, run took 765 ms (no deadlock found). (steps per millisecond=653 )
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 12 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:21:30] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-15 19:21:30] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:21:30] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-15 19:21:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:21:30] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2023-03-15 19:21:30] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:21:30] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-15 19:21:31] [INFO ] Dead Transitions using invariants and state equation in 408 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 1991 ms (no deadlock found). (steps per millisecond=627 )
Random directed walk for 1250002 steps, including 0 resets, run took 1528 ms (no deadlock found). (steps per millisecond=818 )
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:21:34] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-15 19:21:35] [INFO ] [Real]Absence check using 35 positive place invariants in 72 ms returned sat
[2023-03-15 19:21:35] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 168 ms returned sat
[2023-03-15 19:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:21:36] [INFO ] [Real]Absence check using state equation in 1099 ms returned sat
[2023-03-15 19:21:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:21:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2023-03-15 19:21:36] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 32 ms returned sat
[2023-03-15 19:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:21:37] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-15 19:21:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:21:37] [INFO ] [Nat]Added 68 Read/Feed constraints in 36 ms returned sat
[2023-03-15 19:21:37] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2023-03-15 19:21:37] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2023-03-15 19:21:37] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2023-03-15 19:21:37] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 13 ms to minimize.
[2023-03-15 19:21:38] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-15 19:21:38] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 0 ms to minimize.
[2023-03-15 19:21:38] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 1 ms to minimize.
[2023-03-15 19:21:38] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-15 19:21:38] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2023-03-15 19:21:38] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2023-03-15 19:21:38] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2023-03-15 19:21:39] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 0 ms to minimize.
[2023-03-15 19:21:39] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 0 ms to minimize.
[2023-03-15 19:21:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1894 ms
[2023-03-15 19:21:39] [INFO ] Computed and/alt/rep : 195/512/195 causal constraints (skipped 5 transitions) in 18 ms.
[2023-03-15 19:21:40] [INFO ] Added : 170 causal constraints over 34 iterations in 1074 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Parikh directed walk for 34700 steps, including 614 resets, run took 88 ms. (steps per millisecond=394 )
Random directed walk for 500001 steps, including 0 resets, run took 738 ms (no deadlock found). (steps per millisecond=677 )
Random walk for 500000 steps, including 0 resets, run took 770 ms (no deadlock found). (steps per millisecond=649 )
Random directed walk for 500000 steps, including 0 resets, run took 599 ms (no deadlock found). (steps per millisecond=834 )
Random walk for 500000 steps, including 0 resets, run took 764 ms (no deadlock found). (steps per millisecond=654 )
[2023-03-15 19:21:43] [INFO ] Flatten gal took : 108 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 4 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 60 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:21:43] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-15 19:21:44] [INFO ] Implicit Places using invariants in 373 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 376 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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 42 place count 133 transition count 139
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 129 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 127 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 127 transition count 137
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 140 place count 84 transition count 94
Applied a total of 140 rules in 25 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:21:44] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 19:21:44] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2023-03-15 19:21:44] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 19:21:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:21:44] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 431 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 2531 steps, including 0 resets, run visited all 92 properties in 276 ms. (steps per millisecond=9 )
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 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
Applied a total of 76 rules in 19 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:21:44] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-15 19:21:45] [INFO ] Implicit Places using invariants in 251 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 254 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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 42 place count 133 transition count 139
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 129 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 127 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 127 transition count 137
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 140 place count 84 transition count 94
Applied a total of 140 rules in 12 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:21:45] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 19:21:45] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 94 rows 84 cols
[2023-03-15 19:21:45] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-15 19:21:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:21:45] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 270 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:21:45] [INFO ] Flatten gal took : 16 ms
[2023-03-15 19:21:45] [INFO ] Flatten gal took : 14 ms
[2023-03-15 19:21:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17506143731583635564.gal : 27 ms
[2023-03-15 19:21:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17344559885690485276.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/CTLFireability17506143731583635564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17344559885690485276.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...276
No direction supplied, using forward translation only.
Parsed 94 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8382,0.135971,8420,2,2656,5,16101,6,0,433,13479,0


Converting to forward existential form...Done !
original formula: AG(EF(((press_at_lower_pos>=1)&&(PU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_lower_pos>=1)&&(PU_lower_run>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions deposit_belt_lock_input_area.deposit_belt_lock_output_area.DB_trans_Pstart, feed_belt_lock_in...1645
(forward)formula 0,1,1.31175,42488,1,0,227,172593,209,129,2644,113265,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.35876,44072,1,0,279,181980,210,162,2644,120606,367
Formula is TRUE !

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

original formula: AG(EF(((press_at_middle_pos>=1)&&(forge_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_middle_pos>=1)&&(forge_run>=1)))))] = FALSE
(forward)formula 2,1,1.41721,45656,1,0,331,193100,211,196,2644,130086,453
Formula is TRUE !

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

original formula: AG(EF(((press_at_lower_pos>=1)&&(PL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((press_at_lower_pos>=1)&&(PL_lower_run>=1)))))] = FALSE
(forward)formula 3,1,1.64582,51464,1,0,383,234670,212,230,2644,162936,539
Formula is TRUE !

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

original formula: AG(EF(((table_unload_angle>=1)&&(TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_unload_angle>=1)&&(TL_rot_run>=1)))))] = FALSE
(forward)formula 4,1,1.8497,57636,1,0,437,271739,213,264,2644,191848,625
Formula is TRUE !

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

original formula: AG(EF(((table_top_pos>=1)&&(TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_top_pos>=1)&&(TL_lower_run>=1)))))] = FALSE
(forward)formula 5,1,1.85992,58164,1,0,491,271949,214,298,2644,194060,711
Formula is TRUE !

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

original formula: AG(EF(((table_top_pos>=1)&&(TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_top_pos>=1)&&(TU_lift_run>=1)))))] = FALSE
(forward)formula 6,1,2.03866,61068,1,0,545,292340,215,331,2644,209751,797
Formula is TRUE !

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

original formula: AG(EF(((table_bottom_pos>=1)&&(TU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_bottom_pos>=1)&&(TU_lift_run>=1)))))] = FALSE
(forward)formula 7,1,2.07159,61860,1,0,599,297138,216,365,2644,213329,883
Formula is TRUE !

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

original formula: AG(EF(((table_load_angle>=1)&&(TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((table_load_angle>=1)&&(TU_rot_run>=1)))))] = FALSE
(forward)formula 8,1,2.08899,62388,1,0,653,299364,217,399,2644,216058,969
Formula is TRUE !

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

original formula: AG(EF(((belt2_light_barrier_false>=1)&&(DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((belt2_light_barrier_false>=1)&&(DB_trans_run>=1)))))] = FALSE
(forward)formula 9,1,2.5433,74796,1,0,706,380135,218,433,2644,273459,1055
Formula is TRUE !
Detected timeout of ITS tools.
[2023-03-15 19:21:48] [INFO ] Flatten gal took : 14 ms
[2023-03-15 19:21:48] [INFO ] Applying decomposition
[2023-03-15 19:21:48] [INFO ] Flatten gal took : 13 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/graph17865585679532135708.txt' '-o' '/tmp/graph17865585679532135708.bin' '-w' '/tmp/graph17865585679532135708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17865585679532135708.bin' '-l' '-1' '-v' '-w' '/tmp/graph17865585679532135708.weights' '-q' '0' '-e' '0.001'
[2023-03-15 19:21:48] [INFO ] Decomposing Gal with order
[2023-03-15 19:21:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 19:21:48] [INFO ] Removed a total of 18 redundant transitions.
[2023-03-15 19:21:48] [INFO ] Flatten gal took : 70 ms
[2023-03-15 19:21:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-15 19:21:48] [INFO ] Time to serialize gal into /tmp/CTLFireability4083059093635379790.gal : 6 ms
[2023-03-15 19:21:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15030549115263500999.ctl : 3 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/CTLFireability4083059093635379790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15030549115263500999.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...254
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,8382,0.056828,5868,260,114,1954,403,336,1944,109,1237,0


Converting to forward existential form...Done !
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
Reverse transition relation is NOT exact ! Due to transitions crane_lock_input_area_CL_lower_Pstart, FB_deliver_Cstop_FB_deliver_Pstop_feed_belt_unlock_inp...1728
(forward)formula 0,1,0.153051,9360,1,0,9710,967,1216,9938,500,2577,27692
Formula is TRUE !

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

original formula: AG(EF(((i1.u7.belt1_light_barrier_false>=1)&&(i1.u7.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u7.belt1_light_barrier_false>=1)&&(i1.u7.FB_trans_run>=1)))))] = FALSE
(forward)formula 1,1,0.205908,11736,1,0,15536,972,1226,15209,501,2632,44382
Formula is TRUE !

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

original formula: AG(EF(((i1.u7.belt1_light_barrier_true>=1)&&(i1.u7.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u7.belt1_light_barrier_true>=1)&&(i1.u7.FB_deliver_run>=1)))))] = FALSE
(forward)formula 2,1,0.254743,13584,1,0,20265,978,1236,19630,503,2637,59828
Formula is TRUE !

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

original formula: AG(EF(((u8.arm1_pick_up_angle>=1)&&(u10.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm1_pick_up_angle>=1)&&(u10.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 3,1,0.306722,15696,1,0,25570,981,1239,24438,503,2652,75584
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u10.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u10.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 4,1,0.354758,17016,1,0,28668,997,1242,27520,503,2680,85234
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u10.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u10.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 5,1,0.370502,17544,1,0,29701,997,1246,28869,503,2680,88801
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_retract_ext>=1)&&(u10.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_retract_ext>=1)&&(u10.A2U_ext_run>=1)))))] = FALSE
(forward)formula 6,1,0.385257,18072,1,0,30538,997,1248,30107,503,2684,91378
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_ext>=1)&&(u9.A2U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_ext>=1)&&(u9.A2U_ret_run>=1)))))] = FALSE
(forward)formula 7,1,0.399983,18600,1,0,31316,999,1253,31161,505,2685,94117
Formula is TRUE !

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

original formula: AG(EF(((u8.arm1_pick_up_angle>=1)&&(u11.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm1_pick_up_angle>=1)&&(u11.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 8,1,0.423161,19392,1,0,32886,999,1256,33077,505,2685,99906
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u11.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u11.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 9,1,0.440156,20184,1,0,34029,999,1259,34647,505,2687,103558
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u11.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u11.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 10,1,0.463926,20712,1,0,34547,999,1262,35422,505,2687,105529
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_retract_ext>=1)&&(u11.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_retract_ext>=1)&&(u11.A2L_ext_run>=1)))))] = FALSE
(forward)formula 11,1,0.473736,20976,1,0,35212,999,1264,36368,505,2687,107772
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 12,1,0.484412,21240,1,0,35894,1001,1268,37295,507,2688,110261
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u8.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u8.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 13,1,0.497412,21768,1,0,36868,1001,1271,38472,507,2688,113811
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u8.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u8.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 14,1,0.505301,22296,1,0,37282,1001,1274,39061,507,2688,115643
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u8.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u8.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 15,1,0.520227,22560,1,0,38704,1001,1277,40606,507,2689,120367
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_retract_ext>=1)&&(u8.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_retract_ext>=1)&&(u8.A1L_ext_run>=1)))))] = FALSE
(forward)formula 16,1,0.533821,23352,1,0,39643,1001,1280,41898,507,2692,123601
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_pick_up_ext>=1)&&(u12.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_ext>=1)&&(u12.A1L_ret_run>=1)))))] = FALSE
(forward)formula 17,1,0.544969,23616,1,0,40274,1002,1284,42775,507,2692,126108
Formula is TRUE !

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

original formula: AG(EF(((u8.arm1_pick_up_angle>=1)&&(u13.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm1_pick_up_angle>=1)&&(u13.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 18,1,0.559429,24144,1,0,41188,1003,1287,43992,507,2717,129438
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u13.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u13.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 19,1,0.567651,24672,1,0,41601,1003,1290,44538,507,2735,131027
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u13.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u13.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 20,1,0.583284,24936,1,0,42609,1004,1293,45930,507,2745,134662
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_retract_ext>=1)&&(u13.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_retract_ext>=1)&&(u13.A1U_ext_run>=1)))))] = FALSE
(forward)formula 21,1,0.597499,25464,1,0,43482,1020,1295,47223,507,2766,137500
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_release_ext>=1)&&(u12.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_ext>=1)&&(u12.A1U_ret_run>=1)))))] = FALSE
(forward)formula 22,1,0.605608,25728,1,0,43927,1020,1301,47783,509,2766,139285
Formula is TRUE !

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

original formula: AG(EF(((i9.u14.crane_release_height>=1)&&(i9.u14.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u14.crane_release_height>=1)&&(i9.u14.CU_lift_run>=1)))))] = FALSE
(forward)formula 23,1,0.653507,27840,1,0,49099,1020,1309,52419,510,2767,153947
Formula is TRUE !

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

original formula: AG(EF(((i9.u15.crane_above_feed_belt>=1)&&(i9.u14.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u15.crane_above_feed_belt>=1)&&(i9.u14.CU_trans_run>=1)))))] = FALSE
(forward)formula 24,1,0.73233,29688,1,0,54194,1020,1315,56971,510,2772,168272
Formula is TRUE !

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

original formula: AG(EF(((i9.u14.crane_transport_height>=1)&&(i9.u16.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u14.crane_transport_height>=1)&&(i9.u16.CU_lower_run>=1)))))] = FALSE
(forward)formula 25,1,0.776441,31800,1,0,59497,1023,1321,61687,510,2773,182931
Formula is TRUE !

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

original formula: AG(EF(((i9.u14.crane_transport_height>=1)&&(i9.u17.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u14.crane_transport_height>=1)&&(i9.u17.CL_lower_run>=1)))))] = FALSE
(forward)formula 26,1,0.815254,33384,1,0,63468,1025,1326,65533,510,2775,193819
Formula is TRUE !

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

original formula: AG(EF(((i9.u15.crane_above_deposit_belt>=1)&&(i9.u15.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u15.crane_above_deposit_belt>=1)&&(i9.u15.CL_trans_run>=1)))))] = FALSE
(forward)formula 27,1,0.853254,35232,1,0,67250,1025,1331,69155,510,2778,204447
Formula is TRUE !

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

original formula: AG(EF(((i9.u17.crane_pick_up_height>=1)&&(i9.u17.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.crane_pick_up_height>=1)&&(i9.u17.CL_lift_run>=1)))))] = FALSE
(forward)formula 28,1,0.914822,37080,1,0,71069,1025,1339,72905,511,2782,215279
Formula is TRUE !

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

original formula: AG(EF(((i2.u5.ch_DC_free>=1)&&(i2.u5.ch_A2D_full>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u5.ch_DC_free>=1)&&(i2.u5.ch_A2D_full>=1)))))] = FALSE
(forward)formula 29,1,0.937297,37872,1,0,73314,1025,1343,75289,511,2782,221617
Formula is TRUE !

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

original formula: AG(EF(((i1.u7.ch_CF_full>=1)&&(i1.u3.ch_FT_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u7.ch_CF_full>=1)&&(i1.u3.ch_FT_free>=1)))))] = FALSE
(forward)formula 30,1,0.978094,39720,1,0,78228,1025,1349,79531,511,2782,235864
Formula is TRUE !

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

original formula: AG(EF((((i2.u6.ch_A2D_free>=1)&&(u9.swivel>=1))&&(u9.arm2_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i2.u6.ch_A2D_free>=1)&&(u9.swivel>=1))&&(u9.arm2_storing>=1)))))] = FALSE
(forward)formula 31,1,0.986693,39984,1,0,78628,1025,1361,80096,513,2782,237652
Formula is TRUE !

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

original formula: AG(EF((((i0.u1.ch_A1P_free>=1)&&(u9.swivel>=1))&&(u12.arm1_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u1.ch_A1P_free>=1)&&(u9.swivel>=1))&&(u12.arm1_storing>=1)))))] = FALSE
(forward)formula 32,1,0.992286,40248,1,0,78859,1025,1367,80465,513,2782,238796
Formula is TRUE !

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

original formula: AG(EF(((i9.u16.ch_CF_free>=1)&&(i9.u16.crane_storing>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.ch_CF_free>=1)&&(i9.u16.crane_storing>=1)))))] = FALSE
(forward)formula 33,1,1.03409,42096,1,0,83726,1025,1376,84731,514,2782,252132
Formula is TRUE !

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

original formula: AG(EF(((i2.u6.ch_DC_full>=1)&&(i9.u17.crane_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.ch_DC_full>=1)&&(i9.u17.crane_store_free>=1)))))] = FALSE
(forward)formula 34,1,1.06865,43416,1,0,87195,1025,1381,88059,514,2782,261614
Formula is TRUE !

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

original formula: AG(EF((((u9.swivel>=1)&&(i1.u4.TU_lift_rs>=1))&&(u12.arm1_store_free>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u9.swivel>=1)&&(i1.u4.TU_lift_rs>=1))&&(u12.arm1_store_free>=1)))))] = FALSE
(forward)formula 35,1,1.08137,43944,1,0,87935,1025,1387,88997,514,2782,264659
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 36,1,1.08668,44208,1,0,88130,1025,1396,89275,516,2782,265612
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 37,1,1.10999,44736,1,0,89892,1026,1404,91335,516,2788,270572
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 38,1,1.13373,45792,1,0,91839,1026,1410,93504,516,2790,275848
Formula is TRUE !

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

original formula: AG(EF(((i1.u2.table_load_angle>=1)&&(i1.u2.TL_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.table_load_angle>=1)&&(i1.u2.TL_rot_run>=1)))))] = FALSE
(forward)formula 39,1,1.18714,47904,1,0,97178,1026,1416,98303,516,2790,291950
Formula is TRUE !

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

original formula: AG(EF(((i1.u3.table_bottom_pos>=1)&&(i1.u2.TL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u3.table_bottom_pos>=1)&&(i1.u2.TL_lower_run>=1)))))] = FALSE
(forward)formula 40,1,1.25027,50544,1,0,103484,1026,1422,103818,516,2790,310268
Formula is TRUE !

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

original formula: AG(EF(((i1.u4.table_unload_angle>=1)&&(i1.u4.TU_rot_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u4.table_unload_angle>=1)&&(i1.u4.TU_rot_run>=1)))))] = FALSE
(forward)formula 41,1,1.36729,52392,1,0,108355,1026,1431,107974,518,2790,325160
Formula is TRUE !

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

original formula: AG(EF(((i2.u6.belt2_light_barrier_true>=1)&&(i2.u5.DB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_true>=1)&&(i2.u5.DB_trans_run>=1)))))] = FALSE
(forward)formula 42,1,1.39537,53712,1,0,110958,1026,1436,110696,518,2790,332807
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,1.4231,54768,1,0,113444,1026,1441,113369,518,2793,340346
Formula is TRUE !

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

original formula: AG(EF(((i1.u7.belt1_light_barrier_true>=1)&&(i1.u7.FB_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u7.belt1_light_barrier_true>=1)&&(i1.u7.FB_trans_run>=1)))))] = FALSE
(forward)formula 44,1,1.46858,56880,1,0,117826,1032,1447,117369,519,2829,355932
Formula is TRUE !

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

original formula: AG(EF(((i1.u7.belt1_light_barrier_false>=1)&&(i1.u7.FB_deliver_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u7.belt1_light_barrier_false>=1)&&(i1.u7.FB_deliver_run>=1)))))] = FALSE
(forward)formula 45,1,1.51113,58728,1,0,121849,1032,1449,120999,519,2829,370302
Formula is TRUE !

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

original formula: AG(EF(((u10.A2U_in>=1)&&(u8.arm1_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.A2U_in>=1)&&(u8.arm1_pick_up_angle>=1)))))] = FALSE
(forward)formula 46,1,1.51935,58992,1,0,122253,1032,1452,121513,519,2830,372054
Formula is TRUE !

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

original formula: AG(EF(((u10.A2U_in>=1)&&(u13.arm1_release_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.A2U_in>=1)&&(u13.arm1_release_angle>=1)))))] = FALSE
(forward)formula 47,1,1.52615,59256,1,0,122581,1032,1454,121911,519,2830,373363
Formula is TRUE !

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

original formula: AG(EF(((u10.A2U_in>=1)&&(u11.arm2_pick_up_angle>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.A2U_in>=1)&&(u11.arm2_pick_up_angle>=1)))))] = FALSE
(forward)formula 48,1,1.53517,59256,1,0,122966,1032,1456,122471,519,2830,374898
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u10.A2U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u10.A2U_rot1_run>=1)))))] = FALSE
(forward)formula 49,1,1.54411,59520,1,0,123386,1032,1460,123060,520,2831,376632
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u10.A2U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u10.A2U_rot2_run>=1)))))] = FALSE
(forward)formula 50,1,1.55395,59784,1,0,123801,1032,1464,123652,521,2831,378261
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u10.A2U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u10.A2U_rot3_run>=1)))))] = FALSE
(forward)formula 51,1,1.56508,60048,1,0,124309,1033,1468,124474,522,2833,379938
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_release_ext>=1)&&(u10.A2U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_release_ext>=1)&&(u10.A2U_ext_run>=1)))))] = FALSE
(forward)formula 52,1,1.57586,60312,1,0,124729,1033,1470,125195,522,2833,381643
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 53,1,1.58922,60576,1,0,125440,1033,1472,126149,522,2833,384172
Formula is TRUE !

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

original formula: AG(EF(((u8.arm1_pick_up_angle>=1)&&(u11.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm1_pick_up_angle>=1)&&(u11.A2L_in>=1)))))] = FALSE
(forward)formula 54,1,1.59545,60840,1,0,125723,1033,1475,126478,522,2833,385335
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u11.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u11.A2L_in>=1)))))] = FALSE
(forward)formula 55,1,1.60045,61104,1,0,125939,1033,1477,126757,522,2837,386183
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u11.A2L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u11.A2L_in>=1)))))] = FALSE
(forward)formula 56,1,1.60803,61368,1,0,126221,1033,1479,127198,522,2837,387294
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot1_run>=1)))))] = FALSE
(forward)formula 57,1,1.61401,61368,1,0,126487,1033,1481,127553,522,2837,388391
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot2_run>=1)))))] = FALSE
(forward)formula 58,1,1.62212,61632,1,0,126885,1033,1483,128186,522,2842,389548
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u11.A2L_rot3_run>=1)))))] = FALSE
(forward)formula 59,1,1.63033,61896,1,0,127174,1033,1485,128643,522,2849,390673
Formula is TRUE !

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

original formula: AG(EF(((u9.arm2_pick_up_ext>=1)&&(u11.A2L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm2_pick_up_ext>=1)&&(u11.A2L_ext_run>=1)))))] = FALSE
(forward)formula 60,1,1.63891,62160,1,0,127453,1033,1487,129181,522,2849,391824
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 61,1,1.65073,62424,1,0,128055,1033,1491,130008,524,2849,393961
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u8.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u8.A1L_in>=1)))))] = FALSE
(forward)formula 62,1,1.6566,62688,1,0,128258,1033,1494,130215,524,2849,395370
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u8.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u8.A1L_in>=1)))))] = FALSE
(forward)formula 63,1,1.66504,62952,1,0,128587,1033,1496,130663,524,2849,397305
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u8.A1L_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u8.A1L_in>=1)))))] = FALSE
(forward)formula 64,1,1.67652,63216,1,0,129192,1033,1498,131435,524,2849,399695
Formula is TRUE !

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

original formula: AG(EF(((u8.arm1_pick_up_angle>=1)&&(u8.A1L_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm1_pick_up_angle>=1)&&(u8.A1L_rot1_run>=1)))))] = FALSE
(forward)formula 65,1,1.68544,63744,1,0,129524,1033,1502,131947,526,2849,401708
Formula is TRUE !

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

original formula: AG(EF(((u8.arm1_pick_up_angle>=1)&&(u8.A1L_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm1_pick_up_angle>=1)&&(u8.A1L_rot2_run>=1)))))] = FALSE
(forward)formula 66,1,1.69426,64008,1,0,129855,1033,1504,132454,526,2849,403624
Formula is TRUE !

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

original formula: AG(EF(((u8.arm1_pick_up_angle>=1)&&(u8.A1L_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm1_pick_up_angle>=1)&&(u8.A1L_rot3_run>=1)))))] = FALSE
(forward)formula 67,1,1.70618,64272,1,0,130432,1033,1508,133262,528,2849,405898
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_pick_up_ext>=1)&&(u8.A1L_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_pick_up_ext>=1)&&(u8.A1L_ext_run>=1)))))] = FALSE
(forward)formula 68,1,1.71835,64536,1,0,130962,1033,1510,134029,528,2849,408153
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_retract_ext>=1)&&(u12.A1L_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_retract_ext>=1)&&(u12.A1L_ret_run>=1)))))] = FALSE
(forward)formula 69,1,1.73042,64800,1,0,131543,1033,1512,134841,528,2849,410477
Formula is TRUE !

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

original formula: AG(EF(((u8.arm1_pick_up_angle>=1)&&(u13.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u8.arm1_pick_up_angle>=1)&&(u13.A1U_in>=1)))))] = FALSE
(forward)formula 70,1,1.73459,65064,1,0,131672,1033,1515,135047,528,2849,411004
Formula is TRUE !

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

original formula: AG(EF(((u11.arm2_pick_up_angle>=1)&&(u13.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle>=1)&&(u13.A1U_in>=1)))))] = FALSE
(forward)formula 71,1,1.73874,65328,1,0,131806,1033,1517,135240,528,2849,411546
Formula is TRUE !

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

original formula: AG(EF(((u10.arm2_release_angle>=1)&&(u13.A1U_in>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm2_release_angle>=1)&&(u13.A1U_in>=1)))))] = FALSE
(forward)formula 72,1,1.74243,65328,1,0,131923,1033,1519,135412,528,2849,412042
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u13.A1U_rot1_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u13.A1U_rot1_run>=1)))))] = FALSE
(forward)formula 73,1,1.74692,65328,1,0,132144,1033,1521,135776,528,2859,412566
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u13.A1U_rot2_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u13.A1U_rot2_run>=1)))))] = FALSE
(forward)formula 74,1,1.75179,65592,1,0,132331,1033,1523,136121,528,2863,413118
Formula is TRUE !

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

original formula: AG(EF(((u13.arm1_release_angle>=1)&&(u13.A1U_rot3_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm1_release_angle>=1)&&(u13.A1U_rot3_run>=1)))))] = FALSE
(forward)formula 75,1,1.75606,65592,1,0,132550,1033,1525,136441,528,2866,413640
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_release_ext>=1)&&(u13.A1U_ext_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_release_ext>=1)&&(u13.A1U_ext_run>=1)))))] = FALSE
(forward)formula 76,1,1.76087,65592,1,0,132666,1033,1527,136711,528,2866,414212
Formula is TRUE !

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

original formula: AG(EF(((u12.arm1_retract_ext>=1)&&(u12.A1U_ret_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm1_retract_ext>=1)&&(u12.A1U_ret_run>=1)))))] = FALSE
(forward)formula 77,1,1.76869,65856,1,0,133082,1033,1529,137225,528,2866,415795
Formula is TRUE !

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

original formula: AG(EF(((i9.u14.crane_transport_height>=1)&&(i9.u14.CU_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u14.crane_transport_height>=1)&&(i9.u14.CU_lift_run>=1)))))] = FALSE
(forward)formula 78,1,1.85864,68496,1,0,137712,1033,1533,141274,528,2866,428799
Formula is TRUE !

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

original formula: AG(EF(((i9.u15.crane_above_deposit_belt>=1)&&(i9.u14.CU_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u15.crane_above_deposit_belt>=1)&&(i9.u14.CU_trans_run>=1)))))] = FALSE
(forward)formula 79,1,1.89763,69816,1,0,142539,1033,1537,145398,528,2866,442836
Formula is TRUE !

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

original formula: AG(EF(((i9.u14.crane_release_height>=1)&&(i9.u16.CU_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u14.crane_release_height>=1)&&(i9.u16.CU_lower_run>=1)))))] = FALSE
(forward)formula 80,1,1.94088,71664,1,0,147743,1033,1541,149926,528,2866,457633
Formula is TRUE !

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

original formula: AG(EF(((i9.u17.crane_pick_up_height>=1)&&(i9.u17.CL_lower_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.crane_pick_up_height>=1)&&(i9.u17.CL_lower_run>=1)))))] = FALSE
(forward)formula 81,1,1.97778,73248,1,0,151703,1039,1545,153666,528,2881,468655
Formula is TRUE !

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

original formula: AG(EF(((i9.u15.crane_above_feed_belt>=1)&&(i9.u15.CL_trans_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u15.crane_above_feed_belt>=1)&&(i9.u15.CL_trans_run>=1)))))] = FALSE
(forward)formula 82,1,2.0122,74568,1,0,155325,1039,1549,157156,528,2881,479155
Formula is TRUE !

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

original formula: AG(EF(((i9.u14.crane_transport_height>=1)&&(i9.u17.CL_lift_run>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u14.crane_transport_height>=1)&&(i9.u17.CL_lift_run>=1)))))] = FALSE
(forward)formula 83,1,2.04399,76152,1,0,158580,1039,1553,160312,528,2881,488403
Formula is TRUE !

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

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

BK_STOP 1678908111012

--------------------
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-2"
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-2, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r288-smll-167863554200239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-2.tgz
mv ParamProductionCell-PT-2 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;