About the Execution of ITS-Tools for ParamProductionCell-PT-3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
902.495 | 60337.00 | 79764.00 | 607.00 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r275-smll-167863547500244.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r275-smll-167863547500244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME Liveness
=== Now, execution of the tool begins
BK_START 1678866663674
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=itstools
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 202303021504
[2023-03-15 07:51:06] [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]
[2023-03-15 07:51:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:51:07] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-15 07:51:07] [INFO ] Transformed 231 places.
[2023-03-15 07:51:07] [INFO ] Transformed 202 transitions.
[2023-03-15 07:51:07] [INFO ] Found NUPN structural information;
[2023-03-15 07:51:07] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 309 ms.
Built sparse matrix representations for Structural reductions in 14 ms.16771KB 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 54 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 54 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
[2023-03-15 07:51:07] [INFO ] Computed 59 place invariants in 41 ms
[2023-03-15 07:51:07] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-15 07:51:07] [INFO ] Invariant cache hit.
[2023-03-15 07:51:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 07:51:08] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
[2023-03-15 07:51:08] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 07:51:08] [INFO ] Invariant cache hit.
[2023-03-15 07:51:08] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1550 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2148 ms (no deadlock found). (steps per millisecond=581 )
Random directed walk for 1250000 steps, including 0 resets, run took 1489 ms (no deadlock found). (steps per millisecond=839 )
[2023-03-15 07:51:12] [INFO ] Invariant cache hit.
[2023-03-15 07:51:12] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2023-03-15 07:51:12] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 207 ms returned sat
[2023-03-15 07:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:51:14] [INFO ] [Real]Absence check using state equation in 1082 ms returned sat
[2023-03-15 07:51:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:51:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2023-03-15 07:51:14] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 28 ms returned sat
[2023-03-15 07:51:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:51:15] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2023-03-15 07:51:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 07:51:15] [INFO ] [Nat]Added 68 Read/Feed constraints in 64 ms returned sat
[2023-03-15 07:51:15] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 6 ms to minimize.
[2023-03-15 07:51:15] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 2 ms to minimize.
[2023-03-15 07:51:15] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 2 ms to minimize.
[2023-03-15 07:51:15] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2023-03-15 07:51:16] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2023-03-15 07:51:16] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2023-03-15 07:51:16] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2023-03-15 07:51:16] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2023-03-15 07:51:16] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2023-03-15 07:51:16] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-15 07:51:16] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2023-03-15 07:51:17] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2023-03-15 07:51:17] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 1 ms to minimize.
[2023-03-15 07:51:17] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2023-03-15 07:51:17] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 0 ms to minimize.
[2023-03-15 07:51:17] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2023-03-15 07:51:17] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2023-03-15 07:51:18] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2023-03-15 07:51:18] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 1 ms to minimize.
[2023-03-15 07:51:18] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3205 ms
[2023-03-15 07:51:18] [INFO ] Computed and/alt/rep : 194/512/194 causal constraints (skipped 5 transitions) in 30 ms.
[2023-03-15 07:51:20] [INFO ] Added : 193 causal constraints over 39 iterations in 2310 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 65 ms.
Parikh directed walk for 45800 steps, including 569 resets, run took 196 ms. (steps per millisecond=233 )
Random directed walk for 500001 steps, including 0 resets, run took 735 ms (no deadlock found). (steps per millisecond=680 )
Random walk for 500000 steps, including 0 resets, run took 744 ms (no deadlock found). (steps per millisecond=672 )
Random directed walk for 500001 steps, including 0 resets, run took 603 ms (no deadlock found). (steps per millisecond=829 )
Random walk for 500000 steps, including 0 resets, run took 775 ms (no deadlock found). (steps per millisecond=645 )
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.
[2023-03-15 07:51:23] [INFO ] Invariant cache hit.
[2023-03-15 07:51:23] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-15 07:51:23] [INFO ] Invariant cache hit.
[2023-03-15 07:51:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 07:51:24] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-15 07:51:24] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 07:51:24] [INFO ] Invariant cache hit.
[2023-03-15 07:51:24] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 728 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2178 ms (no deadlock found). (steps per millisecond=573 )
Random directed walk for 1250001 steps, including 0 resets, run took 2016 ms (no deadlock found). (steps per millisecond=620 )
[2023-03-15 07:51:28] [INFO ] Invariant cache hit.
[2023-03-15 07:51:28] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2023-03-15 07:51:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 207 ms returned sat
[2023-03-15 07:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:51:30] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2023-03-15 07:51:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:51:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2023-03-15 07:51:30] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 50 ms returned sat
[2023-03-15 07:51:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:51:31] [INFO ] [Nat]Absence check using state equation in 1002 ms returned sat
[2023-03-15 07:51:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 07:51:31] [INFO ] [Nat]Added 68 Read/Feed constraints in 34 ms returned sat
[2023-03-15 07:51:31] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-15 07:51:31] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-15 07:51:31] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2023-03-15 07:51:31] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2023-03-15 07:51:31] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2023-03-15 07:51:32] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2023-03-15 07:51:32] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2023-03-15 07:51:32] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-15 07:51:32] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 0 ms to minimize.
[2023-03-15 07:51:32] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-15 07:51:32] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2023-03-15 07:51:32] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2023-03-15 07:51:32] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2023-03-15 07:51:33] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2023-03-15 07:51:33] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2023-03-15 07:51:33] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2023-03-15 07:51:33] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2023-03-15 07:51:33] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-15 07:51:33] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2023-03-15 07:51:33] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2273 ms
[2023-03-15 07:51:33] [INFO ] Computed and/alt/rep : 194/512/194 causal constraints (skipped 5 transitions) in 14 ms.
[2023-03-15 07:51:35] [INFO ] Added : 193 causal constraints over 39 iterations in 1571 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 41 ms.
Parikh directed walk for 45800 steps, including 579 resets, run took 168 ms. (steps per millisecond=272 )
Random directed walk for 500000 steps, including 0 resets, run took 880 ms (no deadlock found). (steps per millisecond=568 )
Random walk for 500000 steps, including 0 resets, run took 732 ms (no deadlock found). (steps per millisecond=683 )
Random directed walk for 500002 steps, including 0 resets, run took 567 ms (no deadlock found). (steps per millisecond=881 )
Random walk for 500000 steps, including 0 resets, run took 734 ms (no deadlock found). (steps per millisecond=681 )
[2023-03-15 07:51:38] [INFO ] Flatten gal took : 81 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 19 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 199 cols
[2023-03-15 07:51:38] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-15 07:51:39] [INFO ] Implicit Places using invariants in 484 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 494 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 2 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 0 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
[2023-03-15 07:51:39] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 07:51:39] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-15 07:51:39] [INFO ] Invariant cache hit.
[2023-03-15 07:51:39] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 07:51:39] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 511 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 1046 ms. Remains : 84/231 places, 94/202 transitions.
Initial state reduction rules removed 2 formulas.
[2023-03-15 07:51:39] [INFO ] Flatten gal took : 22 ms
[2023-03-15 07:51:39] [INFO ] Flatten gal took : 27 ms
[2023-03-15 07:51:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1421626959513468890.gal : 29 ms
[2023-03-15 07:51:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16552021580185743860.prop : 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1421626959513468890.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16552021580185743860.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16552021580185743860.prop.
Finished random walk after 772 steps, including 0 resets, run visited all 92 properties in 299 ms. (steps per millisecond=2 )
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)
Able to resolve query QuasiLiveness after proving 94 properties.
Reachability property qltransition_90 is true.
Starting structural reductions in LIVENESS mode, iteration 0 : 231/231 places, 202/202 transitions.
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.
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
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.
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
SDD proceeding with computation,85 properties remain. new max is 2
SDD size :12 after 16
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Reachability property qltransition_8 is true.
SDD proceeding with computation,84 properties remain. new max is 2
SDD size :16 after 24
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 64 place count 199 transition count 170
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
Applied a total of 64 rules in 26 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
Reachability property qltransition_76 is true.
// Phase 1: matrix 170 rows 199 cols
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
[2023-03-15 07:51:40] [INFO ] Computed 59 place invariants in 15 ms
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
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
Reachability property qltransition_60 is true.
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
Reachability property qltransition_62 is true.
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
Reachability property qltransition_49 is true.
Reachability property qltransition_40 is true.
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
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
SDD proceeding with computation,39 properties remain. new max is 32
SDD size :113 after 116
SDD proceeding with computation,39 properties remain. new max is 64
SDD size :116 after 127
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.319011,8412,2,1597,133,10114,6,0,433,3563,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.319767,8412,2,85,133,10114,7,0,439,3563,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.320458,8676,2,85,133,10114,8,0,442,3563,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.320793,8676,2,85,133,10114,9,0,447,3563,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.321282,8676,2,155,133,10114,10,0,450,3563,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.321809,8676,2,391,133,10114,11,0,455,3563,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.322448,8676,2,447,133,10114,12,0,460,3563,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.323188,8676,2,447,133,10114,13,0,463,3563,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.323832,8676,2,525,133,10114,14,0,466,3563,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.324614,8676,2,525,133,10114,15,0,467,3563,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.325208,8676,2,162,133,10114,16,0,472,3563,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.325923,8676,2,162,133,10114,17,0,477,3563,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.326679,8676,2,113,133,10114,18,0,482,3563,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.327359,8676,2,113,133,10114,19,0,487,3563,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.328538,8676,2,85,133,10114,20,0,492,3563,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.329414,8676,2,85,133,10114,21,0,497,3563,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.330199,8676,2,85,133,10114,22,0,502,3563,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.330838,8676,2,85,133,10114,23,0,507,3563,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.331577,8676,2,85,133,10114,24,0,512,3563,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.33253,8676,2,85,133,10114,25,0,515,3563,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.333383,8676,2,85,133,10114,26,0,518,3563,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.334303,8676,2,85,133,10114,27,0,523,3563,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.334713,8676,2,85,133,10114,28,0,526,3563,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.335077,8676,2,85,133,10114,29,0,531,3563,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.335582,8676,2,85,133,10114,30,0,534,3563,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.336071,8676,2,85,133,10114,31,0,537,3563,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.336482,8676,2,85,133,10114,32,0,540,3563,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.336841,8676,2,85,133,10114,33,0,545,3563,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.337198,8676,2,85,133,10114,34,0,550,3563,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.337616,8676,2,85,133,10114,35,0,553,3563,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.338183,8676,2,85,133,10114,36,0,556,3563,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.338735,8676,2,85,133,10114,37,0,559,3563,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.339154,8676,2,85,133,10114,38,0,562,3563,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.339517,8676,2,85,133,10114,39,0,567,3563,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.339944,8676,2,627,133,10114,40,0,572,3563,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.340392,8676,2,627,133,10114,41,0,577,3563,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.340818,8676,2,627,133,10114,42,0,582,3563,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.341304,8676,2,562,133,10114,43,0,585,3563,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.342722,8676,2,632,133,10114,44,0,590,3563,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.343559,8676,2,562,133,10114,45,0,595,3563,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,57,0.344563,8676,2,423,133,10114,46,0,600,3563,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,2,0.345439,8676,2,87,133,10114,47,0,608,3563,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.3461,8676,2,85,133,10114,48,0,613,3563,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.347096,8676,2,1014,133,10114,49,0,618,3563,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.3479,8676,2,85,133,10114,50,0,623,3563,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.348696,8676,2,410,133,10114,51,0,628,3563,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.349546,8676,2,85,133,10114,52,0,633,3563,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.350275,8676,2,85,133,10114,53,0,634,3563,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.35085,8676,2,155,133,10114,54,0,635,3563,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.351394,8676,2,113,133,10114,55,0,638,3563,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.3522,8676,2,424,133,10114,56,0,641,3563,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.352814,8676,2,162,133,10114,57,0,642,3563,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.353554,8676,2,162,133,10114,58,0,643,3563,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.35444,8676,2,396,133,10114,59,0,644,3563,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.355435,8676,2,85,133,10114,60,0,647,3563,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.356458,8676,2,85,133,10114,61,0,648,3563,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.356878,8676,2,85,133,10114,62,0,649,3563,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.357667,8676,2,85,133,10114,63,0,650,3563,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.358708,8676,2,85,133,10114,64,0,651,3563,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.359166,8676,2,85,133,10114,65,0,652,3563,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.359551,8676,2,85,133,10114,66,0,653,3563,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.359921,8676,2,85,133,10114,67,0,654,3563,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.360504,8676,2,85,133,10114,68,0,657,3563,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.360914,8676,2,85,133,10114,69,0,658,3563,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.361486,8676,2,85,133,10114,70,0,659,3563,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.362077,8676,2,85,133,10114,71,0,660,3563,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.362521,8676,2,85,133,10114,72,0,661,3563,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.363083,8676,2,85,133,10114,73,0,662,3563,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.363452,8676,2,85,133,10114,74,0,663,3563,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.363827,8676,2,85,133,10114,75,0,664,3563,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.36434,8676,2,85,133,10114,76,0,667,3563,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.364801,8676,2,85,133,10114,77,0,668,3563,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.365177,8676,2,85,133,10114,78,0,669,3563,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.366196,8676,2,85,133,10114,79,0,670,3563,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.367049,8676,2,85,133,10114,80,0,671,3563,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.367785,8676,2,85,133,10114,81,0,672,3563,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.368516,8676,2,85,133,10114,82,0,673,3563,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.369274,8676,2,85,133,10114,83,0,674,3563,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.369952,8676,2,85,133,10114,84,0,677,3563,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.371001,8676,2,85,133,10114,85,0,678,3563,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.372049,8676,2,85,133,10114,86,0,679,3563,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.372921,8676,2,85,133,10114,87,0,680,3563,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.374165,8676,2,85,133,10114,88,0,681,3563,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.375255,8676,2,85,133,10114,89,0,682,3563,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.375901,8676,2,85,133,10114,90,0,683,3563,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.376668,8676,2,85,133,10114,91,0,684,3563,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.377482,8676,2,627,133,10114,92,0,685,3563,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.378488,8676,2,627,133,10114,93,0,686,3563,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.379316,8676,2,627,133,10114,94,0,687,3563,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.380036,8676,2,562,133,10114,95,0,688,3563,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.380494,8676,2,562,133,10114,96,0,689,3563,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.380964,8676,2,562,133,10114,97,0,690,3563,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.381849,8676,2,113,133,10114,98,0,691,3563,0
[2023-03-15 07:51:40] [INFO ] Implicit Places using invariants in 371 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 372 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 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 11 ms. Remains 84 /160 variables (removed 76) and now considering 94/170 (removed 76) transitions.
// Phase 1: matrix 94 rows 84 cols
[2023-03-15 07:51:40] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 07:51:40] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-15 07:51:40] [INFO ] Invariant cache hit.
[2023-03-15 07:51:40] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 07:51:40] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 318 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 729 ms. Remains : 84/231 places, 94/202 transitions.
[2023-03-15 07:51:40] [INFO ] Flatten gal took : 17 ms
[2023-03-15 07:51:40] [INFO ] Flatten gal took : 17 ms
[2023-03-15 07:51:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11448586477512993527.gal : 5 ms
[2023-03-15 07:51:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17112129557561141207.ctl : 5 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.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11448586477512993527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17112129557561141207.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/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.135564,5920,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.25083,36580,1,0,227,208613,209,129,2657,132189,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.63653,48360,1,0,279,283879,210,162,2659,187844,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.10214,59184,1,0,331,361550,211,196,2662,246502,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.60517,72384,1,0,383,455807,212,230,2664,314309,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.76353,77664,1,0,437,492637,213,264,2667,342810,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.77611,78192,1,0,491,494089,214,297,2670,345873,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.77951,78192,1,0,545,494181,215,331,2672,346221,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.81792,79248,1,0,599,502319,216,364,2674,353283,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.83803,79776,1,0,653,506091,217,398,2675,356413,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.85556,80304,1,0,707,509008,218,432,2678,359359,1055
Formula is TRUE !
Detected timeout of ITS tools.
[2023-03-15 07:51:43] [INFO ] Flatten gal took : 10 ms
[2023-03-15 07:51:43] [INFO ] Applying decomposition
[2023-03-15 07:51:43] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph2271538146807390642.txt' '-o' '/tmp/graph2271538146807390642.bin' '-w' '/tmp/graph2271538146807390642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2271538146807390642.bin' '-l' '-1' '-v' '-w' '/tmp/graph2271538146807390642.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:51:44] [INFO ] Decomposing Gal with order
[2023-03-15 07:51:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:51:44] [INFO ] Removed a total of 18 redundant transitions.
[2023-03-15 07:51:44] [INFO ] Flatten gal took : 54 ms
[2023-03-15 07:51:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-15 07:51:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12828413444093145991.gal : 5 ms
[2023-03-15 07:51:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4083880746713465261.ctl : 2 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.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12828413444093145991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4083880746713465261.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/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.06067,5284,304,116,2888,367,331,2712,104,1166,0
Converting to forward existential form...Done !
original formula: AG(EF(((i2.u6.belt2_light_barrier_false==1)&&(i2.u7.DB_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_false==1)&&(i2.u7.DB_trans_run==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions A2U_ret_Cstop_A2U_ret_Pstop_arm2_unlock_output_area_arm2_unlock_swivel_2, A2L_ret_Cstop_A2L_r...1772
(forward)formula 0,1,0.226071,10564,1,0,16390,926,1226,15653,494,2413,39025
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u6.belt2_light_barrier_true==1)&&(i2.u6.DB_deliver_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_true==1)&&(i2.u6.DB_deliver_run==1)))))] = FALSE
(forward)formula 1,1,0.321246,12676,1,0,21556,926,1237,20681,497,2413,54330
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u8.belt1_light_barrier_false==1)&&(i1.u8.FB_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u8.belt1_light_barrier_false==1)&&(i1.u8.FB_trans_run==1)))))] = FALSE
(forward)formula 2,1,0.505165,17692,1,0,34048,932,1247,30988,499,2464,84965
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u8.belt1_light_barrier_true==1)&&(i1.u8.FB_deliver_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u8.belt1_light_barrier_true==1)&&(i1.u8.FB_deliver_run==1)))))] = FALSE
(forward)formula 3,1,0.668804,21916,1,0,45140,938,1258,40024,502,2473,114147
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle==1)&&(u12.A2U_rot1_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle==1)&&(u12.A2U_rot1_run==1)))))] = FALSE
(forward)formula 4,1,0.771517,25612,1,0,54474,963,1262,48003,502,2564,138027
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm1_release_angle==1)&&(u12.A2U_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_release_angle==1)&&(u12.A2U_rot2_run==1)))))] = FALSE
(forward)formula 5,1,0.83651,27724,1,0,59570,970,1266,52779,502,2578,152028
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm2_pick_up_angle==1)&&(u12.A2U_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_pick_up_angle==1)&&(u12.A2U_rot3_run==1)))))] = FALSE
(forward)formula 6,1,0.866317,29044,1,0,62429,973,1272,55798,504,2594,160163
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u11.arm2_retract_ext==1)&&(u12.A2U_ext_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u11.arm2_retract_ext==1)&&(u12.A2U_ext_run==1)))))] = FALSE
(forward)formula 7,1,0.884358,29836,1,0,63694,973,1277,57458,504,2594,163967
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u11.arm2_release_ext==1)&&(i2.u11.A2U_ret_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u11.arm2_release_ext==1)&&(i2.u11.A2U_ret_run==1)))))] = FALSE
(forward)formula 8,1,0.898241,30100,1,0,64429,973,1287,58495,506,2594,166644
Formula is TRUE !
***************************************
original formula: AG(EF(((u9.arm1_pick_up_angle==1)&&(u13.A2L_rot1_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u9.arm1_pick_up_angle==1)&&(u13.A2L_rot1_run==1)))))] = FALSE
(forward)formula 9,1,0.956479,32740,1,0,70431,973,1290,64055,506,2595,183661
Formula is TRUE !
***************************************
original formula: AG(EF(((u10.arm1_release_angle==1)&&(u13.A2L_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u10.arm1_release_angle==1)&&(u13.A2L_rot2_run==1)))))] = FALSE
(forward)formula 10,1,0.995652,34324,1,0,74112,973,1293,67838,506,2596,193400
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_release_angle==1)&&(u13.A2L_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_release_angle==1)&&(u13.A2L_rot3_run==1)))))] = FALSE
(forward)formula 11,1,1.01194,34852,1,0,75047,973,1297,69114,506,2596,196493
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u11.arm2_retract_ext==1)&&(u13.A2L_ext_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u11.arm2_retract_ext==1)&&(u13.A2L_ext_run==1)))))] = FALSE
(forward)formula 12,1,1.03352,35644,1,0,76431,980,1300,71035,506,2609,200238
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u11.arm2_pick_up_ext==1)&&(i2.u11.A2L_ret_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u11.arm2_pick_up_ext==1)&&(i2.u11.A2L_ret_run==1)))))] = FALSE
(forward)formula 13,1,1.04817,36172,1,0,77165,980,1310,72115,508,2609,202889
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.11551,38284,1,0,81148,980,1313,76089,508,2609,214100
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm2_pick_up_angle==1)&&(u9.A1L_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_pick_up_angle==1)&&(u9.A1L_rot2_run==1)))))] = FALSE
(forward)formula 15,1,1.1503,39604,1,0,84607,980,1316,79501,508,2609,224724
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_release_angle==1)&&(u9.A1L_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_release_angle==1)&&(u9.A1L_rot3_run==1)))))] = FALSE
(forward)formula 16,1,1.18872,41188,1,0,88563,980,1319,83204,508,2610,235697
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.21042,41980,1,0,90218,982,1322,85233,508,2611,240683
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.22448,42508,1,0,90883,986,1324,86232,508,2612,243217
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.24966,43300,1,0,92684,986,1327,88475,508,2628,248513
Formula is TRUE !
***************************************
original formula: AG(EF(((u13.arm2_pick_up_angle==1)&&(u10.A1U_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u13.arm2_pick_up_angle==1)&&(u10.A1U_rot2_run==1)))))] = FALSE
(forward)formula 20,1,1.27789,44356,1,0,94665,987,1330,90861,508,2647,254630
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.arm2_release_angle==1)&&(u10.A1U_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.arm2_release_angle==1)&&(u10.A1U_rot3_run==1)))))] = FALSE
(forward)formula 21,1,1.30806,45676,1,0,97110,988,1333,93607,508,2656,261801
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.32526,46204,1,0,98350,1007,1336,95256,508,2675,265534
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.33375,46468,1,0,98829,1010,1341,95869,510,2676,267362
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u15.crane_release_height==1)&&(i8.u15.CU_lift_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u15.crane_release_height==1)&&(i8.u15.CU_lift_run==1)))))] = FALSE
(forward)formula 24,1,1.50755,50956,1,0,110191,1010,1352,105463,513,2677,295474
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u16.crane_above_feed_belt==1)&&(i8.u15.CU_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_above_feed_belt==1)&&(i8.u15.CU_trans_run==1)))))] = FALSE
(forward)formula 25,1,1.59954,55180,1,0,121085,1013,1359,114693,513,2680,322020
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u15.crane_transport_height==1)&&(i8.u17.CU_lower_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u15.crane_transport_height==1)&&(i8.u17.CU_lower_run==1)))))] = FALSE
(forward)formula 26,1,1.70115,59668,1,0,132746,1017,1366,124496,513,2682,350195
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u15.crane_transport_height==1)&&(i8.u18.CL_lower_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u15.crane_transport_height==1)&&(i8.u18.CL_lower_run==1)))))] = FALSE
(forward)formula 27,1,1.79323,63628,1,0,142385,1017,1372,132791,513,2682,374737
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u16.crane_above_deposit_belt==1)&&(i8.u15.CL_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u16.crane_above_deposit_belt==1)&&(i8.u15.CL_trans_run==1)))))] = FALSE
(forward)formula 28,1,1.87859,67060,1,0,151035,1023,1379,140319,513,2695,397647
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u15.crane_pick_up_height==1)&&(i8.u15.CL_lift_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u15.crane_pick_up_height==1)&&(i8.u15.CL_lift_run==1)))))] = FALSE
(forward)formula 29,1,2.02221,72076,1,0,159954,1026,1386,148096,513,2703,421856
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u7.ch_DC_free==1)&&(i2.u7.ch_A2D_full==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u7.ch_DC_free==1)&&(i2.u7.ch_A2D_full==1)))))] = FALSE
(forward)formula 30,1,2.06841,73396,1,0,164487,1026,1394,152307,515,2703,435088
Formula is TRUE !
***************************************
original formula: AG(EF((((i2.u6.ch_A2D_free==1)&&(u14.swivel==1))&&(i2.u11.arm2_storing==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i2.u6.ch_A2D_free==1)&&(u14.swivel==1))&&(i2.u11.arm2_storing==1)))))] = FALSE
(forward)formula 31,1,2.08024,73660,1,0,165226,1026,1406,153175,515,2703,437655
Formula is TRUE !
***************************************
original formula: AG(EF((((i0.u1.ch_A1P_free==1)&&(u14.swivel==1))&&(u14.arm1_storing==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i0.u1.ch_A1P_free==1)&&(u14.swivel==1))&&(u14.arm1_storing==1)))))] = FALSE
(forward)formula 32,1,2.08874,73924,1,0,165649,1026,1416,153777,518,2703,439311
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u17.ch_CF_free==1)&&(i8.u17.crane_storing==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u17.ch_CF_free==1)&&(i8.u17.crane_storing==1)))))] = FALSE
(forward)formula 33,1,2.18253,77884,1,0,176433,1026,1424,162682,520,2703,465232
Formula is TRUE !
***************************************
original formula: AG(EF(((i8.u18.ch_DC_full==1)&&(i8.u18.crane_store_free==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i8.u18.ch_DC_full==1)&&(i8.u18.crane_store_free==1)))))] = FALSE
(forward)formula 34,1,2.26296,81316,1,0,184929,1026,1432,169881,520,2703,487314
Formula is TRUE !
***************************************
original formula: AG(EF((((u14.swivel==1)&&(i1.u5.TU_lift_rs==1))&&(u14.arm1_store_free==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u14.swivel==1)&&(i1.u5.TU_lift_rs==1))&&(u14.arm1_store_free==1)))))] = FALSE
(forward)formula 35,1,2.28045,81844,1,0,186226,1026,1439,171268,520,2703,491624
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u8.ch_CF_full==1)&&(i1.u4.TL_lower_rs==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u8.ch_CF_full==1)&&(i1.u4.TL_lower_rs==1)))))] = FALSE
(forward)formula 36,1,2.37889,86068,1,0,197115,1026,1445,179882,520,2703,518837
Formula is TRUE !
***************************************
original formula: AG(EF((((u14.swivel==1)&&(i0.u0.PU_lower_rs==1))&&(i2.u11.arm2_store_free==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((u14.swivel==1)&&(i0.u0.PU_lower_rs==1))&&(i2.u11.arm2_store_free==1)))))] = FA...158
(forward)formula 37,1,2.38631,86332,1,0,197435,1026,1453,180345,520,2703,520102
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u0.press_at_upper_pos==1)&&(i0.u0.forge_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u0.press_at_upper_pos==1)&&(i0.u0.forge_run==1)))))] = FALSE
(forward)formula 38,1,2.42356,87652,1,0,200749,1027,1460,183662,520,2709,527233
Formula is TRUE !
***************************************
original formula: AG(EF(((i0.u1.press_at_middle_pos==1)&&(i0.u1.PL_lower_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i0.u1.press_at_middle_pos==1)&&(i0.u1.PL_lower_run==1)))))] = FALSE
(forward)formula 39,1,2.45833,88972,1,0,203675,1027,1464,186705,520,2709,533711
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u2.table_load_angle==1)&&(i1.u4.TL_rot_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.table_load_angle==1)&&(i1.u4.TL_rot_run==1)))))] = FALSE
(forward)formula 40,1,2.62616,92404,1,0,212466,1027,1470,194123,520,2709,555385
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u2.table_unload_angle==1)&&(i1.u5.TU_rot_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.table_unload_angle==1)&&(i1.u5.TU_rot_run==1)))))] = FALSE
(forward)formula 41,1,2.71794,96364,1,0,222596,1027,1476,202061,520,2709,581420
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u6.belt2_light_barrier_true==1)&&(i2.u7.DB_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_true==1)&&(i2.u7.DB_trans_run==1)))))] = FALSE
(forward)formula 42,1,2.77778,98476,1,0,227754,1027,1480,207044,520,2709,596720
Formula is TRUE !
***************************************
original formula: AG(EF(((i2.u6.belt2_light_barrier_false==1)&&(i2.u6.DB_deliver_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u6.belt2_light_barrier_false==1)&&(i2.u6.DB_deliver_run==1)))))] = FALSE
(forward)formula 43,1,2.89307,100852,1,0,232723,1027,1484,211535,520,2709,611646
Formula is TRUE !
***************************************
original formula: AG(EF(((i1.u8.belt1_light_barrier_true==1)&&(i1.u8.FB_trans_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u8.belt1_light_barrier_true==1)&&(i1.u8.FB_trans_run==1)))))] = FALSE
(forward)formula 44,1,2.99402,105076,1,0,243640,1033,1490,220287,522,2753,641115
Formula is TRUE !
***************************************
original formula: AG(EF(((u12.A2U_in==1)&&(u9.arm1_pick_up_angle==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u12.A2U_in==1)&&(u9.arm1_pick_up_angle==1)))))] = FALSE
(forward)formula 45,1,3.00577,105340,1,0,244142,1033,1493,221017,522,2753,643113
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.
[2023-03-15 07:51:47] [INFO ] Flatten gal took : 10 ms
[2023-03-15 07:51:47] [INFO ] Flatten gal took : 9 ms
[2023-03-15 07:51:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16512308980697466193.gal : 2 ms
[2023-03-15 07:51:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15050993301102974912.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.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16512308980697466193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15050993301102974912.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 38 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.080556,6024,2,1815,5,9797,6,0,433,8324,0
Converting to forward existential form...Done !
original formula: AG(EF(((A2U_in==1)&&(arm1_release_angle==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((A2U_in==1)&&(arm1_release_angle==1)))))] = FALSE
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.46706,42840,1,0,262,248180,209,149,2656,161429,331
Formula is TRUE !
***************************************
original formula: AG(EF(((A2U_in==1)&&(arm2_pick_up_angle==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((A2U_in==1)&&(arm2_pick_up_angle==1)))))] = FALSE
(forward)formula 1,1,2.01219,56956,1,0,319,339542,210,182,2658,232536,417
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_angle==1)&&(A2U_rot1_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle==1)&&(A2U_rot1_run==1)))))] = FALSE
(forward)formula 2,1,2.27746,64876,1,0,383,399166,211,215,2661,278089,503
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_angle==1)&&(A2U_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle==1)&&(A2U_rot2_run==1)))))] = FALSE
(forward)formula 3,1,2.61029,72532,1,0,440,445795,212,248,2663,315992,589
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_angle==1)&&(A2U_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle==1)&&(A2U_rot3_run==1)))))] = FALSE
(forward)formula 4,1,2.9389,83356,1,0,495,516942,213,280,2665,374492,670
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_ext==1)&&(A2U_ext_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_ext==1)&&(A2U_ext_run==1)))))] = FALSE
(forward)formula 5,1,3.46032,97572,1,0,552,604005,214,313,2668,441307,756
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_retract_ext==1)&&(A2U_ret_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_retract_ext==1)&&(A2U_ret_run==1)))))] = FALSE
(forward)formula 6,1,3.80315,109916,1,0,606,667954,215,344,2671,494551,837
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_angle==1)&&(A2L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle==1)&&(A2L_in==1)))))] = FALSE
(forward)formula 7,1,4.48061,124432,1,0,692,781094,216,397,2674,579595,973
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_release_angle==1)&&(A2L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle==1)&&(A2L_in==1)))))] = FALSE
(forward)formula 8,1,5.3807,140272,1,0,763,897260,217,440,2675,667632,1084
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_angle==1)&&(A2L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle==1)&&(A2L_in==1)))))] = FALSE
(forward)formula 9,1,5.8248,151888,1,0,823,980023,218,476,2676,731253,1175
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_angle==1)&&(A2L_rot1_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle==1)&&(A2L_rot1_run==1)))))] = FALSE
(forward)formula 10,1,6.06975,158488,1,0,879,1.0199e+06,219,509,2678,763800,1261
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_angle==1)&&(A2L_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle==1)&&(A2L_rot2_run==1)))))] = FALSE
(forward)formula 11,1,6.6248,171996,1,0,935,1.10316e+06,220,542,2680,829149,1347
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_angle==1)&&(A2L_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle==1)&&(A2L_rot3_run==1)))))] = FALSE
(forward)formula 12,1,7.23037,182556,1,0,991,1.1716e+06,221,575,2682,883155,1433
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_ext==1)&&(A2L_ext_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_ext==1)&&(A2L_ext_run==1)))))] = FALSE
(forward)formula 13,1,7.72006,198328,1,0,1047,1.2643e+06,222,608,2685,952808,1519
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_retract_ext==1)&&(A2L_ret_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_retract_ext==1)&&(A2L_ret_run==1)))))] = FALSE
(forward)formula 14,1,8.09495,208096,1,0,1101,1.3297e+06,223,640,2687,1.00781e+06,1600
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_release_angle==1)&&(A1L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_release_angle==1)&&(A1L_in==1)))))] = FALSE
(forward)formula 15,1,8.66974,222616,1,0,1190,1.42462e+06,224,689,2689,1.08041e+06,1726
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_pick_up_angle==1)&&(A1L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_pick_up_angle==1)&&(A1L_in==1)))))] = FALSE
(forward)formula 16,1,9.34991,233108,1,0,1262,1.48403e+06,225,730,2690,1.12597e+06,1832
Formula is TRUE !
***************************************
original formula: AG(EF(((arm2_release_angle==1)&&(A1L_in==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm2_release_angle==1)&&(A1L_in==1)))))] = FALSE
(forward)formula 17,1,9.80833,243932,1,0,1328,1.57142e+06,226,767,2691,1.19253e+06,1928
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_angle==1)&&(A1L_rot1_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle==1)&&(A1L_rot1_run==1)))))] = FALSE
(forward)formula 18,1,9.91698,246572,1,0,1387,1.5886e+06,227,798,2693,1.2069e+06,2012
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_angle==1)&&(A1L_rot2_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle==1)&&(A1L_rot2_run==1)))))] = FALSE
(forward)formula 19,1,10.0321,248948,1,0,1447,1.60698e+06,228,831,2695,1.22165e+06,2098
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_angle==1)&&(A1L_rot3_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_angle==1)&&(A1L_rot3_run==1)))))] = FALSE
(forward)formula 20,1,10.2231,253436,1,0,1507,1.63778e+06,229,864,2697,1.24677e+06,2184
Formula is TRUE !
***************************************
original formula: AG(EF(((arm1_pick_up_ext==1)&&(A1L_ext_run==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((arm1_pick_up_ext==1)&&(A1L_ext_run==1)))))] = FALSE
(forward)formula 21,1,11.056,261092,1,0,1572,1.68834e+06,230,897,2700,1.2856e+06,2270
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 22,1,11.154,263732,1,0,1630,1.70669e+06,231,927,2703,1.30105e+06,2350
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 23,1,11.7626,277128,1,0,1698,1.79086e+06,232,968,2705,1.36657e+06,2456
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 24,1,12.1367,284256,1,0,1772,1.84327e+06,233,1013,2706,1.40684e+06,2572
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 25,1,12.6026,295872,1,0,1837,1.92681e+06,234,1052,2707,1.47091e+06,2673
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 26,1,12.9963,305904,1,0,1893,1.99435e+06,235,1085,2709,1.5258e+06,2759
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 27,1,13.2388,311976,1,0,1949,2.03406e+06,236,1118,2711,1.55807e+06,2845
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 28,1,13.6733,324288,1,0,2005,2.10453e+06,237,1151,2713,1.61386e+06,2931
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 29,1,14.683,337488,1,0,2061,2.18909e+06,238,1184,2716,1.67843e+06,3017
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 30,1,15.0431,347980,1,0,2115,2.25009e+06,239,1216,2718,1.73048e+06,3098
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 31,1,15.165,351676,1,0,2168,2.2745e+06,240,1248,2721,1.74962e+06,3180
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 32,1,15.1925,352204,1,0,2222,2.27874e+06,241,1281,2724,1.75477e+06,3266
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 33,1,15.2409,353524,1,0,2276,2.28649e+06,242,1314,2727,1.76223e+06,3352
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 34,1,15.4668,359860,1,0,2329,2.32954e+06,243,1347,2730,1.79542e+06,3438
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 35,1,15.5229,361180,1,0,2382,2.3396e+06,244,1380,2733,1.80519e+06,3524
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 36,1,15.5771,362500,1,0,2434,2.34896e+06,245,1412,2735,1.81362e+06,3606
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 37,1,15.6571,364612,1,0,2489,2.36424e+06,246,1444,2738,1.82595e+06,3688
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query Liveness after proving 94 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 56237 ms.
BK_STOP 1678866724011
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r275-smll-167863547500244"
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 ;