About the Execution of 2023-gold for ParamProductionCell-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 667.659 | 53061.00 | 71118.00 | 493.20 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r286-smll-171654422600024.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r286-smll-171654422600024
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 20:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 20:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 20:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 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 1716797568034
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-3
Not applying reductions.
Model is PT
Liveness PT
Running Version 202304061127
[2024-05-27 08:12:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-27 08:12:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 08:12:51] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-05-27 08:12:51] [INFO ] Transformed 231 places.
[2024-05-27 08:12:51] [INFO ] Transformed 202 transitions.
[2024-05-27 08:12:51] [INFO ] Found NUPN structural information;
[2024-05-27 08:12:51] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 333 ms.
Built sparse matrix representations for Structural reductions in 12 ms.24432KB memory used
Starting structural reductions in DEADLOCK 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 53 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 53 ms. Remains : 231/231 places, 202/202 transitions.
Starting structural reductions in DEADLOCK 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 25 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2024-05-27 08:12:52] [INFO ] Computed 59 invariants in 34 ms
[2024-05-27 08:12:52] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-27 08:12:52] [INFO ] Invariant cache hit.
[2024-05-27 08:12:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 08:12:52] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
[2024-05-27 08:12:52] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-27 08:12:52] [INFO ] Invariant cache hit.
[2024-05-27 08:12:53] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1356 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2655 ms (no deadlock found). (steps per millisecond=470 )
Random directed walk for 1250000 steps, including 0 resets, run took 1725 ms (no deadlock found). (steps per millisecond=724 )
[2024-05-27 08:12:57] [INFO ] Invariant cache hit.
[2024-05-27 08:12:57] [INFO ] [Real]Absence check using 35 positive place invariants in 43 ms returned sat
[2024-05-27 08:12:57] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 130 ms returned sat
[2024-05-27 08:12:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 08:12:59] [INFO ] [Real]Absence check using state equation in 1222 ms returned sat
[2024-05-27 08:12:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 08:12:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 24 ms returned sat
[2024-05-27 08:12:59] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 43 ms returned sat
[2024-05-27 08:12:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 08:13:00] [INFO ] [Nat]Absence check using state equation in 1099 ms returned sat
[2024-05-27 08:13:00] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 08:13:00] [INFO ] [Nat]Added 68 Read/Feed constraints in 39 ms returned sat
[2024-05-27 08:13:00] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 9 ms to minimize.
[2024-05-27 08:13:01] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-05-27 08:13:01] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 3 ms to minimize.
[2024-05-27 08:13:01] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2024-05-27 08:13:01] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
[2024-05-27 08:13:01] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
[2024-05-27 08:13:01] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 0 ms to minimize.
[2024-05-27 08:13:02] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2024-05-27 08:13:02] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2024-05-27 08:13:02] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2024-05-27 08:13:02] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2024-05-27 08:13:02] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2024-05-27 08:13:02] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2024-05-27 08:13:02] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 1 ms to minimize.
[2024-05-27 08:13:03] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2024-05-27 08:13:03] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2024-05-27 08:13:03] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2024-05-27 08:13:03] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2024-05-27 08:13:03] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 1 ms to minimize.
[2024-05-27 08:13:03] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3194 ms
[2024-05-27 08:13:03] [INFO ] Computed and/alt/rep : 194/512/194 causal constraints (skipped 5 transitions) in 29 ms.
[2024-05-27 08:13:05] [INFO ] Added : 193 causal constraints over 39 iterations in 2100 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 68 ms.
Parikh directed walk for 45800 steps, including 575 resets, run took 201 ms. (steps per millisecond=227 )
Random directed walk for 500000 steps, including 0 resets, run took 720 ms (no deadlock found). (steps per millisecond=694 )
Random walk for 500000 steps, including 0 resets, run took 999 ms (no deadlock found). (steps per millisecond=500 )
Random directed walk for 500002 steps, including 0 resets, run took 571 ms (no deadlock found). (steps per millisecond=875 )
Random walk for 500000 steps, including 0 resets, run took 736 ms (no deadlock found). (steps per millisecond=679 )
Starting structural reductions in DEADLOCK 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 10 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-27 08:13:09] [INFO ] Invariant cache hit.
[2024-05-27 08:13:09] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 08:13:09] [INFO ] Invariant cache hit.
[2024-05-27 08:13:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 08:13:09] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-05-27 08:13:09] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-27 08:13:09] [INFO ] Invariant cache hit.
[2024-05-27 08:13:10] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 776 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2124 ms (no deadlock found). (steps per millisecond=588 )
Random directed walk for 1250000 steps, including 0 resets, run took 1693 ms (no deadlock found). (steps per millisecond=738 )
[2024-05-27 08:13:13] [INFO ] Invariant cache hit.
[2024-05-27 08:13:14] [INFO ] [Real]Absence check using 35 positive place invariants in 39 ms returned sat
[2024-05-27 08:13:14] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 146 ms returned sat
[2024-05-27 08:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 08:13:15] [INFO ] [Real]Absence check using state equation in 1332 ms returned sat
[2024-05-27 08:13:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 08:13:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 30 ms returned sat
[2024-05-27 08:13:15] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 48 ms returned sat
[2024-05-27 08:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 08:13:16] [INFO ] [Nat]Absence check using state equation in 1094 ms returned sat
[2024-05-27 08:13:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 08:13:16] [INFO ] [Nat]Added 68 Read/Feed constraints in 56 ms returned sat
[2024-05-27 08:13:17] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2024-05-27 08:13:17] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-05-27 08:13:17] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2024-05-27 08:13:17] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2024-05-27 08:13:17] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2024-05-27 08:13:17] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2024-05-27 08:13:18] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2024-05-27 08:13:18] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-27 08:13:18] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2024-05-27 08:13:18] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2024-05-27 08:13:18] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2024-05-27 08:13:18] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-05-27 08:13:18] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2024-05-27 08:13:18] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-27 08:13:19] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 5 ms to minimize.
[2024-05-27 08:13:19] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2024-05-27 08:13:19] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2024-05-27 08:13:19] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-27 08:13:19] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2024-05-27 08:13:19] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2819 ms
[2024-05-27 08:13:19] [INFO ] Computed and/alt/rep : 194/512/194 causal constraints (skipped 5 transitions) in 19 ms.
[2024-05-27 08:13:21] [INFO ] Added : 193 causal constraints over 39 iterations in 2021 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 59 ms.
Parikh directed walk for 45800 steps, including 582 resets, run took 90 ms. (steps per millisecond=508 )
Random directed walk for 500000 steps, including 0 resets, run took 606 ms (no deadlock found). (steps per millisecond=825 )
Random walk for 500000 steps, including 0 resets, run took 738 ms (no deadlock found). (steps per millisecond=677 )
Random directed walk for 500002 steps, including 0 resets, run took 744 ms (no deadlock found). (steps per millisecond=672 )
Random walk for 500000 steps, including 0 resets, run took 797 ms (no deadlock found). (steps per millisecond=627 )
[2024-05-27 08:13:25] [INFO ] Flatten gal took : 87 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 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
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 64 place count 199 transition count 170
Applied a total of 64 rules in 24 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 199 cols
[2024-05-27 08:13:25] [INFO ] Computed 59 invariants in 12 ms
[2024-05-27 08:13:25] [INFO ] Implicit Places using invariants in 552 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 93, 94, 96, 98, 99, 137, 138, 140, 142, 143, 168, 169, 172, 173, 178, 179, 181, 190]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 556 ms to find 39 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 160/231 places, 170/202 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 160 transition count 151
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 141 transition count 151
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 38 place count 141 transition count 144
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 52 place count 134 transition count 144
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 150 place count 85 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 84 transition count 94
Applied a total of 152 rules in 22 ms. Remains 84 /160 variables (removed 76) and now considering 94/170 (removed 76) transitions.
// Phase 1: matrix 94 rows 84 cols
[2024-05-27 08:13:25] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 08:13:25] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-27 08:13:25] [INFO ] Invariant cache hit.
[2024-05-27 08:13:26] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 08:13:26] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 84/231 places, 94/202 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1148 ms. Remains : 84/231 places, 94/202 transitions.
Initial state reduction rules removed 2 formulas.
[2024-05-27 08:13:26] [INFO ] Flatten gal took : 51 ms
[2024-05-27 08:13:26] [INFO ] Flatten gal took : 30 ms
[2024-05-27 08:13:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7039793751707843415.gal : 47 ms
[2024-05-27 08:13:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13109865117240614517.prop : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7039793751707843415.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13109865117240614517.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13109865117240614517.prop.
Reachability property qltransition_90 is true.
Reachability property qltransition_39 is true.
Reachability property qltransition_37 is true.
SDD proceeding with computation,89 properties remain. new max is 2
SDD size :1 after 4
Reachability property qltransition_92 is true.
SDD proceeding with computation,88 properties remain. new max is 2
SDD size :4 after 5
Reachability property qltransition_51 is true.
Reachability property qltransition_38 is true.
SDD proceeding with computation,86 properties remain. new max is 2
SDD size :5 after 12
Reachability property qltransition_91 is true.
SDD proceeding with computation,85 properties remain. new max is 2
SDD size :12 after 16
Reachability property qltransition_8 is true.
SDD proceeding with computation,84 properties remain. new max is 2
SDD size :16 after 24
Reachability property qltransition_73 is true.
Reachability property qltransition_45 is true.
Reachability property qltransition_7 is true.
SDD proceeding with computation,81 properties remain. new max is 2
SDD size :32 after 41
Reachability property qltransition_76 is true.
Reachability property qltransition_27 is true.
Reachability property qltransition_26 is true.
SDD proceeding with computation,78 properties remain. new max is 2
SDD size :41 after 44
Reachability property qltransition_78 is true.
Reachability property qltransition_77 is true.
Reachability property qltransition_28 is true.
SDD proceeding with computation,75 properties remain. new max is 2
SDD size :44 after 47
Reachability property qltransition_79 is true.
Reachability property qltransition_42 is true.
Reachability property qltransition_29 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,71 properties remain. new max is 2
SDD size :47 after 50
Reachability property qltransition_82 is true.
SDD proceeding with computation,70 properties remain. new max is 2
SDD size :50 after 51
Reachability property qltransition_32 is true.
SDD proceeding with computation,69 properties remain. new max is 2
SDD size :51 after 52
Reachability property qltransition_86 is true.
Reachability property qltransition_85 is true.
Reachability property qltransition_33 is true.
SDD proceeding with computation,66 properties remain. new max is 2
SDD size :52 after 55
Reachability property qltransition_2 is true.
SDD proceeding with computation,65 properties remain. new max is 2
SDD size :55 after 56
Reachability property qltransition_48 is true.
Reachability property qltransition_1 is true.
Reachability property qltransition_0 is true.
SDD proceeding with computation,62 properties remain. new max is 2
SDD size :56 after 59
Reachability property qltransition_64 is true.
Reachability property qltransition_47 is true.
Reachability property qltransition_20 is true.
SDD proceeding with computation,59 properties remain. new max is 2
SDD size :59 after 62
Reachability property qltransition_67 is true.
SDD proceeding with computation,58 properties remain. new max is 2
SDD size :62 after 63
Reachability property qltransition_22 is true.
SDD proceeding with computation,57 properties remain. new max is 2
SDD size :63 after 64
Reachability property qltransition_70 is true.
Reachability property qltransition_69 is true.
Reachability property qltransition_23 is true.
SDD proceeding with computation,54 properties remain. new max is 2
SDD size :64 after 67
Finished random walk after 2093 steps, including 0 resets, run visited all 92 properties in 533 ms. (steps per millisecond=3 )
Reachability property qltransition_57 is true.
Reachability property qltransition_41 is true.
Reachability property qltransition_16 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,50 properties remain. new max is 2
SDD size :67 after 70
Parikh walk visited 0 properties in 2 ms.
Reachability property qltransition_60 is true.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
SDD proceeding with computation,49 properties remain. new max is 2
SDD size :70 after 71
Reachability property qltransition_17 is true.
SDD proceeding with computation,48 properties remain. new max is 2
SDD size :71 after 72
Able to resolve query QuasiLiveness after proving 94 properties.
Reachability property qltransition_62 is true.
Starting structural reductions in LIVENESS mode, iteration 0 : 231/231 places, 202/202 transitions.
Reachability property qltransition_61 is true.
Reachability property qltransition_18 is true.
SDD proceeding with computation,45 properties remain. new max is 2
SDD size :72 after 75
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
Reachability property qltransition_49 is true.
Reachability property qltransition_40 is true.
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
SDD proceeding with computation,43 properties remain. new max is 2
SDD size :75 after 93
SDD proceeding with computation,43 properties remain. new max is 4
SDD size :93 after 94
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 64 place count 199 transition count 170
Reachability property qltransition_53 is true.
Reachability property qltransition_52 is true.
Reachability property qltransition_11 is true.
Reachability property qltransition_10 is true.
SDD proceeding with computation,39 properties remain. new max is 4
SDD size :94 after 106
SDD proceeding with computation,39 properties remain. new max is 8
SDD size :106 after 109
SDD proceeding with computation,39 properties remain. new max is 16
SDD size :109 after 113
Applied a total of 64 rules in 27 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
SDD proceeding with computation,39 properties remain. new max is 32
SDD size :113 after 116
// Phase 1: matrix 170 rows 199 cols
SDD proceeding with computation,39 properties remain. new max is 64
SDD size :116 after 127
[2024-05-27 08:13:26] [INFO ] Computed 59 invariants in 8 ms
SDD proceeding with computation,39 properties remain. new max is 128
SDD size :127 after 163
Reachability property qltransition_93 is true.
Reachability property qltransition_89 is true.
Reachability property qltransition_87 is true.
Reachability property qltransition_54 is true.
Reachability property qltransition_50 is true.
Reachability property qltransition_46 is true.
Reachability property qltransition_43 is true.
Reachability property qltransition_36 is true.
Reachability property qltransition_35 is true.
Reachability property qltransition_34 is true.
Reachability property qltransition_13 is true.
Reachability property qltransition_12 is true.
Reachability property qltransition_6 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,25 properties remain. new max is 128
SDD size :2051 after 4406
Reachability property qltransition_88 is true.
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :6967 after 8773
Reachability property qltransition_75 is true.
Reachability property qltransition_74 is true.
Reachability property qltransition_72 is true.
Reachability property qltransition_71 is true.
Reachability property qltransition_59 is true.
Reachability property qltransition_58 is true.
Reachability property qltransition_56 is true.
Reachability property qltransition_55 is true.
Reachability property qltransition_25 is true.
Reachability property qltransition_24 is true.
Reachability property qltransition_15 is true.
Reachability property qltransition_14 is true.
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :8773 after 9973
Reachability property qltransition_84 is true.
Reachability property qltransition_83 is true.
Reachability property qltransition_81 is true.
Reachability property qltransition_80 is true.
Reachability property qltransition_68 is true.
Reachability property qltransition_66 is true.
Reachability property qltransition_65 is true.
Reachability property qltransition_63 is true.
Reachability property qltransition_31 is true.
Reachability property qltransition_30 is true.
Reachability property qltransition_21 is true.
Reachability property qltransition_19 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,10059,0.305592,8412,2,1597,133,10114,6,0,433,3589,0
Total reachable state count : 10059
Verifying 92 reachability properties.
Reachability property qltransition_0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_0,1,0.306549,8412,2,85,133,10114,7,0,439,3589,0
Reachability property qltransition_1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_1,1,0.307352,8676,2,85,133,10114,8,0,442,3589,0
Reachability property qltransition_2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_2,1,0.307911,8676,2,85,133,10114,9,0,447,3589,0
Reachability property qltransition_3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_3,7,0.308448,8676,2,155,133,10114,10,0,450,3589,0
Reachability property qltransition_4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_4,149,0.309055,8676,2,391,133,10114,11,0,455,3589,0
Reachability property qltransition_5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_5,391,0.309688,8676,2,447,133,10114,12,0,460,3589,0
Reachability property qltransition_6 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_6,391,0.310283,8676,2,447,133,10114,13,0,463,3589,0
Reachability property qltransition_7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_7,846,0.310913,8676,2,525,133,10114,14,0,466,3589,0
Reachability property qltransition_8 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_8,846,0.311559,8676,2,525,133,10114,15,0,467,3589,0
Reachability property qltransition_10 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_10,21,0.312145,8676,2,162,133,10114,16,0,472,3589,0
Reachability property qltransition_11 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_11,21,0.31269,8676,2,162,133,10114,17,0,477,3589,0
Reachability property qltransition_12 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_12,15,0.313322,8676,2,113,133,10114,18,0,482,3589,0
Reachability property qltransition_13 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_13,15,0.313985,8676,2,113,133,10114,19,0,487,3589,0
Reachability property qltransition_14 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_14,1,0.314849,8676,2,85,133,10114,20,0,492,3589,0
Reachability property qltransition_15 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_15,1,0.31562,8676,2,85,133,10114,21,0,497,3589,0
Reachability property qltransition_16 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_16,1,0.316276,8676,2,85,133,10114,22,0,502,3589,0
Reachability property qltransition_17 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_17,1,0.316907,8676,2,85,133,10114,23,0,507,3589,0
Reachability property qltransition_18 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_18,1,0.317511,8676,2,85,133,10114,24,0,512,3589,0
Reachability property qltransition_19 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_19,1,0.318359,8676,2,85,133,10114,25,0,515,3589,0
Reachability property qltransition_20 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_20,1,0.319022,8676,2,85,133,10114,26,0,518,3589,0
Reachability property qltransition_21 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_21,1,0.319887,8676,2,85,133,10114,27,0,523,3589,0
Reachability property qltransition_22 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_22,1,0.320521,8676,2,85,133,10114,28,0,526,3589,0
Reachability property qltransition_23 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_23,1,0.321106,8676,2,85,133,10114,29,0,531,3589,0
Reachability property qltransition_24 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_24,1,0.3219,8676,2,85,133,10114,30,0,534,3589,0
Reachability property qltransition_25 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_25,1,0.322719,8676,2,85,133,10114,31,0,537,3589,0
Reachability property qltransition_26 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_26,1,0.323315,8676,2,85,133,10114,32,0,540,3589,0
Reachability property qltransition_27 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_27,1,0.323876,8676,2,85,133,10114,33,0,545,3589,0
Reachability property qltransition_28 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_28,1,0.324445,8676,2,85,133,10114,34,0,550,3589,0
Reachability property qltransition_29 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_29,1,0.325141,8676,2,85,133,10114,35,0,553,3589,0
Reachability property qltransition_30 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_30,1,0.32602,8676,2,85,133,10114,36,0,556,3589,0
Reachability property qltransition_31 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_31,1,0.326959,8676,2,85,133,10114,37,0,559,3589,0
Reachability property qltransition_32 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_32,1,0.327608,8676,2,85,133,10114,38,0,562,3589,0
Reachability property qltransition_33 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_33,1,0.328192,8676,2,85,133,10114,39,0,567,3589,0
Reachability property qltransition_34 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_34,244,0.328919,8676,2,627,133,10114,40,0,572,3589,0
Reachability property qltransition_35 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_35,244,0.329613,8676,2,627,133,10114,41,0,577,3589,0
Reachability property qltransition_36 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_36,244,0.330308,8676,2,627,133,10114,42,0,582,3589,0
Reachability property qltransition_37 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_37,124,0.331082,8676,2,562,133,10114,43,0,585,3589,0
Reachability property qltransition_38 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_38,228,0.332351,8676,2,632,133,10114,44,0,590,3589,0
Reachability property qltransition_39 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_39,124,0.33308,8676,2,562,133,10114,45,0,595,3589,0
Reachability property qltransition_40 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_40,14,0.333634,8676,2,157,133,10114,46,0,600,3589,0
Reachability property qltransition_41 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_41,1,0.334349,8676,2,85,133,10114,47,0,607,3589,0
Reachability property qltransition_42 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_42,1,0.335015,8676,2,85,133,10114,48,0,612,3589,0
Reachability property qltransition_43 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_43,524,0.335895,8676,2,1014,133,10114,49,0,617,3589,0
Reachability property qltransition_45 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_45,1,0.336566,8676,2,85,133,10114,50,0,622,3589,0
Reachability property qltransition_46 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_46,109,0.33724,8676,2,410,133,10114,51,0,627,3589,0
Reachability property qltransition_47 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_47,1,0.337956,8676,2,85,133,10114,52,0,632,3589,0
Reachability property qltransition_48 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_48,1,0.338538,8676,2,85,133,10114,53,0,633,3589,0
Reachability property qltransition_49 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_49,7,0.33906,8676,2,155,133,10114,54,0,634,3589,0
Reachability property qltransition_50 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_50,15,0.339561,8676,2,113,133,10114,55,0,637,3589,0
Reachability property qltransition_51 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_51,357,0.340222,8676,2,424,133,10114,56,0,640,3589,0
Reachability property qltransition_52 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_52,21,0.340799,8676,2,162,133,10114,57,0,641,3589,0
Reachability property qltransition_53 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_53,21,0.34133,8676,2,162,133,10114,58,0,642,3589,0
Reachability property qltransition_54 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_54,62,0.342125,8676,2,396,133,10114,59,0,643,3589,0
Reachability property qltransition_55 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_55,1,0.342966,8676,2,85,133,10114,60,0,646,3589,0
Reachability property qltransition_56 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_56,1,0.343759,8676,2,85,133,10114,61,0,647,3589,0
Reachability property qltransition_57 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_57,1,0.344414,8676,2,85,133,10114,62,0,648,3589,0
Reachability property qltransition_58 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_58,1,0.345223,8676,2,85,133,10114,63,0,649,3589,0
Reachability property qltransition_59 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_59,1,0.346028,8676,2,85,133,10114,64,0,650,3589,0
Reachability property qltransition_60 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_60,1,0.346723,8676,2,85,133,10114,65,0,651,3589,0
Reachability property qltransition_61 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_61,1,0.347368,8676,2,85,133,10114,66,0,652,3589,0
Reachability property qltransition_62 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_62,1,0.347973,8676,2,85,133,10114,67,0,653,3589,0
Reachability property qltransition_63 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_63,1,0.34887,8676,2,85,133,10114,68,0,656,3589,0
Reachability property qltransition_64 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_64,1,0.349519,8676,2,85,133,10114,69,0,657,3589,0
Reachability property qltransition_65 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_65,1,0.35039,8676,2,85,133,10114,70,0,658,3589,0
Reachability property qltransition_66 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_66,1,0.351332,8676,2,85,133,10114,71,0,659,3589,0
Reachability property qltransition_67 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_67,1,0.35205,8676,2,85,133,10114,72,0,660,3589,0
Reachability property qltransition_68 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_68,1,0.352914,8676,2,85,133,10114,73,0,661,3589,0
Reachability property qltransition_69 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_69,1,0.353514,8676,2,85,133,10114,74,0,662,3589,0
Reachability property qltransition_70 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_70,1,0.354154,8676,2,85,133,10114,75,0,663,3589,0
Reachability property qltransition_71 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_71,1,0.354938,8676,2,85,133,10114,76,0,666,3589,0
Reachability property qltransition_72 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_72,1,0.355696,8676,2,85,133,10114,77,0,667,3589,0
Reachability property qltransition_73 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_73,1,0.356258,8676,2,85,133,10114,78,0,668,3589,0
Reachability property qltransition_74 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_74,1,0.357104,8676,2,85,133,10114,79,0,669,3589,0
Reachability property qltransition_75 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_75,1,0.357884,8676,2,85,133,10114,80,0,670,3589,0
Reachability property qltransition_76 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_76,1,0.358472,8676,2,85,133,10114,81,0,671,3589,0
Reachability property qltransition_77 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_77,1,0.359033,8676,2,85,133,10114,82,0,672,3589,0
Reachability property qltransition_78 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_78,1,0.359591,8676,2,85,133,10114,83,0,673,3589,0
Reachability property qltransition_79 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_79,1,0.36023,8676,2,85,133,10114,84,0,676,3589,0
Reachability property qltransition_80 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_80,1,0.361044,8676,2,85,133,10114,85,0,677,3589,0
Reachability property qltransition_81 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_81,1,0.361615,8676,2,85,133,10114,86,0,678,3589,0
Reachability property qltransition_82 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_82,1,0.362067,8676,2,85,133,10114,87,0,679,3589,0
Reachability property qltransition_83 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_83,1,0.362652,8676,2,85,133,10114,88,0,680,3589,0
Reachability property qltransition_84 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_84,1,0.363266,8676,2,85,133,10114,89,0,681,3589,0
Reachability property qltransition_85 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_85,1,0.36367,8676,2,85,133,10114,90,0,682,3589,0
Reachability property qltransition_86 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_86,1,0.364085,8676,2,85,133,10114,91,0,683,3589,0
Reachability property qltransition_87 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_87,244,0.36454,8676,2,627,133,10114,92,0,684,3589,0
Reachability property qltransition_88 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_88,244,0.365017,8676,2,627,133,10114,93,0,685,3589,0
Reachability property qltransition_89 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_89,244,0.365497,8676,2,627,133,10114,94,0,686,3589,0
Reachability property qltransition_90 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_90,124,0.365984,8676,2,562,133,10114,95,0,687,3589,0
Reachability property qltransition_91 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_91,124,0.366446,8676,2,562,133,10114,96,0,688,3589,0
Reachability property qltransition_92 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_92,124,0.366939,8676,2,562,133,10114,97,0,689,3589,0
Reachability property qltransition_93 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_93,15,0.367438,8676,2,113,133,10114,98,0,690,3589,0
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-27 08:13:27] [INFO ] Implicit Places using invariants in 590 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 93, 94, 96, 98, 99, 137, 138, 140, 142, 143, 168, 169, 172, 173, 178, 179, 181, 190]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 593 ms to find 39 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 160/231 places, 170/202 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 160 transition count 151
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 141 transition count 151
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 38 place count 141 transition count 144
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 52 place count 134 transition count 144
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 150 place count 85 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 84 transition count 94
Applied a total of 152 rules in 20 ms. Remains 84 /160 variables (removed 76) and now considering 94/170 (removed 76) transitions.
// Phase 1: matrix 94 rows 84 cols
[2024-05-27 08:13:27] [INFO ] Computed 20 invariants in 1 ms
[2024-05-27 08:13:27] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-27 08:13:27] [INFO ] Invariant cache hit.
[2024-05-27 08:13:27] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 08:13:28] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 84/231 places, 94/202 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1112 ms. Remains : 84/231 places, 94/202 transitions.
[2024-05-27 08:13:28] [INFO ] Flatten gal took : 17 ms
[2024-05-27 08:13:28] [INFO ] Flatten gal took : 16 ms
[2024-05-27 08:13:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15261889714891896757.gal : 6 ms
[2024-05-27 08:13:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15994543039122904419.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15261889714891896757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15994543039122904419.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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.141768,5924,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.34128,36804,1,0,227,208613,209,129,2656,132175,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.75062,48332,1,0,279,283879,210,162,2658,187830,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.22398,59156,1,0,331,361550,211,196,2661,246483,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.73233,72356,1,0,383,455807,212,230,2663,314200,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.89097,77900,1,0,437,492637,213,264,2666,342726,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.90377,78164,1,0,491,494089,214,297,2669,345778,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.90778,78428,1,0,545,494181,215,331,2671,346121,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.94685,79220,1,0,599,502319,216,364,2673,353192,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.96664,80012,1,0,653,506091,217,398,2674,356321,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.98459,80276,1,0,707,509008,218,432,2677,359260,1055
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-27 08:13:31] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:13:31] [INFO ] Applying decomposition
[2024-05-27 08:13:31] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1235366685793144860.txt' '-o' '/tmp/graph1235366685793144860.bin' '-w' '/tmp/graph1235366685793144860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1235366685793144860.bin' '-l' '-1' '-v' '-w' '/tmp/graph1235366685793144860.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:13:31] [INFO ] Decomposing Gal with order
[2024-05-27 08:13:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:13:31] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-27 08:13:31] [INFO ] Flatten gal took : 58 ms
[2024-05-27 08:13:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-27 08:13:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4204916256528362298.gal : 4 ms
[2024-05-27 08:13:31] [INFO ] Time to serialize properties into /tmp/CTLFireability16126060192592723231.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4204916256528362298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16126060192592723231.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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.087891,4988,266,139,2356,402,319,2363,111,1219,0
Converting to forward existential form...Done !
original formula: AG(EF(((i0.u7.belt2_light_barrier_false==1)&&(i0.u0.DB_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u7.belt2_light_barrier_false==1)&&(i0.u0.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...1768
(forward)formula 0,1,0.270881,9740,1,0,14771,1087,1198,13753,542,2687,34080
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u7.belt2_light_barrier_true==1)&&(i0.u7.DB_deliver_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u7.belt2_light_barrier_true==1)&&(i0.u7.DB_deliver_run==1)))))] = FALSE
(forward)formula 1,1,0.334101,11588,1,0,19842,1089,1209,18336,545,2694,46231
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u8.belt1_light_barrier_false==1)&&(i2.u8.FB_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u8.belt1_light_barrier_false==1)&&(i2.u8.FB_trans_run==1)))))] = FALSE
(forward)formula 2,1,0.482636,15548,1,0,30557,1104,1219,27204,547,2786,73254
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u8.belt1_light_barrier_true==1)&&(i2.u8.FB_deliver_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u8.belt1_light_barrier_true==1)&&(i2.u8.FB_deliver_run==1)))))] = FALSE
(forward)formula 3,1,0.589118,19244,1,0,39773,1115,1230,34759,550,2803,98369
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle==1)&&(u13.A2U_rot1_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle==1)&&(u13.A2U_rot1_run==1)))))] = FALSE
(forward)formula 4,1,0.713646,22412,1,0,48580,1134,1234,42111,550,2868,121330
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm1_release_angle==1)&&(u13.A2U_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_release_angle==1)&&(u13.A2U_rot2_run==1)))))] = FALSE
(forward)formula 5,1,0.793913,24260,1,0,53115,1139,1238,46358,550,2906,133462
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_pick_up_angle==1)&&(u13.A2U_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle==1)&&(u13.A2U_rot3_run==1)))))] = FALSE
(forward)formula 6,1,0.817465,25316,1,0,55769,1140,1244,49043,552,2935,140511
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_retract_ext==1)&&(u13.A2U_ext_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_retract_ext==1)&&(u13.A2U_ext_run==1)))))] = FALSE
(forward)formula 7,1,0.832107,26108,1,0,57143,1140,1247,50785,552,2935,144379
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_release_ext==1)&&(u12.A2U_ret_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_release_ext==1)&&(u12.A2U_ret_run==1)))))] = FALSE
(forward)formula 8,1,0.842641,26372,1,0,57835,1143,1252,51614,554,2936,146888
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle==1)&&(u11.A2L_rot1_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle==1)&&(u11.A2L_rot1_run==1)))))] = FALSE
(forward)formula 9,1,0.910606,29012,1,0,63862,1143,1255,57314,554,2940,162618
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm1_release_angle==1)&&(u11.A2L_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_release_angle==1)&&(u11.A2L_rot2_run==1)))))] = FALSE
(forward)formula 10,1,0.939828,30332,1,0,67044,1143,1258,60645,554,2941,171585
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm2_release_angle==1)&&(u11.A2L_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle==1)&&(u11.A2L_rot3_run==1)))))] = FALSE
(forward)formula 11,1,0.954612,30860,1,0,68124,1144,1262,62020,554,2942,175158
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_retract_ext==1)&&(u11.A2L_ext_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_retract_ext==1)&&(u11.A2L_ext_run==1)))))] = FALSE
(forward)formula 12,1,0.97316,31652,1,0,69687,1149,1265,63960,554,2944,179671
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_pick_up_ext==1)&&(u12.A2L_ret_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_ext==1)&&(u12.A2L_ret_run==1)))))] = FALSE
(forward)formula 13,1,0.98617,32180,1,0,70419,1153,1269,64964,556,2945,182329
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm1_release_angle==1)&&(u9.A1L_rot1_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_release_angle==1)&&(u9.A1L_rot1_run==1)))))] = FALSE
(forward)formula 14,1,1.02065,33500,1,0,74131,1153,1272,68473,556,2945,192536
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_pick_up_angle==1)&&(u9.A1L_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle==1)&&(u9.A1L_rot2_run==1)))))] = FALSE
(forward)formula 15,1,1.05093,34820,1,0,77174,1153,1275,71454,556,2945,201102
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm2_release_angle==1)&&(u9.A1L_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle==1)&&(u9.A1L_rot3_run==1)))))] = FALSE
(forward)formula 16,1,1.10514,36932,1,0,80431,1154,1278,74441,556,2951,211111
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_retract_ext==1)&&(u9.A1L_ext_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_retract_ext==1)&&(u9.A1L_ext_run==1)))))] = FALSE
(forward)formula 17,1,1.12454,37460,1,0,82363,1154,1282,76610,556,2951,216529
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_pick_up_ext==1)&&(u14.A1L_ret_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_pick_up_ext==1)&&(u14.A1L_ret_run==1)))))] = FALSE
(forward)formula 18,1,1.13512,37724,1,0,82958,1155,1286,77475,556,2951,218784
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle==1)&&(u10.A1U_rot1_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle==1)&&(u10.A1U_rot1_run==1)))))] = FALSE
(forward)formula 19,1,1.15567,38516,1,0,84966,1155,1289,79698,556,2954,224644
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_pick_up_angle==1)&&(u10.A1U_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle==1)&&(u10.A1U_rot2_run==1)))))] = FALSE
(forward)formula 20,1,1.1814,39572,1,0,87444,1155,1292,82421,556,2961,231696
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm2_release_angle==1)&&(u10.A1U_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle==1)&&(u10.A1U_rot3_run==1)))))] = FALSE
(forward)formula 21,1,1.20113,40628,1,0,89487,1155,1295,84690,556,2961,237655
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_retract_ext==1)&&(u10.A1U_ext_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_retract_ext==1)&&(u10.A1U_ext_run==1)))))] = FALSE
(forward)formula 22,1,1.21886,41420,1,0,91132,1169,1298,86586,556,2990,242166
Formula is TRUE !
***************************************
original formula: AG(EF(((u14.arm1_release_ext==1)&&(u14.A1U_ret_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u14.arm1_release_ext==1)&&(u14.A1U_ret_run==1)))))] = FALSE
(forward)formula 23,1,1.22854,41684,1,0,91704,1169,1304,87356,558,2990,244258
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u15.crane_release_height==1)&&(i9.u15.CU_lift_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u15.crane_release_height==1)&&(i9.u15.CU_lift_run==1)))))] = FALSE
(forward)formula 24,1,1.3061,45380,1,0,101634,1173,1316,95471,562,3016,269447
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_above_feed_belt==1)&&(i9.u15.CU_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_above_feed_belt==1)&&(i9.u15.CU_trans_run==1)))))] = FALSE
(forward)formula 25,1,1.42774,49076,1,0,111102,1173,1323,103228,562,3016,293086
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u15.crane_transport_height==1)&&(i9.u15.CU_lower_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u15.crane_transport_height==1)&&(i9.u15.CU_lower_run==1)))))] = FALSE
(forward)formula 26,1,1.5378,52772,1,0,121364,1177,1334,111643,565,3036,318455
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u15.crane_transport_height==1)&&(i9.u17.CL_lower_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u15.crane_transport_height==1)&&(i9.u17.CL_lower_run==1)))))] = FALSE
(forward)formula 27,1,1.60485,56204,1,0,130132,1180,1340,119041,565,3038,339531
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u16.crane_above_deposit_belt==1)&&(i9.u15.CL_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u16.crane_above_deposit_belt==1)&&(i9.u15.CL_trans_run==1)))))] = FALSE
(forward)formula 28,1,1.68606,59108,1,0,138268,1180,1344,125903,565,3038,359546
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u15.crane_pick_up_height==1)&&(i9.u15.CL_lift_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u15.crane_pick_up_height==1)&&(i9.u15.CL_lift_run==1)))))] = FALSE
(forward)formula 29,1,1.79029,62276,1,0,146615,1202,1354,132979,567,3091,380538
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u0.ch_DC_free==1)&&(i0.u0.ch_A2D_full==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u0.ch_DC_free==1)&&(i0.u0.ch_A2D_full==1)))))] = FALSE
(forward)formula 30,1,1.84765,64124,1,0,151057,1202,1358,137010,567,3091,391156
Formula is TRUE !
***************************************
original formula: AG(EF((((i0.u7.ch_A2D_free==1)&&(u12.swivel==1))&&(u12.arm2_storing==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u7.ch_A2D_free==1)&&(u12.swivel==1))&&(u12.arm2_storing==1)))))] = FALSE
(forward)formula 31,1,1.85692,64388,1,0,151373,1202,1369,137376,569,3091,392422
Formula is TRUE !
***************************************
original formula: AG(EF((((i1.u2.ch_A1P_free==1)&&(u12.swivel==1))&&(u14.arm1_storing==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i1.u2.ch_A1P_free==1)&&(u12.swivel==1))&&(u14.arm1_storing==1)))))] = FALSE
(forward)formula 32,1,1.86839,64652,1,0,151772,1202,1375,137900,569,3091,393897
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u8.ch_CF_free==1)&&(i9.u15.crane_storing==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u8.ch_CF_free==1)&&(i9.u15.crane_storing==1)))))] = FALSE
(forward)formula 33,1,1.97795,68084,1,0,161121,1203,1380,145346,569,3092,416928
Formula is TRUE !
***************************************
original formula: AG(EF(((i9.u17.ch_DC_full==1)&&(i9.u17.crane_store_free==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i9.u17.ch_DC_full==1)&&(i9.u17.crane_store_free==1)))))] = FALSE
(forward)formula 34,1,2.14083,71516,1,0,169121,1203,1388,151861,569,3092,435892
Formula is TRUE !
***************************************
original formula: AG(EF((((u12.swivel==1)&&(i2.u6.TU_lift_rs==1))&&(u14.arm1_store_free==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u12.swivel==1)&&(i2.u6.TU_lift_rs==1))&&(u14.arm1_store_free==1)))))] = FALSE
(forward)formula 35,1,2.15958,71780,1,0,170091,1203,1395,152926,569,3092,439353
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u8.ch_CF_full==1)&&(i2.u5.TL_lower_rs==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u8.ch_CF_full==1)&&(i2.u5.TL_lower_rs==1)))))] = FALSE
(forward)formula 36,1,2.25815,74948,1,0,179226,1203,1402,160162,569,3092,462736
Formula is TRUE !
***************************************
original formula: AG(EF((((u12.swivel==1)&&(i1.u1.PU_lower_rs==1))&&(u12.arm2_store_free==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u12.swivel==1)&&(i1.u1.PU_lower_rs==1))&&(u12.arm2_store_free==1)))))] = FALSE
(forward)formula 37,1,2.27165,75476,1,0,180133,1203,1410,161183,571,3092,465979
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u1.press_at_upper_pos==1)&&(i1.u1.forge_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u1.press_at_upper_pos==1)&&(i1.u1.forge_run==1)))))] = FALSE
(forward)formula 38,1,2.30214,76796,1,0,183210,1204,1416,164207,571,3102,474457
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u2.press_at_middle_pos==1)&&(i1.u2.PL_lower_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.press_at_middle_pos==1)&&(i1.u2.PL_lower_run==1)))))] = FALSE
(forward)formula 39,1,2.33363,78116,1,0,186199,1205,1424,167282,573,3102,483194
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u3.table_load_angle==1)&&(i2.u5.TL_rot_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u3.table_load_angle==1)&&(i2.u5.TL_rot_run==1)))))] = FALSE
(forward)formula 40,1,2.39407,80756,1,0,193241,1205,1430,173165,573,3102,501621
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u3.table_unload_angle==1)&&(i2.u6.TU_rot_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u3.table_unload_angle==1)&&(i2.u6.TU_rot_run==1)))))] = FALSE
(forward)formula 41,1,2.46943,83924,1,0,201915,1205,1437,180066,573,3102,524488
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u7.belt2_light_barrier_true==1)&&(i0.u0.DB_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u7.belt2_light_barrier_true==1)&&(i0.u0.DB_trans_run==1)))))] = FALSE
(forward)formula 42,1,2.51511,86036,1,0,206981,1205,1441,184607,573,3102,536642
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u7.belt2_light_barrier_false==1)&&(i0.u7.DB_deliver_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u7.belt2_light_barrier_false==1)&&(i0.u7.DB_deliver_run==1)))))] = FALSE
(forward)formula 43,1,2.64339,88148,1,0,211948,1205,1445,189098,573,3102,548635
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u8.belt1_light_barrier_true==1)&&(i2.u8.FB_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u8.belt1_light_barrier_true==1)&&(i2.u8.FB_trans_run==1)))))] = FALSE
(forward)formula 44,1,2.71952,91580,1,0,220982,1218,1449,196377,573,3187,574030
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.A2U_in==1)&&(u9.arm1_pick_up_angle==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.A2U_in==1)&&(u9.arm1_pick_up_angle==1)))))] = FALSE
(forward)formula 45,1,2.72426,91844,1,0,221133,1218,1452,196594,573,3187,574614
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.A2U_in==1)&&(u10.arm1_release_angle==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.A2U_in==1)&&(u10.arm1_release_angle==1)))))] = FALSE
(forward)formula 46,1,2.72879,91844,1,0,221265,1218,1454,196782,573,3187,575110
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.A2U_in==1)&&(u11.arm2_pick_up_angle==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.A2U_in==1)&&(u11.arm2_pick_up_angle==1)))))] = FALSE
(forward)formula 47,1,2.73357,92108,1,0,221397,1218,1456,197011,573,3187,575611
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm2_release_angle==1)&&(u13.A2U_rot1_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle==1)&&(u13.A2U_rot1_run==1)))))] = FALSE
(forward)formula 48,1,2.73928,92108,1,0,221640,1218,1460,197417,575,3187,576113
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm2_release_angle==1)&&(u13.A2U_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle==1)&&(u13.A2U_rot2_run==1)))))] = FALSE
(forward)formula 49,1,2.74384,92372,1,0,221852,1218,1464,197748,577,3187,576586
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm2_release_angle==1)&&(u13.A2U_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle==1)&&(u13.A2U_rot3_run==1)))))] = FALSE
(forward)formula 50,1,2.74934,92636,1,0,222093,1218,1468,198205,579,3187,577057
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_release_ext==1)&&(u13.A2U_ext_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_release_ext==1)&&(u13.A2U_ext_run==1)))))] = FALSE
(forward)formula 51,1,2.75439,92636,1,0,222199,1218,1470,198500,579,3187,577542
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_retract_ext==1)&&(u12.A2U_ret_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_retract_ext==1)&&(u12.A2U_ret_run==1)))))] = FALSE
(forward)formula 52,1,2.76406,92900,1,0,222848,1218,1472,199273,579,3187,579763
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle==1)&&(u11.A2L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle==1)&&(u11.A2L_in==1)))))] = FALSE
(forward)formula 53,1,2.7758,93164,1,0,223408,1218,1475,200001,579,3187,581862
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm1_release_angle==1)&&(u11.A2L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_release_angle==1)&&(u11.A2L_in==1)))))] = FALSE
(forward)formula 54,1,2.78462,93428,1,0,223874,1218,1477,200565,579,3187,583558
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm2_release_angle==1)&&(u11.A2L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle==1)&&(u11.A2L_in==1)))))] = FALSE
(forward)formula 55,1,2.79212,93692,1,0,224279,1218,1479,201017,579,3187,585084
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 56,1,2.80414,93956,1,0,224856,1218,1481,201831,579,3187,587100
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 57,1,2.81628,94220,1,0,225461,1218,1483,202694,579,3187,589099
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 58,1,2.82964,94748,1,0,226060,1218,1485,203604,579,3187,591159
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_pick_up_ext==1)&&(u11.A2L_ext_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_pick_up_ext==1)&&(u11.A2L_ext_run==1)))))] = FALSE
(forward)formula 59,1,2.84257,95012,1,0,226634,1218,1487,204455,579,3187,593353
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_retract_ext==1)&&(u12.A2L_ret_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_retract_ext==1)&&(u12.A2L_ret_run==1)))))] = FALSE
(forward)formula 60,1,2.85576,95540,1,0,227336,1218,1491,205419,581,3187,595834
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm1_release_angle==1)&&(u9.A1L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_release_angle==1)&&(u9.A1L_in==1)))))] = FALSE
(forward)formula 61,1,2.86504,95804,1,0,227766,1218,1494,205934,581,3187,597495
Formula is TRUE !
***************************************
original formula: AG(EF(((u11.arm2_pick_up_angle==1)&&(u9.A1L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.arm2_pick_up_angle==1)&&(u9.A1L_in==1)))))] = FALSE
(forward)formula 62,1,2.87526,96068,1,0,228231,1218,1496,206563,581,3187,599340
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm2_release_angle==1)&&(u9.A1L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_release_angle==1)&&(u9.A1L_in==1)))))] = FALSE
(forward)formula 63,1,2.88289,96332,1,0,228641,1218,1498,206989,581,3187,600940
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle==1)&&(u9.A1L_rot1_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle==1)&&(u9.A1L_rot1_run==1)))))] = FALSE
(forward)formula 64,1,2.89354,96596,1,0,229103,1218,1502,207699,583,3189,602605
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle==1)&&(u9.A1L_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle==1)&&(u9.A1L_rot2_run==1)))))] = FALSE
(forward)formula 65,1,2.90385,96860,1,0,229581,1218,1504,208405,583,3189,604380
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle==1)&&(u9.A1L_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle==1)&&(u9.A1L_rot3_run==1)))))] = FALSE
(forward)formula 66,1,2.91506,97388,1,0,230078,1218,1508,209166,585,3189,606012
Formula is TRUE !
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:213)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-27 08:13:34] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:13:34] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:13:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1345776713245532890.gal : 2 ms
[2024-05-27 08:13:34] [INFO ] Time to serialize properties into /tmp/CTLFireability14775189158884801044.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1345776713245532890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14775189158884801044.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 17 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.075596,5764,2,1815,5,9797,6,0,433,8324,0
Converting to forward existential form...Done !
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
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,0.948385,32928,1,0,240,180553,209,129,2655,114504,281
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 1,1,1.0475,36360,1,0,298,199725,210,159,2658,130786,361
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 2,1,1.6304,51608,1,0,372,296775,211,204,2661,203411,477
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 3,1,2.18735,67184,1,0,464,414509,212,261,2663,291049,623
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 4,1,2.84247,86668,1,0,550,539967,213,314,2665,384185,759
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 5,1,3.31164,99008,1,0,606,607514,214,347,2668,438980,845
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 6,1,3.52223,105608,1,0,662,647219,215,380,2670,471244,931
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 7,1,4.06837,115640,1,0,718,717691,216,413,2672,526942,1017
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 8,1,4.49698,126464,1,0,774,803150,217,446,2675,591818,1103
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 9,1,5.04836,135968,1,0,828,866669,218,478,2677,645009,1184
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 10,1,5.162,139928,1,0,881,893635,219,510,2680,666172,1266
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 11,1,5.18639,140720,1,0,935,897883,220,543,2683,671486,1352
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 12,1,5.22743,142040,1,0,989,905803,221,576,2686,679080,1438
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 13,1,5.43269,149168,1,0,1042,953007,222,609,2689,714857,1524
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 14,1,5.48265,150488,1,0,1095,963134,223,642,2692,724668,1610
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 15,1,5.53075,152072,1,0,1147,972700,224,674,2694,733298,1692
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 16,1,5.60067,154184,1,0,1202,988362,225,706,2697,746038,1774
Formula is TRUE !
***************************************
Able to resolve query Liveness after proving 94 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 48713 ms.
BK_STOP 1716797621095
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r286-smll-171654422600024"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;