About the Execution of ITS-Tools for DES-PT-60b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7678.163 | 3600000.00 | 9740889.00 | 52446.50 | FFFFFTFFFFTFTFT? | 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.r064-tall-162038396800156.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-60b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396800156
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 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 139K 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 DES-PT-60b-00
FORMULA_NAME DES-PT-60b-01
FORMULA_NAME DES-PT-60b-02
FORMULA_NAME DES-PT-60b-03
FORMULA_NAME DES-PT-60b-04
FORMULA_NAME DES-PT-60b-05
FORMULA_NAME DES-PT-60b-06
FORMULA_NAME DES-PT-60b-07
FORMULA_NAME DES-PT-60b-08
FORMULA_NAME DES-PT-60b-09
FORMULA_NAME DES-PT-60b-10
FORMULA_NAME DES-PT-60b-11
FORMULA_NAME DES-PT-60b-12
FORMULA_NAME DES-PT-60b-13
FORMULA_NAME DES-PT-60b-14
FORMULA_NAME DES-PT-60b-15
=== Now, execution of the tool begins
BK_START 1620485335509
Running Version 0
[2021-05-08 14:48:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-08 14:48:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 14:48:57] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-08 14:48:57] [INFO ] Transformed 519 places.
[2021-05-08 14:48:57] [INFO ] Transformed 470 transitions.
[2021-05-08 14:48:57] [INFO ] Found NUPN structural information;
[2021-05-08 14:48:57] [INFO ] Parsed PT model containing 519 places and 470 transitions in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 14:48:57] [INFO ] Initial state test concluded for 1 properties.
FORMULA DES-PT-60b-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 519 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 470
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 493 transition count 447
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 493 transition count 447
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 479 transition count 433
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 479 transition count 433
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 87 place count 479 transition count 423
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 478 transition count 422
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 478 transition count 422
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 478 transition count 421
Applied a total of 90 rules in 145 ms. Remains 478 /519 variables (removed 41) and now considering 421/470 (removed 49) transitions.
// Phase 1: matrix 421 rows 478 cols
[2021-05-08 14:48:57] [INFO ] Computed 62 place invariants in 63 ms
[2021-05-08 14:48:58] [INFO ] Implicit Places using invariants in 434 ms returned []
// Phase 1: matrix 421 rows 478 cols
[2021-05-08 14:48:58] [INFO ] Computed 62 place invariants in 20 ms
[2021-05-08 14:48:58] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
// Phase 1: matrix 421 rows 478 cols
[2021-05-08 14:48:58] [INFO ] Computed 62 place invariants in 20 ms
[2021-05-08 14:48:58] [INFO ] Dead Transitions using invariants and state equation in 271 ms returned []
Finished structural reductions, in 1 iterations. Remains : 478/519 places, 421/470 transitions.
[2021-05-08 14:48:59] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-08 14:48:59] [INFO ] Flatten gal took : 73 ms
FORMULA DES-PT-60b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 14:48:59] [INFO ] Flatten gal took : 35 ms
[2021-05-08 14:48:59] [INFO ] Input system was already deterministic with 421 transitions.
Incomplete random walk after 100000 steps, including 870 resets, run finished after 416 ms. (steps per millisecond=240 ) properties (out of 16) seen :9
Running SMT prover for 7 properties.
// Phase 1: matrix 421 rows 478 cols
[2021-05-08 14:48:59] [INFO ] Computed 62 place invariants in 10 ms
[2021-05-08 14:48:59] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 14:48:59] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 25 ms returned sat
[2021-05-08 14:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:00] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2021-05-08 14:49:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 14:49:00] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 27 ms returned sat
[2021-05-08 14:49:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:00] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2021-05-08 14:49:00] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2021-05-08 14:49:00] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 3 ms to minimize.
[2021-05-08 14:49:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2021-05-08 14:49:00] [INFO ] Computed and/alt/rep : 415/951/415 causal constraints (skipped 5 transitions) in 52 ms.
[2021-05-08 14:49:02] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 14 ms to minimize.
[2021-05-08 14:49:03] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 2 ms to minimize.
[2021-05-08 14:49:03] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 1 ms to minimize.
[2021-05-08 14:49:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 751 ms
[2021-05-08 14:49:03] [INFO ] Added : 258 causal constraints over 52 iterations in 2715 ms. Result :sat
[2021-05-08 14:49:03] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-08 14:49:03] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 24 ms returned sat
[2021-05-08 14:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:03] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2021-05-08 14:49:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 14:49:03] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 24 ms returned sat
[2021-05-08 14:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:04] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-08 14:49:04] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2021-05-08 14:49:04] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2021-05-08 14:49:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2021-05-08 14:49:04] [INFO ] Computed and/alt/rep : 415/951/415 causal constraints (skipped 5 transitions) in 27 ms.
[2021-05-08 14:49:06] [INFO ] Added : 354 causal constraints over 71 iterations in 2112 ms. Result :sat
[2021-05-08 14:49:06] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 14:49:06] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 24 ms returned sat
[2021-05-08 14:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:06] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-08 14:49:06] [INFO ] Computed and/alt/rep : 415/951/415 causal constraints (skipped 5 transitions) in 30 ms.
[2021-05-08 14:49:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 14:49:06] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2021-05-08 14:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:07] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-08 14:49:07] [INFO ] Computed and/alt/rep : 415/951/415 causal constraints (skipped 5 transitions) in 27 ms.
[2021-05-08 14:49:09] [INFO ] Added : 348 causal constraints over 70 iterations in 2090 ms. Result :sat
[2021-05-08 14:49:09] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-08 14:49:09] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2021-05-08 14:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:09] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-08 14:49:09] [INFO ] Computed and/alt/rep : 415/951/415 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-08 14:49:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 14:49:09] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 21 ms returned sat
[2021-05-08 14:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:09] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2021-05-08 14:49:09] [INFO ] Computed and/alt/rep : 415/951/415 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-08 14:49:11] [INFO ] Added : 282 causal constraints over 57 iterations in 1712 ms. Result :sat
[2021-05-08 14:49:11] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 14:49:11] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 26 ms returned sat
[2021-05-08 14:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:11] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-08 14:49:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 14:49:12] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2021-05-08 14:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:12] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2021-05-08 14:49:12] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2021-05-08 14:49:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2021-05-08 14:49:12] [INFO ] Computed and/alt/rep : 415/951/415 causal constraints (skipped 5 transitions) in 26 ms.
[2021-05-08 14:49:14] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2021-05-08 14:49:14] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 0 ms to minimize.
[2021-05-08 14:49:14] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2021-05-08 14:49:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 408 ms
[2021-05-08 14:49:14] [INFO ] Added : 320 causal constraints over 66 iterations in 2296 ms. Result :sat
[2021-05-08 14:49:14] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2021-05-08 14:49:14] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2021-05-08 14:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:14] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-08 14:49:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 14:49:15] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2021-05-08 14:49:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:15] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-08 14:49:15] [INFO ] Computed and/alt/rep : 415/951/415 causal constraints (skipped 5 transitions) in 26 ms.
[2021-05-08 14:49:16] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2021-05-08 14:49:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2021-05-08 14:49:16] [INFO ] Added : 187 causal constraints over 38 iterations in 1265 ms. Result :sat
[2021-05-08 14:49:16] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2021-05-08 14:49:16] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2021-05-08 14:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:16] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-08 14:49:16] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2021-05-08 14:49:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2021-05-08 14:49:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 14:49:16] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2021-05-08 14:49:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:17] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-08 14:49:17] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2021-05-08 14:49:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2021-05-08 14:49:17] [INFO ] Computed and/alt/rep : 415/951/415 causal constraints (skipped 5 transitions) in 17 ms.
[2021-05-08 14:49:18] [INFO ] Added : 339 causal constraints over 68 iterations in 1795 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 478/478 places, 421/421 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 477 transition count 405
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 462 transition count 405
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 462 transition count 396
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 453 transition count 396
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 449 transition count 392
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 449 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 449 transition count 390
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 449 transition count 388
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 447 transition count 388
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 446 transition count 387
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 446 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 446 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 65 place count 446 transition count 385
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 445 transition count 385
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 3 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 223 place count 367 transition count 307
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 227 place count 365 transition count 309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 364 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 363 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 362 transition count 307
Applied a total of 230 rules in 190 ms. Remains 362 /478 variables (removed 116) and now considering 307/421 (removed 114) transitions.
// Phase 1: matrix 307 rows 362 cols
[2021-05-08 14:49:19] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-08 14:49:19] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 307 rows 362 cols
[2021-05-08 14:49:19] [INFO ] Computed 61 place invariants in 8 ms
[2021-05-08 14:49:19] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2021-05-08 14:49:19] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 307 rows 362 cols
[2021-05-08 14:49:19] [INFO ] Computed 61 place invariants in 10 ms
[2021-05-08 14:49:20] [INFO ] Dead Transitions using invariants and state equation in 180 ms returned []
Finished structural reductions, in 1 iterations. Remains : 362/478 places, 307/421 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s277 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 305 steps with 10 reset in 5 ms.
FORMULA DES-PT-60b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-00 finished in 1217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 478/478 places, 421/421 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 474 transition count 417
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 474 transition count 417
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 473 transition count 413
Applied a total of 13 rules in 24 ms. Remains 473 /478 variables (removed 5) and now considering 413/421 (removed 8) transitions.
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:49:20] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 14:49:20] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:49:20] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 14:49:21] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:49:21] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 14:49:21] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 473/478 places, 413/421 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s229 0) (NEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-01 finished in 1189 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||(G(p1)&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 478/478 places, 421/421 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 474 transition count 417
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 474 transition count 417
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 473 transition count 413
Applied a total of 13 rules in 30 ms. Remains 473 /478 variables (removed 5) and now considering 413/421 (removed 8) transitions.
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:49:21] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 14:49:21] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:49:21] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 14:49:22] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:49:22] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 14:49:22] [INFO ] Dead Transitions using invariants and state equation in 259 ms returned []
Finished structural reductions, in 1 iterations. Remains : 473/478 places, 413/421 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DES-PT-60b-02 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 4}, { cond=(NOT p1), acceptance={0} source=0 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(OR (EQ s329 0) (EQ s444 1)), p2:(OR (EQ s196 0) (EQ s300 1)), p0:(EQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3683 steps with 31 reset in 20 ms.
FORMULA DES-PT-60b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-02 finished in 1443 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 478/478 places, 421/421 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 477 transition count 405
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 462 transition count 405
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 462 transition count 395
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 452 transition count 395
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 448 transition count 391
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 448 transition count 391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 448 transition count 389
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 448 transition count 387
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 446 transition count 387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 445 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 445 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 445 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 67 place count 445 transition count 384
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 444 transition count 384
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 225 place count 366 transition count 306
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 229 place count 364 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 230 place count 363 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 231 place count 362 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 361 transition count 306
Applied a total of 232 rules in 99 ms. Remains 361 /478 variables (removed 117) and now considering 306/421 (removed 115) transitions.
// Phase 1: matrix 306 rows 361 cols
[2021-05-08 14:49:22] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-08 14:49:23] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 306 rows 361 cols
[2021-05-08 14:49:23] [INFO ] Computed 61 place invariants in 8 ms
[2021-05-08 14:49:23] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2021-05-08 14:49:23] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 306 rows 361 cols
[2021-05-08 14:49:23] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-08 14:49:23] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
Finished structural reductions, in 1 iterations. Remains : 361/478 places, 306/421 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s206 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-03 finished in 1075 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 478/478 places, 421/421 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 474 transition count 417
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 474 transition count 417
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 473 transition count 413
Applied a total of 13 rules in 23 ms. Remains 473 /478 variables (removed 5) and now considering 413/421 (removed 8) transitions.
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:49:23] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 14:49:24] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:49:24] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 14:49:24] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:49:24] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 14:49:25] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Finished structural reductions, in 1 iterations. Remains : 473/478 places, 413/421 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DES-PT-60b-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(AND (EQ s328 0) (EQ s75 1)), p1:(EQ s170 1), p0:(AND (NEQ s75 0) (NEQ s328 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-08 finished in 1230 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X((F(G(p1)) U (p2 U !p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 478/478 places, 421/421 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 476 transition count 419
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 476 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 476 transition count 418
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 475 transition count 417
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 475 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 475 transition count 416
Applied a total of 8 rules in 26 ms. Remains 475 /478 variables (removed 3) and now considering 416/421 (removed 5) transitions.
// Phase 1: matrix 416 rows 475 cols
[2021-05-08 14:49:25] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 14:49:25] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 416 rows 475 cols
[2021-05-08 14:49:25] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 14:49:26] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
// Phase 1: matrix 416 rows 475 cols
[2021-05-08 14:49:26] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 14:49:26] [INFO ] Dead Transitions using invariants and state equation in 221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 475/478 places, 416/421 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (NOT p1)]
Running random walk in product with property : DES-PT-60b-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s457 0) (EQ s88 1)), p1:(AND (NEQ s373 0) (NEQ s130 1)), p2:(OR (EQ s457 0) (EQ s88 1) (EQ s276 0) (EQ s286 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 407 ms.
Product exploration explored 100000 steps with 33333 reset in 389 ms.
Graph (complete) has 1130 edges and 475 vertex of which 469 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 319 ms.
Product exploration explored 100000 steps with 33333 reset in 284 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (NOT p1)]
Support contains 6 out of 475 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 475/475 places, 416/416 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 475 transition count 416
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 475 transition count 476
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 475 transition count 476
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 470 transition count 471
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 470 transition count 471
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 1 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 109 place count 470 transition count 474
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 120 place count 459 transition count 463
Deduced a syphon composed of 83 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 131 place count 459 transition count 463
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 137 place count 459 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 457 transition count 485
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 457 transition count 485
Deduced a syphon composed of 87 places in 1 ms
Applied a total of 141 rules in 120 ms. Remains 457 /475 variables (removed 18) and now considering 485/416 (removed -69) transitions.
[2021-05-08 14:49:28] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 485 rows 457 cols
[2021-05-08 14:49:28] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 14:49:28] [INFO ] Dead Transitions using invariants and state equation in 237 ms returned []
Finished structural reductions, in 1 iterations. Remains : 457/475 places, 485/416 transitions.
Product exploration explored 100000 steps with 33333 reset in 1257 ms.
Product exploration explored 100000 steps with 33333 reset in 1205 ms.
[2021-05-08 14:49:31] [INFO ] Flatten gal took : 31 ms
[2021-05-08 14:49:31] [INFO ] Flatten gal took : 29 ms
[2021-05-08 14:49:31] [INFO ] Time to serialize gal into /tmp/LTL14259703092013640205.gal : 12 ms
[2021-05-08 14:49:31] [INFO ] Time to serialize properties into /tmp/LTL13732140709187905057.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14259703092013640205.gal, -t, CGAL, -LTL, /tmp/LTL13732140709187905057.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14259703092013640205.gal -t CGAL -LTL /tmp/LTL13732140709187905057.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X((F(G("((p413!=0)&&(p131!=1))")))U(("((((p499==0)||(p89==1))||(p298==0))||(p312==1))")U("((p413==0)||(p131==1))"))))&&("((p499==0)||(p89==1))"))))
Formula 0 simplified : !X("((p499==0)||(p89==1))" & X(FG"((p413!=0)&&(p131!=1))" U ("((((p499==0)||(p89==1))||(p298==0))||(p312==1))" U "((p413==0)||(p131==1))")))
Detected timeout of ITS tools.
[2021-05-08 14:49:46] [INFO ] Flatten gal took : 26 ms
[2021-05-08 14:49:46] [INFO ] Applying decomposition
[2021-05-08 14:49:46] [INFO ] Flatten gal took : 25 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/graph16377761591753780778.txt, -o, /tmp/graph16377761591753780778.bin, -w, /tmp/graph16377761591753780778.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/graph16377761591753780778.bin, -l, -1, -v, -w, /tmp/graph16377761591753780778.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 14:49:46] [INFO ] Decomposing Gal with order
[2021-05-08 14:49:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 14:49:46] [INFO ] Removed a total of 13 redundant transitions.
[2021-05-08 14:49:46] [INFO ] Flatten gal took : 65 ms
[2021-05-08 14:49:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 11 ms.
[2021-05-08 14:49:46] [INFO ] Time to serialize gal into /tmp/LTL2822017465988899199.gal : 7 ms
[2021-05-08 14:49:46] [INFO ] Time to serialize properties into /tmp/LTL8792415016900275283.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2822017465988899199.gal, -t, CGAL, -LTL, /tmp/LTL8792415016900275283.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2822017465988899199.gal -t CGAL -LTL /tmp/LTL8792415016900275283.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X((F(G("((i6.i0.u38.p413!=0)&&(u30.p131!=1))")))U(("((((i8.i3.u70.p499==0)||(i9.u74.p89==1))||(i2.i1.u14.p298==0))||(i3.i0.u18.p312==1))")U("((i6.i0.u38.p413==0)||(u30.p131==1))"))))&&("((i8.i3.u70.p499==0)||(i9.u74.p89==1))"))))
Formula 0 simplified : !X("((i8.i3.u70.p499==0)||(i9.u74.p89==1))" & X(FG"((i6.i0.u38.p413!=0)&&(u30.p131!=1))" U ("((((i8.i3.u70.p499==0)||(i9.u74.p89==1))||(i2.i1.u14.p298==0))||(i3.i0.u18.p312==1))" U "((i6.i0.u38.p413==0)||(u30.p131==1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin859026295988217725
[2021-05-08 14:50:01] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin859026295988217725
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin859026295988217725]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin859026295988217725] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin859026295988217725] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DES-PT-60b-10 finished in 37510 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(p0)||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 478/478 places, 421/421 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 475 transition count 418
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 475 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 475 transition count 417
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 474 transition count 416
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 474 transition count 415
Applied a total of 10 rules in 34 ms. Remains 474 /478 variables (removed 4) and now considering 415/421 (removed 6) transitions.
// Phase 1: matrix 415 rows 474 cols
[2021-05-08 14:50:02] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 14:50:02] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 415 rows 474 cols
[2021-05-08 14:50:02] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 14:50:03] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
// Phase 1: matrix 415 rows 474 cols
[2021-05-08 14:50:03] [INFO ] Computed 62 place invariants in 10 ms
[2021-05-08 14:50:03] [INFO ] Dead Transitions using invariants and state equation in 267 ms returned []
Finished structural reductions, in 1 iterations. Remains : 474/478 places, 415/421 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : DES-PT-60b-11 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(AND (NEQ s315 0) (NEQ s76 1)), p0:(OR (EQ s318 0) (EQ s143 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 170 steps with 1 reset in 0 ms.
FORMULA DES-PT-60b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-11 finished in 1239 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((F(p0)&&(X(p0)||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 478/478 places, 421/421 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 474 transition count 417
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 474 transition count 417
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 473 transition count 413
Applied a total of 13 rules in 20 ms. Remains 473 /478 variables (removed 5) and now considering 413/421 (removed 8) transitions.
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:50:03] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 14:50:04] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:50:04] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 14:50:04] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
// Phase 1: matrix 413 rows 473 cols
[2021-05-08 14:50:04] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 14:50:05] [INFO ] Dead Transitions using invariants and state equation in 233 ms returned []
Finished structural reductions, in 1 iterations. Remains : 473/478 places, 413/421 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : DES-PT-60b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s396 0) (EQ s364 1)), p0:(OR (EQ s350 0) (EQ s221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20035 reset in 239 ms.
Product exploration explored 100000 steps with 19947 reset in 259 ms.
Graph (complete) has 1126 edges and 473 vertex of which 467 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 19988 reset in 260 ms.
Product exploration explored 100000 steps with 19981 reset in 277 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Support contains 4 out of 473 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 473/473 places, 413/413 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 473 transition count 413
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 16 place count 473 transition count 473
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 25 place count 473 transition count 473
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 468 transition count 468
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 468 transition count 468
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 111 place count 468 transition count 471
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 121 place count 458 transition count 461
Deduced a syphon composed of 86 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 131 place count 458 transition count 461
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 92 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 137 place count 458 transition count 489
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 456 transition count 483
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 456 transition count 483
Deduced a syphon composed of 90 places in 0 ms
Applied a total of 141 rules in 52 ms. Remains 456 /473 variables (removed 17) and now considering 483/413 (removed -70) transitions.
[2021-05-08 14:50:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 483 rows 456 cols
[2021-05-08 14:50:06] [INFO ] Computed 62 place invariants in 8 ms
[2021-05-08 14:50:07] [INFO ] Dead Transitions using invariants and state equation in 320 ms returned []
Finished structural reductions, in 1 iterations. Remains : 456/473 places, 483/413 transitions.
Product exploration explored 100000 steps with 20015 reset in 862 ms.
Product exploration explored 100000 steps with 20025 reset in 1009 ms.
[2021-05-08 14:50:09] [INFO ] Flatten gal took : 22 ms
[2021-05-08 14:50:09] [INFO ] Flatten gal took : 21 ms
[2021-05-08 14:50:09] [INFO ] Time to serialize gal into /tmp/LTL3144209564248192414.gal : 2 ms
[2021-05-08 14:50:09] [INFO ] Time to serialize properties into /tmp/LTL6956974243569337649.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3144209564248192414.gal, -t, CGAL, -LTL, /tmp/LTL6956974243569337649.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3144209564248192414.gal -t CGAL -LTL /tmp/LTL6956974243569337649.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F("((p391==0)||(p222==1))"))&&((X("((p391==0)||(p222==1))"))||(G("((p437==0)||(p405==1))"))))))))
Formula 0 simplified : !XXG(F"((p391==0)||(p222==1))" & (X"((p391==0)||(p222==1))" | G"((p437==0)||(p405==1))"))
Detected timeout of ITS tools.
[2021-05-08 14:50:24] [INFO ] Flatten gal took : 25 ms
[2021-05-08 14:50:24] [INFO ] Applying decomposition
[2021-05-08 14:50:24] [INFO ] Flatten gal took : 31 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/graph10490870352375874343.txt, -o, /tmp/graph10490870352375874343.bin, -w, /tmp/graph10490870352375874343.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/graph10490870352375874343.bin, -l, -1, -v, -w, /tmp/graph10490870352375874343.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 14:50:24] [INFO ] Decomposing Gal with order
[2021-05-08 14:50:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 14:50:24] [INFO ] Removed a total of 13 redundant transitions.
[2021-05-08 14:50:24] [INFO ] Flatten gal took : 33 ms
[2021-05-08 14:50:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2021-05-08 14:50:24] [INFO ] Time to serialize gal into /tmp/LTL15728449291960557555.gal : 22 ms
[2021-05-08 14:50:24] [INFO ] Time to serialize properties into /tmp/LTL11239660592809691311.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15728449291960557555.gal, -t, CGAL, -LTL, /tmp/LTL11239660592809691311.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15728449291960557555.gal -t CGAL -LTL /tmp/LTL11239660592809691311.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F("((i6.i0.u46.p391==0)||(i1.u8.p222==1))"))&&((X("((i6.i0.u46.p391==0)||(i1.u8.p222==1))"))||(G("((i6.i1.u54.p437==0)||(i6.i0.u42.p405==1))"))))))))
Formula 0 simplified : !XXG(F"((i6.i0.u46.p391==0)||(i1.u8.p222==1))" & (X"((i6.i0.u46.p391==0)||(i1.u8.p222==1))" | G"((i6.i1.u54.p437==0)||(i6.i0.u42.p405==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7663088685210728823
[2021-05-08 14:50:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7663088685210728823
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7663088685210728823]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7663088685210728823] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7663088685210728823] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DES-PT-60b-15 finished in 36613 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5837791042285321931
[2021-05-08 14:50:40] [INFO ] Computing symmetric may disable matrix : 421 transitions.
[2021-05-08 14:50:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 14:50:40] [INFO ] Applying decomposition
[2021-05-08 14:50:40] [INFO ] Computing symmetric may enable matrix : 421 transitions.
[2021-05-08 14:50:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 14:50:40] [INFO ] Flatten gal took : 19 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/graph6917994210145794978.txt, -o, /tmp/graph6917994210145794978.bin, -w, /tmp/graph6917994210145794978.weights], workingDir=null]
[2021-05-08 14:50:40] [INFO ] Computing Do-Not-Accords matrix : 421 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6917994210145794978.bin, -l, -1, -v, -w, /tmp/graph6917994210145794978.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 14:50:40] [INFO ] Decomposing Gal with order
[2021-05-08 14:50:40] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 14:50:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 14:50:40] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5837791042285321931
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5837791042285321931]
[2021-05-08 14:50:40] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-08 14:50:40] [INFO ] Flatten gal took : 43 ms
[2021-05-08 14:50:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2021-05-08 14:50:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality10779991455134990881.gal : 4 ms
[2021-05-08 14:50:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality4378582767125811654.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality10779991455134990881.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4378582767125811654.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality10779991455134990881.gal -t CGAL -LTL /tmp/LTLCardinality4378582767125811654.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(("((i8.i3.u73.p499==0)||(i9.u78.p89==1))")&&(X((F(G(!("((i6.i1.u46.p413==0)||(u30.p131==1))"))))U(("((((i8.i3.u73.p499==0)||(i9.u78.p89==1))||(i2.i1.u13.p298==0))||(i3.i0.u17.p312==1))")U("((i6.i1.u46.p413==0)||(u30.p131==1))")))))))
Formula 0 simplified : !X("((i8.i3.u73.p499==0)||(i9.u78.p89==1))" & X(FG!"((i6.i1.u46.p413==0)||(u30.p131==1))" U ("((((i8.i3.u73.p499==0)||(i9.u78.p89==1))||(i2.i1.u13.p298==0))||(i3.i0.u17.p312==1))" U "((i6.i1.u46.p413==0)||(u30.p131==1))")))
Compilation finished in 2518 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5837791042285321931]
Link finished in 57 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)&&X((<>([]((LTLAPp1==true))) U ((LTLAPp2==true) U !(LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5837791042285321931]
LTSmin run took 434 ms.
FORMULA DES-PT-60b-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((<>((LTLAPp3==true))&&(X((LTLAPp3==true))||[]((LTLAPp4==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5837791042285321931]
Reverse transition relation is NOT exact ! Due to transitions t0, t62, t348, t426, t459, u30.t83, i0.t141, i0.u7.t293, i0.u7.t294, i0.u7.t295, i0.u7.t296, i0.u7.t297, i0.u7.t298, i0.u7.t299, i0.u7.t300, i0.u7.t301, i0.u7.t302, i0.u7.t303, i0.u7.t304, i0.u7.t305, i0.u7.t306, i0.u7.t307, i0.u7.t308, i0.u7.t309, i0.u7.t310, i0.u7.t311, i0.u7.t312, i0.u7.t313, i0.u7.t314, i0.u7.t315, i0.u7.t316, i0.u7.t317, i0.u7.t318, i0.u7.t319, i0.u7.t320, i0.u7.t321, i0.u7.t322, i0.u7.t323, i0.u7.t324, i0.u7.t325, i0.u7.t326, i0.u7.t327, i0.u7.t328, i0.u7.t329, i0.u7.t330, i0.u7.t331, i0.u7.t332, i0.u7.t333, i0.u7.t334, i0.u7.t335, i0.u7.t336, i0.u7.t337, i0.u7.t338, i0.u7.t339, i0.u7.t340, i0.u7.t341, i0.u7.t342, i0.u7.t343, i0.u7.t344, i0.u7.t345, i0.u7.t346, i0.u7.t347, i2.i0.u10.t135, i2.i0.u10.t137, i2.i1.u12.t130, i2.i2.t154, i2.i2.u5.t165, i2.i2.u5.t166, i2.i2.u6.t159, i2.i2.u6.t160, i3.t114, i3.t99, i3.i0.u18.t112, i3.i2.t457, i3.i2.u16.t118, i3.i2.u20.t104, i3.i2.u20.t468, i3.i2.u23.t1, i3.i2.u23.t109, i3.i3.u27.t98, i4.t80, i6.t56, i6.i0.u39.t76, i6.i1.t54, i6.i1.u55.t57, i6.i1.u56.t55, i6.i2.t58, i6.i2.t60, i6.i2.u52.t63, i6.i2.u53.t61, i6.i2.u54.t59, i6.i3.u57.t52, i7.t66, i7.t64, i7.u49.t68, i7.u50.t67, i7.u51.t65, i8.t439, i8.t9, i8.i0.t10, i8.i0.u65.t41, i8.i0.u66.t38, i8.i1.u36.t78, i8.i3.u73.t25, i8.i3.u73.t27, i9.t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/311/106/417
WARNING : LTSmin timed out (>450 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((<>((LTLAPp3==true))&&(X((LTLAPp3==true))||[]((LTLAPp4==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5837791042285321931]
Retrying LTSmin with larger timeout 3600 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((<>((LTLAPp3==true))&&(X((LTLAPp3==true))||[]((LTLAPp4==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5837791042285321931]
Computing Next relation with stutter on 8.94893e+08 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
22063 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,220.679,4449452,1,0,1.05314e+07,241700,4811,8.53136e+06,5239,2.06972e+06,28209379
no accepting run found
Formula 0 is TRUE no accepting run found.
Checking formula 1 : !((X(X(G(((X("((i6.i0.u40.p391==0)||(i0.u7.p222==1))"))||(G("((i6.i2.u54.p437==0)||(i6.i0.u44.p405==1))")))&&(F("((i6.i0.u40.p391==0)||(i0.u7.p222==1))")))))))
Formula 1 simplified : !XXG((X"((i6.i0.u40.p391==0)||(i0.u7.p222==1))" | G"((i6.i2.u54.p437==0)||(i6.i0.u44.p405==1))") & F"((i6.i0.u40.p391==0)||(i0.u7.p222==1))")
Computing Next relation with stutter on 8.94893e+08 deadlock states
Detected timeout of ITS tools.
[2021-05-08 15:11:15] [INFO ] Applying decomposition
[2021-05-08 15:11:15] [INFO ] Flatten gal took : 39 ms
[2021-05-08 15:11:15] [INFO ] Decomposing Gal with order
[2021-05-08 15:11:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 15:11:15] [INFO ] Removed a total of 246 redundant transitions.
[2021-05-08 15:11:15] [INFO ] Flatten gal took : 146 ms
[2021-05-08 15:11:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 816 labels/synchronizations in 71 ms.
[2021-05-08 15:11:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality5813293899479076359.gal : 3 ms
[2021-05-08 15:11:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality3041255985939728210.ltl : 7 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality5813293899479076359.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3041255985939728210.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality5813293899479076359.gal -t CGAL -LTL /tmp/LTLCardinality3041255985939728210.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G(((X("((i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.u145.p391==0)||(i0.u7.p222==1))"))||(G("((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.u77.p437==0)||(i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.i0.u61.p405==1))")))&&(F("((i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.u145.p391==0)||(i0.u7.p222==1))")))))))
Formula 0 simplified : !XXG((X"((i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.u145.p391==0)||(i0.u7.p222==1))" | G"((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.u77.p437==0)||(i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.i0.u61.p405==1))") & F"((i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.u145.p391==0)||(i0.u7.p222==1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: LTL layer: formula: X(X([]((<>((LTLAPp3==true))&&(X((LTLAPp3==true))||[]((LTLAPp4==true)))))))
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.020: "X(X([]((<>((LTLAPp3==true))&&(X((LTLAPp3==true))||[]((LTLAPp4==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.021: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.033: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.216: DFS-FIFO for weak LTL, using special progress label 427
pins2lts-mc-linux64( 0/ 8), 0.217: There are 428 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.217: State length is 479, there are 434 groups
pins2lts-mc-linux64( 0/ 8), 0.217: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.217: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.217: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.217: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.412: ~1 levels ~960 states ~4656 transitions
pins2lts-mc-linux64( 4/ 8), 0.421: ~1 levels ~1920 states ~9584 transitions
pins2lts-mc-linux64( 7/ 8), 0.454: ~1 levels ~3840 states ~20208 transitions
pins2lts-mc-linux64( 1/ 8), 0.505: ~1 levels ~7680 states ~41240 transitions
pins2lts-mc-linux64( 1/ 8), 0.575: ~72 levels ~15360 states ~64144 transitions
pins2lts-mc-linux64( 1/ 8), 0.716: ~72 levels ~30720 states ~101976 transitions
pins2lts-mc-linux64( 1/ 8), 1.012: ~104 levels ~61440 states ~190072 transitions
pins2lts-mc-linux64( 1/ 8), 1.602: ~128 levels ~122880 states ~337216 transitions
pins2lts-mc-linux64( 1/ 8), 2.923: ~128 levels ~245760 states ~693968 transitions
pins2lts-mc-linux64( 5/ 8), 5.775: ~183 levels ~491520 states ~1494688 transitions
pins2lts-mc-linux64( 6/ 8), 11.641: ~98 levels ~983040 states ~3193424 transitions
pins2lts-mc-linux64( 6/ 8), 23.023: ~105 levels ~1966080 states ~6187712 transitions
pins2lts-mc-linux64( 2/ 8), 46.534: ~127 levels ~3932160 states ~13509416 transitions
pins2lts-mc-linux64( 2/ 8), 94.933: ~141 levels ~7864320 states ~27284168 transitions
pins2lts-mc-linux64( 2/ 8), 196.412: ~141 levels ~15728640 states ~58270768 transitions
pins2lts-mc-linux64( 3/ 8), 398.267: ~113 levels ~31457280 states ~115593024 transitions
pins2lts-mc-linux64( 6/ 8), 833.669: ~112 levels ~62914560 states ~252120112 transitions
pins2lts-mc-linux64( 4/ 8), 1700.877: ~108 levels ~125829120 states ~515366152 transitions
pins2lts-mc-linux64( 4/ 8), 1902.662: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1902.699:
pins2lts-mc-linux64( 0/ 8), 1902.699: mean standard work distribution: 4.5% (states) 1.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1902.699:
pins2lts-mc-linux64( 0/ 8), 1902.699: Explored 134199548 states 583870996 transitions, fanout: 4.351
pins2lts-mc-linux64( 0/ 8), 1902.699: Total exploration time 1902.460 sec (1902.430 sec minimum, 1902.445 sec on average)
pins2lts-mc-linux64( 0/ 8), 1902.699: States per second: 70540, Transitions per second: 306903
pins2lts-mc-linux64( 0/ 8), 1902.699:
pins2lts-mc-linux64( 0/ 8), 1902.699: Progress states detected: 30073
pins2lts-mc-linux64( 0/ 8), 1902.699: Redundant explorations: -0.0132
pins2lts-mc-linux64( 0/ 8), 1902.699:
pins2lts-mc-linux64( 0/ 8), 1902.699: Queue width: 8B, total height: 24746, memory: 0.19MB
pins2lts-mc-linux64( 0/ 8), 1902.699: Tree memory: 1056.4MB, 8.3 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1902.699: Tree fill ratio (roots/leafs): 99.0%/12.0%
pins2lts-mc-linux64( 0/ 8), 1902.699: Stored 569 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1902.699: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1902.699: Est. total memory use: 1056.6MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((<>((LTLAPp3==true))&&(X((LTLAPp3==true))||[]((LTLAPp4==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5837791042285321931]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((<>((LTLAPp3==true))&&(X((LTLAPp3==true))||[]((LTLAPp4==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5837791042285321931]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-08 15:31:49] [INFO ] Flatten gal took : 16 ms
[2021-05-08 15:31:49] [INFO ] Input system was already deterministic with 421 transitions.
[2021-05-08 15:31:49] [INFO ] Transformed 478 places.
[2021-05-08 15:31:49] [INFO ] Transformed 421 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-08 15:31:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality13716041890709392002.gal : 2 ms
[2021-05-08 15:31:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality15435632045541486045.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality13716041890709392002.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15435632045541486045.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality13716041890709392002.gal -t CGAL -LTL /tmp/LTLCardinality15435632045541486045.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(((X("((p391==0)||(p222==1))"))||(G("((p437==0)||(p405==1))")))&&(F("((p391==0)||(p222==1))")))))))
Formula 0 simplified : !XXG((X"((p391==0)||(p222==1))" | G"((p437==0)||(p405==1))") & F"((p391==0)||(p222==1))")
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DES-PT-60b"
export BK_EXAMINATION="LTLCardinality"
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 DES-PT-60b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r064-tall-162038396800156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;