About the Execution of ITS-Tools for FlexibleBarrier-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16247.936 | 3600000.00 | 3334587.00 | 96647.50 | ???F???????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r102-smll-162075331000026.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331000026
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 141K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1621116568714
Running Version 0
[2021-05-15 22:09:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-15 22:09:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 22:09:32] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2021-05-15 22:09:32] [INFO ] Transformed 542 places.
[2021-05-15 22:09:32] [INFO ] Transformed 621 transitions.
[2021-05-15 22:09:32] [INFO ] Found NUPN structural information;
[2021-05-15 22:09:32] [INFO ] Parsed PT model containing 542 places and 621 transitions in 252 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
[2021-05-15 22:09:32] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-15 22:09:32] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-15 22:09:32] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-15 22:09:32] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-15 22:09:32] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-15 22:09:32] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-15 22:09:32] [INFO ] Reduced 1 identical enabling conditions.
Support contains 400 out of 542 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 507 transition count 586
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 507 transition count 586
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 506 transition count 585
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 506 transition count 585
Applied a total of 72 rules in 76 ms. Remains 506 /542 variables (removed 36) and now considering 585/621 (removed 36) transitions.
// Phase 1: matrix 585 rows 506 cols
[2021-05-15 22:09:32] [INFO ] Computed 8 place invariants in 38 ms
[2021-05-15 22:09:32] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 585 rows 506 cols
[2021-05-15 22:09:32] [INFO ] Computed 8 place invariants in 11 ms
[2021-05-15 22:09:33] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
// Phase 1: matrix 585 rows 506 cols
[2021-05-15 22:09:33] [INFO ] Computed 8 place invariants in 7 ms
[2021-05-15 22:09:34] [INFO ] Dead Transitions using invariants and state equation in 666 ms returned []
Finished structural reductions, in 1 iterations. Remains : 506/542 places, 585/621 transitions.
[2021-05-15 22:09:34] [INFO ] Flatten gal took : 131 ms
[2021-05-15 22:09:34] [INFO ] Flatten gal took : 56 ms
[2021-05-15 22:09:34] [INFO ] Input system was already deterministic with 585 transitions.
Incomplete random walk after 100000 steps, including 1936 resets, run finished after 449 ms. (steps per millisecond=222 ) properties (out of 98) seen :91
Running SMT prover for 7 properties.
// Phase 1: matrix 585 rows 506 cols
[2021-05-15 22:09:35] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-15 22:09:35] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-15 22:09:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:09:35] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2021-05-15 22:09:36] [INFO ] Computed and/alt/rep : 547/1079/547 causal constraints (skipped 37 transitions) in 85 ms.
[2021-05-15 22:09:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:09:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2021-05-15 22:09:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:09:36] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2021-05-15 22:09:36] [INFO ] Computed and/alt/rep : 547/1079/547 causal constraints (skipped 37 transitions) in 67 ms.
[2021-05-15 22:09:45] [INFO ] Added : 546 causal constraints over 110 iterations in 9024 ms. Result :sat
[2021-05-15 22:09:46] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-15 22:09:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:09:46] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2021-05-15 22:09:46] [INFO ] Computed and/alt/rep : 547/1079/547 causal constraints (skipped 37 transitions) in 56 ms.
[2021-05-15 22:09:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:09:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-15 22:09:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:09:46] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2021-05-15 22:09:47] [INFO ] Computed and/alt/rep : 547/1079/547 causal constraints (skipped 37 transitions) in 60 ms.
[2021-05-15 22:09:55] [INFO ] Added : 547 causal constraints over 110 iterations in 8938 ms. Result :sat
[2021-05-15 22:09:56] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2021-05-15 22:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:09:56] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2021-05-15 22:09:57] [INFO ] Deduced a trap composed of 182 places in 491 ms of which 10 ms to minimize.
[2021-05-15 22:09:57] [INFO ] Deduced a trap composed of 171 places in 395 ms of which 2 ms to minimize.
[2021-05-15 22:09:57] [INFO ] Deduced a trap composed of 184 places in 251 ms of which 2 ms to minimize.
[2021-05-15 22:09:58] [INFO ] Deduced a trap composed of 46 places in 429 ms of which 3 ms to minimize.
[2021-05-15 22:09:58] [INFO ] Deduced a trap composed of 18 places in 447 ms of which 2 ms to minimize.
[2021-05-15 22:09:59] [INFO ] Deduced a trap composed of 175 places in 373 ms of which 1 ms to minimize.
[2021-05-15 22:09:59] [INFO ] Deduced a trap composed of 206 places in 373 ms of which 1 ms to minimize.
[2021-05-15 22:09:59] [INFO ] Deduced a trap composed of 246 places in 327 ms of which 13 ms to minimize.
[2021-05-15 22:10:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3487 ms
[2021-05-15 22:10:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:10:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-15 22:10:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:00] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2021-05-15 22:10:00] [INFO ] Deduced a trap composed of 182 places in 223 ms of which 1 ms to minimize.
[2021-05-15 22:10:01] [INFO ] Deduced a trap composed of 171 places in 183 ms of which 2 ms to minimize.
[2021-05-15 22:10:01] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 1 ms to minimize.
[2021-05-15 22:10:01] [INFO ] Deduced a trap composed of 179 places in 157 ms of which 1 ms to minimize.
[2021-05-15 22:10:01] [INFO ] Deduced a trap composed of 189 places in 135 ms of which 0 ms to minimize.
[2021-05-15 22:10:01] [INFO ] Deduced a trap composed of 150 places in 133 ms of which 1 ms to minimize.
[2021-05-15 22:10:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1229 ms
[2021-05-15 22:10:01] [INFO ] Computed and/alt/rep : 547/1079/547 causal constraints (skipped 37 transitions) in 42 ms.
[2021-05-15 22:10:09] [INFO ] Deduced a trap composed of 95 places in 214 ms of which 1 ms to minimize.
[2021-05-15 22:10:10] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 1 ms to minimize.
[2021-05-15 22:10:10] [INFO ] Deduced a trap composed of 151 places in 185 ms of which 0 ms to minimize.
[2021-05-15 22:10:10] [INFO ] Deduced a trap composed of 155 places in 200 ms of which 1 ms to minimize.
[2021-05-15 22:10:11] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 1 ms to minimize.
[2021-05-15 22:10:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1653 ms
[2021-05-15 22:10:11] [INFO ] Added : 536 causal constraints over 108 iterations in 9849 ms. Result :sat
[2021-05-15 22:10:11] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-15 22:10:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:12] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2021-05-15 22:10:12] [INFO ] Deduced a trap composed of 154 places in 256 ms of which 1 ms to minimize.
[2021-05-15 22:10:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2021-05-15 22:10:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:10:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-15 22:10:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:12] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2021-05-15 22:10:13] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 1 ms to minimize.
[2021-05-15 22:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2021-05-15 22:10:13] [INFO ] Computed and/alt/rep : 547/1079/547 causal constraints (skipped 37 transitions) in 53 ms.
[2021-05-15 22:10:21] [INFO ] Added : 513 causal constraints over 103 iterations in 8175 ms. Result :sat
[2021-05-15 22:10:21] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-15 22:10:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:21] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2021-05-15 22:10:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:10:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-15 22:10:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:22] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2021-05-15 22:10:22] [INFO ] Deduced a trap composed of 150 places in 171 ms of which 1 ms to minimize.
[2021-05-15 22:10:23] [INFO ] Deduced a trap composed of 149 places in 192 ms of which 1 ms to minimize.
[2021-05-15 22:10:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 476 ms
[2021-05-15 22:10:23] [INFO ] Computed and/alt/rep : 547/1079/547 causal constraints (skipped 37 transitions) in 56 ms.
[2021-05-15 22:10:31] [INFO ] Deduced a trap composed of 41 places in 312 ms of which 1 ms to minimize.
[2021-05-15 22:10:32] [INFO ] Deduced a trap composed of 18 places in 383 ms of which 1 ms to minimize.
[2021-05-15 22:10:32] [INFO ] Deduced a trap composed of 173 places in 386 ms of which 1 ms to minimize.
[2021-05-15 22:10:33] [INFO ] Deduced a trap composed of 179 places in 277 ms of which 1 ms to minimize.
[2021-05-15 22:10:33] [INFO ] Deduced a trap composed of 150 places in 247 ms of which 1 ms to minimize.
[2021-05-15 22:10:34] [INFO ] Deduced a trap composed of 155 places in 337 ms of which 2 ms to minimize.
[2021-05-15 22:10:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2781 ms
[2021-05-15 22:10:34] [INFO ] Added : 522 causal constraints over 105 iterations in 11519 ms. Result :sat
[2021-05-15 22:10:34] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-15 22:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:35] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2021-05-15 22:10:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:10:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-15 22:10:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:35] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2021-05-15 22:10:35] [INFO ] Deduced a trap composed of 93 places in 174 ms of which 1 ms to minimize.
[2021-05-15 22:10:36] [INFO ] Deduced a trap composed of 102 places in 226 ms of which 1 ms to minimize.
[2021-05-15 22:10:36] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 1 ms to minimize.
[2021-05-15 22:10:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 736 ms
[2021-05-15 22:10:36] [INFO ] Computed and/alt/rep : 547/1079/547 causal constraints (skipped 37 transitions) in 49 ms.
[2021-05-15 22:10:44] [INFO ] Added : 515 causal constraints over 103 iterations in 8179 ms. Result :sat
[2021-05-15 22:10:44] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2021-05-15 22:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:45] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2021-05-15 22:10:45] [INFO ] Deduced a trap composed of 160 places in 305 ms of which 1 ms to minimize.
[2021-05-15 22:10:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2021-05-15 22:10:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 22:10:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2021-05-15 22:10:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 22:10:45] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2021-05-15 22:10:46] [INFO ] Deduced a trap composed of 160 places in 360 ms of which 1 ms to minimize.
[2021-05-15 22:10:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2021-05-15 22:10:46] [INFO ] Computed and/alt/rep : 547/1079/547 causal constraints (skipped 37 transitions) in 56 ms.
[2021-05-15 22:10:55] [INFO ] Deduced a trap composed of 211 places in 394 ms of which 10 ms to minimize.
[2021-05-15 22:10:55] [INFO ] Deduced a trap composed of 204 places in 271 ms of which 2 ms to minimize.
[2021-05-15 22:10:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 954 ms
[2021-05-15 22:10:55] [INFO ] Added : 512 causal constraints over 103 iterations in 9385 ms. Result :sat
Graph (trivial) has 403 edges and 506 vertex of which 26 / 506 are part of one of the 4 SCC in 16 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 483 transition count 469
Reduce places removed 92 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 95 rules applied. Total rules applied 188 place count 391 transition count 466
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 191 place count 388 transition count 466
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 191 place count 388 transition count 414
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 295 place count 336 transition count 414
Discarding 150 places :
Symmetric choice reduction at 3 with 150 rule applications. Total rules 445 place count 186 transition count 264
Iterating global reduction 3 with 150 rules applied. Total rules applied 595 place count 186 transition count 264
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 595 place count 186 transition count 261
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 601 place count 183 transition count 261
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 622 place count 162 transition count 240
Iterating global reduction 3 with 21 rules applied. Total rules applied 643 place count 162 transition count 240
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 663 place count 162 transition count 220
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 735 place count 126 transition count 184
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 736 place count 125 transition count 183
Iterating global reduction 4 with 1 rules applied. Total rules applied 737 place count 125 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 738 place count 125 transition count 182
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 746 place count 121 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 747 place count 120 transition count 198
Applied a total of 747 rules in 246 ms. Remains 120 /506 variables (removed 386) and now considering 198/585 (removed 387) transitions.
[2021-05-15 22:10:56] [INFO ] Flatten gal took : 27 ms
[2021-05-15 22:10:56] [INFO ] Flatten gal took : 36 ms
[2021-05-15 22:10:56] [INFO ] Input system was already deterministic with 198 transitions.
[2021-05-15 22:10:56] [INFO ] Flatten gal took : 28 ms
[2021-05-15 22:10:56] [INFO ] Flatten gal took : 27 ms
[2021-05-15 22:10:56] [INFO ] Time to serialize gal into /tmp/CTLFireability15633999810488532525.gal : 13 ms
[2021-05-15 22:10:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15735822281651554749.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15633999810488532525.gal, -t, CGAL, -ctl, /tmp/CTLFireability15735822281651554749.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15633999810488532525.gal -t CGAL -ctl /tmp/CTLFireability15735822281651554749.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,5.15287e+08,2.00398,46636,2,12018,5,232156,6,0,676,151503,0
Converting to forward existential form...Done !
original formula: AF(AG(((((((((((p292==1)||(p326==1))||(p337==1))||(p466==1))||(p273==1))||(p336==1))||(p216==1))||(p63==1))||(p424==1))||((p133==1)&&(p527==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((((((((p292==1)||(p326==1))||(p337==1))||(p466==1))||(p273==1))||(p336==1))||(p216==1))||(p63==1))||(p424==1))||((p133==1)&&(p527==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t22, t107, t112, t116, t120, t160, t161, t188, t189, t190, t191, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/186/12/198
Detected timeout of ITS tools.
[2021-05-15 22:11:26] [INFO ] Flatten gal took : 14 ms
[2021-05-15 22:11:26] [INFO ] Applying decomposition
[2021-05-15 22:11:26] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17920514763918240051.txt, -o, /tmp/graph17920514763918240051.bin, -w, /tmp/graph17920514763918240051.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17920514763918240051.bin, -l, -1, -v, -w, /tmp/graph17920514763918240051.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 22:11:26] [INFO ] Decomposing Gal with order
[2021-05-15 22:11:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:11:26] [INFO ] Removed a total of 129 redundant transitions.
[2021-05-15 22:11:26] [INFO ] Flatten gal took : 69 ms
[2021-05-15 22:11:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 15 ms.
[2021-05-15 22:11:26] [INFO ] Time to serialize gal into /tmp/CTLFireability15204230225058754759.gal : 6 ms
[2021-05-15 22:11:26] [INFO ] Time to serialize properties into /tmp/CTLFireability584852712993748932.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15204230225058754759.gal, -t, CGAL, -ctl, /tmp/CTLFireability584852712993748932.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15204230225058754759.gal -t CGAL -ctl /tmp/CTLFireability584852712993748932.ctl
No direction supplied, using forward translation only.
Parsed 1 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,5.15287e+08,1.03012,30432,606,100,28233,2518,478,216439,268,3594,0
Converting to forward existential form...Done !
original formula: AF(AG(((((((((((i5.u13.p292==1)||(u14.p326==1))||(i5.u15.p337==1))||(i7.u19.p466==1))||(i3.u12.p273==1))||(i5.u15.p336==1))||(i3.u9.p216==1))||(i0.u2.p63==1))||(i7.u20.p424==1))||((u5.p133==1)&&(i7.u20.p527==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((((((((i5.u13.p292==1)||(u14.p326==1))||(i5.u15.p337==1))||(i7.u19.p466==1))||(i3.u12.p273==1))||(i5.u15.p336==1))||(i3.u9.p216==1))||(i0.u2.p63==1))||(i7.u20.p424==1))||((u5.p133==1)&&(i7.u20.p527==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t107, t120, t150, t190, i3.t112, i3.u12.t116, i7.t12, i7.u20.t22, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/159/8/167
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,4.62483,116000,1,0,103968,35263,2824,983329,1305,119256,215546
FORMULA FlexibleBarrier-PT-06b-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Graph (trivial) has 397 edges and 506 vertex of which 18 / 506 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 490 transition count 481
Reduce places removed 88 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 94 rules applied. Total rules applied 183 place count 402 transition count 475
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 189 place count 396 transition count 475
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 189 place count 396 transition count 422
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 295 place count 343 transition count 422
Discarding 147 places :
Symmetric choice reduction at 3 with 147 rule applications. Total rules 442 place count 196 transition count 275
Iterating global reduction 3 with 147 rules applied. Total rules applied 589 place count 196 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 591 place count 196 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 592 place count 195 transition count 273
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 592 place count 195 transition count 271
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 596 place count 193 transition count 271
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 616 place count 173 transition count 251
Iterating global reduction 5 with 20 rules applied. Total rules applied 636 place count 173 transition count 251
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 655 place count 173 transition count 232
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 733 place count 134 transition count 193
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 734 place count 133 transition count 192
Iterating global reduction 6 with 1 rules applied. Total rules applied 735 place count 133 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 736 place count 133 transition count 191
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 742 place count 130 transition count 195
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 743 place count 130 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 744 place count 129 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 745 place count 128 transition count 193
Applied a total of 745 rules in 104 ms. Remains 128 /506 variables (removed 378) and now considering 193/585 (removed 392) transitions.
[2021-05-15 22:11:31] [INFO ] Flatten gal took : 12 ms
[2021-05-15 22:11:31] [INFO ] Flatten gal took : 11 ms
[2021-05-15 22:11:31] [INFO ] Input system was already deterministic with 193 transitions.
[2021-05-15 22:11:31] [INFO ] Flatten gal took : 11 ms
[2021-05-15 22:11:31] [INFO ] Flatten gal took : 11 ms
[2021-05-15 22:11:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14796759784057559827.gal : 2 ms
[2021-05-15 22:11:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5986385053928837489.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14796759784057559827.gal, -t, CGAL, -ctl, /tmp/CTLFireability5986385053928837489.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14796759784057559827.gal -t CGAL -ctl /tmp/CTLFireability5986385053928837489.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,1.26855e+09,4.43558,93364,2,15701,5,449101,6,0,705,376463,0
Converting to forward existential form...Done !
original formula: AF(AG(A((((((((((p470==1)||(p454==1))||(p388==1))||(p279==1))||(p181==1))||(p322==1))||(p93==1))||((p325==1)&&(p539==1)))||((p260==1)&&(p539==1))) U ((((((((p391==1)||(p82==1))||(p434==1))||(p68==1))||(p181==1))||(p527==1))||(p140==1))||((p378==1)&&(p539==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!((E(!(((((((((p391==1)||(p82==1))||(p434==1))||(p68==1))||(p181==1))||(p527==1))||(p140==1))||((p378==1)&&(p539==1)))) U (!((((((((((p470==1)||(p454==1))||(p388==1))||(p279==1))||(p181==1))||(p322==1))||(p93==1))||((p325==1)&&(p539==1)))||((p260==1)&&(p539==1)))) * !(((((((((p391==1)||(p82==1))||(p434==1))||(p68==1))||(p181==1))||(p527==1))||(p140==1))||((p378==1)&&(p539==1)))))) + EG(!(((((((((p391==1)||(p82==1))||(p434==1))||(p68==1))||(p181==1))||(p527==1))||(p140==1))||((p378==1)&&(p539==1))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t83, t112, t117, t118, t130, t145, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/184/9/193
Detected timeout of ITS tools.
[2021-05-15 22:12:01] [INFO ] Flatten gal took : 14 ms
[2021-05-15 22:12:01] [INFO ] Applying decomposition
[2021-05-15 22:12:01] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph372444664804146824.txt, -o, /tmp/graph372444664804146824.bin, -w, /tmp/graph372444664804146824.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph372444664804146824.bin, -l, -1, -v, -w, /tmp/graph372444664804146824.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 22:12:01] [INFO ] Decomposing Gal with order
[2021-05-15 22:12:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:12:01] [INFO ] Removed a total of 95 redundant transitions.
[2021-05-15 22:12:01] [INFO ] Flatten gal took : 27 ms
[2021-05-15 22:12:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 8 ms.
[2021-05-15 22:12:01] [INFO ] Time to serialize gal into /tmp/CTLFireability6918065734811528797.gal : 18 ms
[2021-05-15 22:12:01] [INFO ] Time to serialize properties into /tmp/CTLFireability6054516927009425804.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6918065734811528797.gal, -t, CGAL, -ctl, /tmp/CTLFireability6054516927009425804.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6918065734811528797.gal -t CGAL -ctl /tmp/CTLFireability6054516927009425804.ctl
No direction supplied, using forward translation only.
Parsed 1 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,1.26855e+09,22.5569,418372,1233,1152,179709,131308,548,2.9756e+06,288,3.23372e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Graph (trivial) has 414 edges and 506 vertex of which 20 / 506 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 488 transition count 461
Reduce places removed 105 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 106 rules applied. Total rules applied 212 place count 383 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 382 transition count 460
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 213 place count 382 transition count 419
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 295 place count 341 transition count 419
Discarding 150 places :
Symmetric choice reduction at 3 with 150 rule applications. Total rules 445 place count 191 transition count 269
Iterating global reduction 3 with 150 rules applied. Total rules applied 595 place count 191 transition count 269
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 595 place count 191 transition count 266
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 601 place count 188 transition count 266
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 619 place count 170 transition count 248
Iterating global reduction 3 with 18 rules applied. Total rules applied 637 place count 170 transition count 248
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 654 place count 170 transition count 231
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 724 place count 135 transition count 196
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 726 place count 133 transition count 194
Iterating global reduction 4 with 2 rules applied. Total rules applied 728 place count 133 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 730 place count 133 transition count 192
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 740 place count 128 transition count 209
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 743 place count 128 transition count 206
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 745 place count 128 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 746 place count 127 transition count 205
Applied a total of 746 rules in 97 ms. Remains 127 /506 variables (removed 379) and now considering 205/585 (removed 380) transitions.
[2021-05-15 22:12:31] [INFO ] Flatten gal took : 11 ms
[2021-05-15 22:12:31] [INFO ] Flatten gal took : 12 ms
[2021-05-15 22:12:31] [INFO ] Input system was already deterministic with 205 transitions.
[2021-05-15 22:12:31] [INFO ] Flatten gal took : 20 ms
[2021-05-15 22:12:31] [INFO ] Flatten gal took : 11 ms
[2021-05-15 22:12:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6298552119121108090.gal : 15 ms
[2021-05-15 22:12:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5427188892384156042.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6298552119121108090.gal, -t, CGAL, -ctl, /tmp/CTLFireability5427188892384156042.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6298552119121108090.gal -t CGAL -ctl /tmp/CTLFireability5427188892384156042.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 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,1.36807e+09,0.904011,24724,2,5396,5,105855,6,0,712,70783,0
Converting to forward existential form...Done !
original formula: A((((((((((p356==1)||(p102==1))||(p149==1))||(p203==1))||(p269==1))||(p280==1))||(p298==1))||((p325==1)&&(p539==1)))||((p263==1)&&(p538==1))) U EG((((((((p65==0)&&(p112==0))&&(p262==0))&&(p275==0))&&(p201==0))&&(((p138==0)||(p169==0))||(p448==0)))&&((p372==0)||(p539==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((((((p65==0)&&(p112==0))&&(p262==0))&&(p275==0))&&(p201==0))&&(((p138==0)||(p169==0))||(p448==0)))&&((p372==0)||(p539==0)))))))) * !(E(!(EG((((((((p65==0)&&(p112==0))&&(p262==0))&&(p275==0))&&(p201==0))&&(((p138==0)||(p169==0))||(p448==0)))&&((p372==0)||(p539==0))))) U (!((((((((((p356==1)||(p102==1))||(p149==1))||(p203==1))||(p269==1))||(p280==1))||(p298==1))||((p325==1)&&(p539==1)))||((p263==1)&&(p538==1)))) * !(EG((((((((p65==0)&&(p112==0))&&(p262==0))&&(p275==0))&&(p201==0))&&(((p138==0)||(p169==0))||(p448==0)))&&((p372==0)||(p539==0)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 125/233/80
Detected timeout of ITS tools.
[2021-05-15 22:13:02] [INFO ] Flatten gal took : 23 ms
[2021-05-15 22:13:02] [INFO ] Applying decomposition
[2021-05-15 22:13:02] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph641287192320062273.txt, -o, /tmp/graph641287192320062273.bin, -w, /tmp/graph641287192320062273.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph641287192320062273.bin, -l, -1, -v, -w, /tmp/graph641287192320062273.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 22:13:02] [INFO ] Decomposing Gal with order
[2021-05-15 22:13:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:13:02] [INFO ] Removed a total of 134 redundant transitions.
[2021-05-15 22:13:02] [INFO ] Flatten gal took : 40 ms
[2021-05-15 22:13:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 7 ms.
[2021-05-15 22:13:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7699036190317951565.gal : 4 ms
[2021-05-15 22:13:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13453121509053944149.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7699036190317951565.gal, -t, CGAL, -ctl, /tmp/CTLFireability13453121509053944149.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7699036190317951565.gal -t CGAL -ctl /tmp/CTLFireability13453121509053944149.ctl
No direction supplied, using forward translation only.
Parsed 1 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,1.36807e+09,3.10356,68992,336,277,65208,46933,444,295553,269,503929,0
Converting to forward existential form...Done !
original formula: A((((((((((i7.u15.p356==1)||(i1.u4.p102==1))||(i2.u5.p149==1))||(i2.u5.p203==1))||(i4.u9.p269==1))||(i6.u11.p280==1))||(i6.u14.p298==1))||((i5.u12.p325==1)&&(i9.u19.p539==1)))||((i4.u9.p263==1)&&(i9.u19.p538==1))) U EG((((((((u1.p65==0)&&(i1.u2.p112==0))&&(u8.p262==0))&&(i4.u10.p275==0))&&(i2.u7.p201==0))&&(((i1.u4.p138==0)||(i2.u7.p169==0))||(u18.p448==0)))&&((i7.u16.p372==0)||(i9.u19.p539==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((((((u1.p65==0)&&(i1.u2.p112==0))&&(u8.p262==0))&&(i4.u10.p275==0))&&(i2.u7.p201==0))&&(((i1.u4.p138==0)||(i2.u7.p169==0))||(u18.p448==0)))&&((i7.u16.p372==0)||(i9.u19.p539==0)))))))) * !(E(!(EG((((((((u1.p65==0)&&(i1.u2.p112==0))&&(u8.p262==0))&&(i4.u10.p275==0))&&(i2.u7.p201==0))&&(((i1.u4.p138==0)||(i2.u7.p169==0))||(u18.p448==0)))&&((i7.u16.p372==0)||(i9.u19.p539==0))))) U (!((((((((((i7.u15.p356==1)||(i1.u4.p102==1))||(i2.u5.p149==1))||(i2.u5.p203==1))||(i4.u9.p269==1))||(i6.u11.p280==1))||(i6.u14.p298==1))||((i5.u12.p325==1)&&(i9.u19.p539==1)))||((i4.u9.p263==1)&&(i9.u19.p538==1)))) * !(EG((((((((u1.p65==0)&&(i1.u2.p112==0))&&(u8.p262==0))&&(i4.u10.p275==0))&&(i2.u7.p201==0))&&(((i1.u4.p138==0)||(i2.u7.p169==0))||(u18.p448==0)))&&((i7.u16.p372==0)||(i9.u19.p539==0)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
[2021-05-15 22:13:32] [INFO ] Flatten gal took : 26 ms
[2021-05-15 22:13:32] [INFO ] Flatten gal took : 30 ms
[2021-05-15 22:13:32] [INFO ] Applying decomposition
[2021-05-15 22:13:32] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5695028841273580361.txt, -o, /tmp/graph5695028841273580361.bin, -w, /tmp/graph5695028841273580361.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5695028841273580361.bin, -l, -1, -v, -w, /tmp/graph5695028841273580361.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 22:13:32] [INFO ] Decomposing Gal with order
[2021-05-15 22:13:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:13:32] [INFO ] Removed a total of 181 redundant transitions.
[2021-05-15 22:13:32] [INFO ] Flatten gal took : 99 ms
[2021-05-15 22:13:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 14 ms.
[2021-05-15 22:13:32] [INFO ] Time to serialize gal into /tmp/CTLFireability15629858794027022967.gal : 12 ms
[2021-05-15 22:13:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1567470857329975821.ctl : 9 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15629858794027022967.gal, -t, CGAL, -ctl, /tmp/CTLFireability1567470857329975821.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15629858794027022967.gal -t CGAL -ctl /tmp/CTLFireability1567470857329975821.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Detected timeout of ITS tools.
[2021-05-15 22:34:55] [INFO ] Applying decomposition
[2021-05-15 22:34:56] [INFO ] Flatten gal took : 588 ms
[2021-05-15 22:34:56] [INFO ] Decomposing Gal with order
[2021-05-15 22:34:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 22:34:56] [INFO ] Removed a total of 38 redundant transitions.
[2021-05-15 22:34:56] [INFO ] Flatten gal took : 375 ms
[2021-05-15 22:34:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 171 ms.
[2021-05-15 22:34:57] [INFO ] Time to serialize gal into /tmp/CTLFireability17857742005163256760.gal : 88 ms
[2021-05-15 22:34:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5703037995773258970.ctl : 76 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17857742005163256760.gal, -t, CGAL, -ctl, /tmp/CTLFireability5703037995773258970.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17857742005163256760.gal -t CGAL -ctl /tmp/CTLFireability5703037995773258970.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Detected timeout of ITS tools.
[2021-05-15 22:56:21] [INFO ] Flatten gal took : 502 ms
[2021-05-15 22:56:22] [INFO ] Input system was already deterministic with 585 transitions.
[2021-05-15 22:56:22] [INFO ] Transformed 506 places.
[2021-05-15 22:56:22] [INFO ] Transformed 585 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-15 22:56:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7116616202053949682.gal : 23 ms
[2021-05-15 22:56:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2665755593036522579.ctl : 25 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7116616202053949682.gal, -t, CGAL, -ctl, /tmp/CTLFireability2665755593036522579.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7116616202053949682.gal -t CGAL -ctl /tmp/CTLFireability2665755593036522579.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-06b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r102-smll-162075331000026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-06b.tgz
mv FlexibleBarrier-PT-06b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;