fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089416200692
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for RefineWMG-PT-100100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3237.367 200586.00 292621.00 115.10 FFTFFFTTTTFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416200692.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 RefineWMG-PT-100100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416200692
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 218K 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 RefineWMG-PT-100100-00
FORMULA_NAME RefineWMG-PT-100100-01
FORMULA_NAME RefineWMG-PT-100100-02
FORMULA_NAME RefineWMG-PT-100100-03
FORMULA_NAME RefineWMG-PT-100100-04
FORMULA_NAME RefineWMG-PT-100100-05
FORMULA_NAME RefineWMG-PT-100100-06
FORMULA_NAME RefineWMG-PT-100100-07
FORMULA_NAME RefineWMG-PT-100100-08
FORMULA_NAME RefineWMG-PT-100100-09
FORMULA_NAME RefineWMG-PT-100100-10
FORMULA_NAME RefineWMG-PT-100100-11
FORMULA_NAME RefineWMG-PT-100100-12
FORMULA_NAME RefineWMG-PT-100100-13
FORMULA_NAME RefineWMG-PT-100100-14
FORMULA_NAME RefineWMG-PT-100100-15

=== Now, execution of the tool begins

BK_START 1621265174002

Running Version 0
[2021-05-17 15:26:15] [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-17 15:26:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:26:15] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-17 15:26:15] [INFO ] Transformed 504 places.
[2021-05-17 15:26:15] [INFO ] Transformed 403 transitions.
[2021-05-17 15:26:15] [INFO ] Parsed PT model containing 504 places and 403 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:26:15] [INFO ] Initial state test concluded for 5 properties.
FORMULA RefineWMG-PT-100100-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 50 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:15] [INFO ] Computed 202 place invariants in 18 ms
[2021-05-17 15:26:16] [INFO ] Dead Transitions using invariants and state equation in 316 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:16] [INFO ] Computed 202 place invariants in 6 ms
[2021-05-17 15:26:16] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:16] [INFO ] Computed 202 place invariants in 12 ms
[2021-05-17 15:26:16] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:16] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:26:16] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
[2021-05-17 15:26:16] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 15:26:17] [INFO ] Flatten gal took : 65 ms
FORMULA RefineWMG-PT-100100-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:26:17] [INFO ] Flatten gal took : 27 ms
[2021-05-17 15:26:17] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 100034 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=295 ) properties (out of 23) seen :9
Running SMT prover for 14 properties.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:17] [INFO ] Computed 202 place invariants in 5 ms
[2021-05-17 15:26:17] [INFO ] [Real]Absence check using 202 positive place invariants in 25 ms returned sat
[2021-05-17 15:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:17] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2021-05-17 15:26:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:17] [INFO ] [Nat]Absence check using 202 positive place invariants in 25 ms returned sat
[2021-05-17 15:26:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:17] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-17 15:26:17] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-17 15:26:18] [INFO ] Added : 77 causal constraints over 16 iterations in 373 ms. Result :sat
[2021-05-17 15:26:18] [INFO ] [Real]Absence check using 202 positive place invariants in 25 ms returned sat
[2021-05-17 15:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:18] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-17 15:26:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:18] [INFO ] [Nat]Absence check using 202 positive place invariants in 24 ms returned sat
[2021-05-17 15:26:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:18] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-17 15:26:18] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 32 ms.
[2021-05-17 15:26:18] [INFO ] Added : 55 causal constraints over 11 iterations in 260 ms. Result :sat
[2021-05-17 15:26:19] [INFO ] [Real]Absence check using 202 positive place invariants in 24 ms returned sat
[2021-05-17 15:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:19] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-17 15:26:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:19] [INFO ] [Nat]Absence check using 202 positive place invariants in 27 ms returned sat
[2021-05-17 15:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:19] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-17 15:26:19] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-17 15:26:20] [INFO ] Added : 206 causal constraints over 42 iterations in 891 ms. Result :sat
[2021-05-17 15:26:20] [INFO ] [Real]Absence check using 202 positive place invariants in 35 ms returned sat
[2021-05-17 15:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:20] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-17 15:26:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:20] [INFO ] [Nat]Absence check using 202 positive place invariants in 24 ms returned sat
[2021-05-17 15:26:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:20] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-17 15:26:20] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-17 15:26:21] [INFO ] Added : 174 causal constraints over 35 iterations in 620 ms. Result :sat
[2021-05-17 15:26:21] [INFO ] [Real]Absence check using 202 positive place invariants in 35 ms returned sat
[2021-05-17 15:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:21] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-17 15:26:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:21] [INFO ] [Nat]Absence check using 202 positive place invariants in 34 ms returned sat
[2021-05-17 15:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:21] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-17 15:26:21] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-17 15:26:22] [INFO ] Added : 153 causal constraints over 31 iterations in 605 ms. Result :sat
[2021-05-17 15:26:22] [INFO ] [Real]Absence check using 202 positive place invariants in 24 ms returned sat
[2021-05-17 15:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:22] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-17 15:26:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:22] [INFO ] [Nat]Absence check using 202 positive place invariants in 40 ms returned sat
[2021-05-17 15:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:22] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-17 15:26:23] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-17 15:26:23] [INFO ] Added : 202 causal constraints over 41 iterations in 779 ms. Result :sat
[2021-05-17 15:26:23] [INFO ] [Real]Absence check using 202 positive place invariants in 37 ms returned sat
[2021-05-17 15:26:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:24] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-17 15:26:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:24] [INFO ] [Nat]Absence check using 202 positive place invariants in 43 ms returned sat
[2021-05-17 15:26:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:24] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2021-05-17 15:26:24] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 15:26:24] [INFO ] Added : 119 causal constraints over 24 iterations in 594 ms. Result :sat
[2021-05-17 15:26:25] [INFO ] [Real]Absence check using 202 positive place invariants in 27 ms returned sat
[2021-05-17 15:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:25] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-17 15:26:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:25] [INFO ] [Nat]Absence check using 202 positive place invariants in 35 ms returned sat
[2021-05-17 15:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:25] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-17 15:26:25] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 52 ms.
[2021-05-17 15:26:25] [INFO ] Added : 29 causal constraints over 6 iterations in 224 ms. Result :sat
[2021-05-17 15:26:25] [INFO ] [Real]Absence check using 202 positive place invariants in 36 ms returned sat
[2021-05-17 15:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:26] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-17 15:26:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:26] [INFO ] [Nat]Absence check using 202 positive place invariants in 33 ms returned sat
[2021-05-17 15:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:26] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-17 15:26:26] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-17 15:26:26] [INFO ] Added : 27 causal constraints over 6 iterations in 178 ms. Result :sat
[2021-05-17 15:26:26] [INFO ] [Real]Absence check using 202 positive place invariants in 36 ms returned sat
[2021-05-17 15:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:26] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-17 15:26:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:26] [INFO ] [Nat]Absence check using 202 positive place invariants in 49 ms returned sat
[2021-05-17 15:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:27] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2021-05-17 15:26:27] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-17 15:26:28] [INFO ] Added : 232 causal constraints over 47 iterations in 1085 ms. Result :sat
[2021-05-17 15:26:28] [INFO ] [Real]Absence check using 202 positive place invariants in 31 ms returned sat
[2021-05-17 15:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:28] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-17 15:26:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:28] [INFO ] [Nat]Absence check using 202 positive place invariants in 37 ms returned sat
[2021-05-17 15:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:28] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-17 15:26:28] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 21 ms.
[2021-05-17 15:26:29] [INFO ] Added : 203 causal constraints over 41 iterations in 826 ms. Result :sat
[2021-05-17 15:26:29] [INFO ] [Real]Absence check using 202 positive place invariants in 31 ms returned sat
[2021-05-17 15:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:29] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-17 15:26:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:29] [INFO ] [Nat]Absence check using 202 positive place invariants in 31 ms returned sat
[2021-05-17 15:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:30] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-17 15:26:30] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-17 15:26:31] [INFO ] Added : 216 causal constraints over 44 iterations in 924 ms. Result :sat
[2021-05-17 15:26:31] [INFO ] [Real]Absence check using 202 positive place invariants in 38 ms returned sat
[2021-05-17 15:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:31] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-17 15:26:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:31] [INFO ] [Nat]Absence check using 202 positive place invariants in 27 ms returned sat
[2021-05-17 15:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:31] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2021-05-17 15:26:31] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 15:26:32] [INFO ] Added : 201 causal constraints over 41 iterations in 1074 ms. Result :sat
[2021-05-17 15:26:32] [INFO ] [Real]Absence check using 202 positive place invariants in 28 ms returned sat
[2021-05-17 15:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:32] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-17 15:26:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:26:32] [INFO ] [Nat]Absence check using 202 positive place invariants in 22 ms returned sat
[2021-05-17 15:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:26:33] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-17 15:26:33] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-17 15:26:33] [INFO ] Added : 45 causal constraints over 9 iterations in 161 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 3 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 108 transition count 108
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 95 rules applied. Total rules applied 493 place count 108 transition count 13
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 588 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 588 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 592 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 594 place count 10 transition count 10
Applied a total of 594 rules in 59 ms. Remains 10 /504 variables (removed 494) and now considering 10/403 (removed 393) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 15:26:33] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:33] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:26:33] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 15:26:33] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-17 15:26:33] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 15:26:33] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:26:33] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 10/403 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100100-00 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s8), p1:(GT 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-00 finished in 379 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 299 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 1 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 304 transition count 204
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 397 place count 106 transition count 105
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 94 rules applied. Total rules applied 491 place count 106 transition count 11
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 95 rules applied. Total rules applied 586 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 587 place count 11 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 587 place count 11 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 591 place count 9 transition count 8
Applied a total of 591 rules in 19 ms. Remains 9 /504 variables (removed 495) and now considering 8/403 (removed 395) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 15:26:33] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:26:33] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 15:26:33] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:26:33] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 15:26:33] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:26:33] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-17 15:26:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 15:26:33] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:26:33] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/504 places, 8/403 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100100-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s7), p0:(LEQ 3 s5)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-01 finished in 157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||F((p1&&F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 15 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:33] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:26:34] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:34] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:26:34] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:34] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:26:34] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:26:34] [INFO ] Computed 202 place invariants in 5 ms
[2021-05-17 15:26:34] [INFO ] Dead Transitions using invariants and state equation in 235 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-02 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT s487 s230), p1:(GT s176 s2)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1201 ms.
Product exploration explored 100000 steps with 50000 reset in 823 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 125 ms :[p0, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 732 ms.
Product exploration explored 100000 steps with 50000 reset in 719 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 137 ms :[p0, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 197 place count 306 transition count 206
Deduced a syphon composed of 98 places in 0 ms
Applied a total of 197 rules in 25 ms. Remains 306 /504 variables (removed 198) and now considering 206/403 (removed 197) transitions.
// Phase 1: matrix 206 rows 306 cols
[2021-05-17 15:26:38] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-17 15:26:39] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
[2021-05-17 15:26:39] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 206 rows 306 cols
[2021-05-17 15:26:39] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-17 15:26:39] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 306/504 places, 206/403 transitions.
Product exploration explored 100000 steps with 50000 reset in 2429 ms.
Product exploration explored 100000 steps with 50000 reset in 2040 ms.
[2021-05-17 15:26:43] [INFO ] Flatten gal took : 19 ms
[2021-05-17 15:26:43] [INFO ] Flatten gal took : 18 ms
[2021-05-17 15:26:43] [INFO ] Time to serialize gal into /tmp/LTL13489058194802183151.gal : 13 ms
[2021-05-17 15:26:43] [INFO ] Time to serialize properties into /tmp/LTL6137606501964475742.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/LTL13489058194802183151.gal, -t, CGAL, -LTL, /tmp/LTL6137606501964475742.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/LTL13489058194802183151.gal -t CGAL -LTL /tmp/LTL6137606501964475742.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(p484>p227)"))||(F(("(p173>psecond)")&&(F("(p484<=p227)")))))))
Formula 0 simplified : !X(G"(p484>p227)" | F("(p173>psecond)" & F"(p484<=p227)"))
Detected timeout of ITS tools.
[2021-05-17 15:26:58] [INFO ] Flatten gal took : 19 ms
[2021-05-17 15:26:58] [INFO ] Applying decomposition
[2021-05-17 15:26:58] [INFO ] Flatten gal took : 17 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/graph7781717130232482013.txt, -o, /tmp/graph7781717130232482013.bin, -w, /tmp/graph7781717130232482013.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/graph7781717130232482013.bin, -l, -1, -v, -w, /tmp/graph7781717130232482013.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:26:58] [INFO ] Decomposing Gal with order
[2021-05-17 15:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:26:59] [INFO ] Flatten gal took : 104 ms
[2021-05-17 15:26:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-17 15:26:59] [INFO ] Time to serialize gal into /tmp/LTL12799644287846083553.gal : 21 ms
[2021-05-17 15:26:59] [INFO ] Time to serialize properties into /tmp/LTL16422507058740587196.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/LTL12799644287846083553.gal, -t, CGAL, -LTL, /tmp/LTL16422507058740587196.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/LTL12799644287846083553.gal -t CGAL -LTL /tmp/LTL16422507058740587196.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(gu111.p484>gu111.p227)"))||(F(("(gu83.p173>gu83.psecond)")&&(F("(gu111.p484<=gu111.p227)")))))))
Formula 0 simplified : !X(G"(gu111.p484>gu111.p227)" | F("(gu83.p173>gu83.psecond)" & F"(gu111.p484<=gu111.p227)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3938433191977937517
[2021-05-17 15:27:14] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3938433191977937517
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/ltsmin3938433191977937517]
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/ltsmin3938433191977937517] 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/ltsmin3938433191977937517] 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 RefineWMG-PT-100100-02 finished in 41619 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 294 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 0 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 397 place count 110 transition count 110
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 1 with 90 rules applied. Total rules applied 487 place count 110 transition count 20
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 91 rules applied. Total rules applied 578 place count 20 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 579 place count 19 transition count 19
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 579 place count 19 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 587 place count 15 transition count 15
Applied a total of 587 rules in 32 ms. Remains 15 /504 variables (removed 489) and now considering 15/403 (removed 388) transitions.
// Phase 1: matrix 15 rows 15 cols
[2021-05-17 15:27:15] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 15:27:15] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-17 15:27:15] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 15:27:15] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-17 15:27:15] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 15:27:15] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-17 15:27:15] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-17 15:27:15] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 15:27:15] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/504 places, 15/403 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-100100-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s5), p1:(LEQ s13 s10), p2:(OR (LEQ 1 s8) (LEQ 2 s5))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2564 steps with 2 reset in 23 ms.
FORMULA RefineWMG-PT-100100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-03 finished in 259 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(((p1 U X(p2))&&G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:15] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:27:15] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:15] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:27:16] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:16] [INFO ] Computed 202 place invariants in 5 ms
[2021-05-17 15:27:16] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:16] [INFO ] Computed 202 place invariants in 5 ms
[2021-05-17 15:27:16] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-100100-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(LEQ 2 s76), p2:(GT s2 s393), p0:(LEQ 1 s129)], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-04 finished in 1083 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:16] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:27:16] [INFO ] Dead Transitions using invariants and state equation in 178 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:16] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:27:17] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:17] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:27:17] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:17] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:27:17] [INFO ] Dead Transitions using invariants and state equation in 212 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s214), p1:(LEQ 2 s412)], 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]]
Product exploration explored 100000 steps with 50000 reset in 964 ms.
Product exploration explored 100000 steps with 50000 reset in 978 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 923 ms.
Product exploration explored 100000 steps with 50000 reset in 991 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 298 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 199 place count 306 transition count 206
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 199 rules in 16 ms. Remains 306 /504 variables (removed 198) and now considering 206/403 (removed 197) transitions.
// Phase 1: matrix 206 rows 306 cols
[2021-05-17 15:27:21] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-17 15:27:21] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
[2021-05-17 15:27:22] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 206 rows 306 cols
[2021-05-17 15:27:22] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-17 15:27:22] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 306/504 places, 206/403 transitions.
Product exploration explored 100000 steps with 50000 reset in 2315 ms.
Product exploration explored 100000 steps with 50000 reset in 2098 ms.
[2021-05-17 15:27:26] [INFO ] Flatten gal took : 24 ms
[2021-05-17 15:27:26] [INFO ] Flatten gal took : 14 ms
[2021-05-17 15:27:26] [INFO ] Time to serialize gal into /tmp/LTL8122604058683077950.gal : 2 ms
[2021-05-17 15:27:26] [INFO ] Time to serialize properties into /tmp/LTL15581488244637981442.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/LTL8122604058683077950.gal, -t, CGAL, -LTL, /tmp/LTL15581488244637981442.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/LTL8122604058683077950.gal -t CGAL -LTL /tmp/LTL15581488244637981442.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(p211>=3)")||(X("(p409>=2)")))))
Formula 0 simplified : !F("(p211>=3)" | X"(p409>=2)")
Detected timeout of ITS tools.
[2021-05-17 15:27:41] [INFO ] Flatten gal took : 32 ms
[2021-05-17 15:27:41] [INFO ] Applying decomposition
[2021-05-17 15:27:41] [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/graph12722442204755858770.txt, -o, /tmp/graph12722442204755858770.bin, -w, /tmp/graph12722442204755858770.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/graph12722442204755858770.bin, -l, -1, -v, -w, /tmp/graph12722442204755858770.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:27:41] [INFO ] Decomposing Gal with order
[2021-05-17 15:27:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:27:41] [INFO ] Flatten gal took : 30 ms
[2021-05-17 15:27:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 15:27:41] [INFO ] Time to serialize gal into /tmp/LTL7892148096890931705.gal : 9 ms
[2021-05-17 15:27:41] [INFO ] Time to serialize properties into /tmp/LTL4393633095245582731.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/LTL7892148096890931705.gal, -t, CGAL, -LTL, /tmp/LTL4393633095245582731.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/LTL7892148096890931705.gal -t CGAL -LTL /tmp/LTL4393633095245582731.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("(i16.i2.u103.p211>=3)")||(X("(i29.i1.u198.p409>=2)")))))
Formula 0 simplified : !F("(i16.i2.u103.p211>=3)" | X"(i29.i1.u198.p409>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18329721148087488259
[2021-05-17 15:27:56] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18329721148087488259
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/ltsmin18329721148087488259]
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/ltsmin18329721148087488259] 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/ltsmin18329721148087488259] 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 RefineWMG-PT-100100-09 finished in 41159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||(X(p0)&&(p1 U G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:57] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:27:58] [INFO ] Dead Transitions using invariants and state equation in 339 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:58] [INFO ] Computed 202 place invariants in 7 ms
[2021-05-17 15:27:58] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:58] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:27:59] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:59] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:27:59] [INFO ] Dead Transitions using invariants and state equation in 229 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100100-10 automaton TGBA [mat=[[{ cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s358 s314), p2:(GT 1 s439), p1:(LEQ 2 s434)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1913 steps with 0 reset in 30 ms.
FORMULA RefineWMG-PT-100100-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-10 finished in 1448 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:59] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:27:59] [INFO ] Dead Transitions using invariants and state equation in 213 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:59] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:27:59] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:27:59] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:28:00] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:00] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:28:00] [INFO ] Dead Transitions using invariants and state equation in 177 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s151 s354)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-11 finished in 895 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 4 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:00] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:28:00] [INFO ] Dead Transitions using invariants and state equation in 169 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:00] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:28:00] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:00] [INFO ] Computed 202 place invariants in 5 ms
[2021-05-17 15:28:00] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:00] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:28:01] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s321), p1:(LEQ 1 s468)], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 860 ms.
Product exploration explored 100000 steps with 50000 reset in 891 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 855 ms.
Product exploration explored 100000 steps with 50000 reset in 899 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 297 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 0 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 198 place count 306 transition count 206
Deduced a syphon composed of 99 places in 0 ms
Applied a total of 198 rules in 20 ms. Remains 306 /504 variables (removed 198) and now considering 206/403 (removed 197) transitions.
// Phase 1: matrix 206 rows 306 cols
[2021-05-17 15:28:05] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-17 15:28:05] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
[2021-05-17 15:28:05] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 206 rows 306 cols
[2021-05-17 15:28:05] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-17 15:28:05] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 306/504 places, 206/403 transitions.
Product exploration explored 100000 steps with 50000 reset in 835 ms.
Product exploration explored 100000 steps with 50000 reset in 903 ms.
[2021-05-17 15:28:07] [INFO ] Flatten gal took : 13 ms
[2021-05-17 15:28:07] [INFO ] Flatten gal took : 12 ms
[2021-05-17 15:28:07] [INFO ] Time to serialize gal into /tmp/LTL1834952229899170927.gal : 2 ms
[2021-05-17 15:28:07] [INFO ] Time to serialize properties into /tmp/LTL18209106089125821484.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/LTL1834952229899170927.gal, -t, CGAL, -LTL, /tmp/LTL18209106089125821484.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/LTL1834952229899170927.gal -t CGAL -LTL /tmp/LTL18209106089125821484.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p318>=2)")||(X(F("(p465>=1)")))))))
Formula 0 simplified : !XF("(p318>=2)" | XF"(p465>=1)")
Detected timeout of ITS tools.
[2021-05-17 15:28:22] [INFO ] Flatten gal took : 31 ms
[2021-05-17 15:28:22] [INFO ] Applying decomposition
[2021-05-17 15:28:22] [INFO ] Flatten gal took : 23 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/graph280994715855355265.txt, -o, /tmp/graph280994715855355265.bin, -w, /tmp/graph280994715855355265.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/graph280994715855355265.bin, -l, -1, -v, -w, /tmp/graph280994715855355265.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:28:22] [INFO ] Decomposing Gal with order
[2021-05-17 15:28:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:28:22] [INFO ] Flatten gal took : 22 ms
[2021-05-17 15:28:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 15:28:22] [INFO ] Time to serialize gal into /tmp/LTL1294150567519488507.gal : 5 ms
[2021-05-17 15:28:22] [INFO ] Time to serialize properties into /tmp/LTL15363714351893852409.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/LTL1294150567519488507.gal, -t, CGAL, -LTL, /tmp/LTL15363714351893852409.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/LTL1294150567519488507.gal -t CGAL -LTL /tmp/LTL15363714351893852409.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i24.i1.u157.p318>=2)")||(X(F("(i35.i0.u229.p465>=1)")))))))
Formula 0 simplified : !XF("(i24.i1.u157.p318>=2)" | XF"(i35.i0.u229.p465>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4937136049675128667
[2021-05-17 15:28:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4937136049675128667
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/ltsmin4937136049675128667]
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/ltsmin4937136049675128667] 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/ltsmin4937136049675128667] 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 RefineWMG-PT-100100-12 finished in 38224 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 1 with 294 rules applied. Total rules applied 393 place count 110 transition count 108
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 1 with 90 rules applied. Total rules applied 483 place count 110 transition count 18
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 91 rules applied. Total rules applied 574 place count 20 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 575 place count 19 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 575 place count 19 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 581 place count 16 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 583 place count 15 transition count 13
Applied a total of 583 rules in 12 ms. Remains 15 /504 variables (removed 489) and now considering 13/403 (removed 390) transitions.
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 15:28:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 15:28:38] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 15:28:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 15:28:38] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 15:28:38] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 15:28:38] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2021-05-17 15:28:38] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 15:28:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 15:28:38] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/504 places, 13/403 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100100-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s8 s6), p1:(OR (LEQ s11 s13) (LEQ s8 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 114 ms.
Product exploration explored 100000 steps with 0 reset in 303 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Product exploration explored 100000 steps with 0 reset in 108 ms.
[2021-05-17 15:28:39] [INFO ] Flatten gal took : 1 ms
[2021-05-17 15:28:39] [INFO ] Flatten gal took : 1 ms
[2021-05-17 15:28:39] [INFO ] Time to serialize gal into /tmp/LTL7166947115395078182.gal : 1 ms
[2021-05-17 15:28:39] [INFO ] Time to serialize properties into /tmp/LTL8880315677016210552.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/LTL7166947115395078182.gal, -t, CGAL, -LTL, /tmp/LTL8880315677016210552.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/LTL7166947115395078182.gal -t CGAL -LTL /tmp/LTL8880315677016210552.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(p337<=p173)"))||(F(G("((p416<=p444)||(p337<=p173))")))))
Formula 0 simplified : !(G"(p337<=p173)" | FG"((p416<=p444)||(p337<=p173))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 15:28:54] [INFO ] Flatten gal took : 1 ms
[2021-05-17 15:28:54] [INFO ] Applying decomposition
[2021-05-17 15:28:54] [INFO ] Flatten gal took : 1 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/graph8814943964410697606.txt, -o, /tmp/graph8814943964410697606.bin, -w, /tmp/graph8814943964410697606.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/graph8814943964410697606.bin, -l, -1, -v, -w, /tmp/graph8814943964410697606.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:28:54] [INFO ] Decomposing Gal with order
[2021-05-17 15:28:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:28:54] [INFO ] Flatten gal took : 0 ms
[2021-05-17 15:28:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 15:28:54] [INFO ] Time to serialize gal into /tmp/LTL995604449067528637.gal : 1 ms
[2021-05-17 15:28:54] [INFO ] Time to serialize properties into /tmp/LTL4135828118106932311.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/LTL995604449067528637.gal, -t, CGAL, -LTL, /tmp/LTL4135828118106932311.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/LTL995604449067528637.gal -t CGAL -LTL /tmp/LTL4135828118106932311.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(gu2.p337<=gu2.p173)"))||(F(G("((gu3.p416<=gu3.p444)||(gu2.p337<=gu2.p173))")))))
Formula 0 simplified : !(G"(gu2.p337<=gu2.p173)" | FG"((gu3.p416<=gu3.p444)||(gu2.p337<=gu2.p173))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7976095979028904364
[2021-05-17 15:29:09] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7976095979028904364
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/ltsmin7976095979028904364]
Compilation finished in 188 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7976095979028904364]
Link finished in 80 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, ([]((LTLAPp0==true))||<>([]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7976095979028904364]
LTSmin run took 14287 ms.
FORMULA RefineWMG-PT-100100-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-100100-14 finished in 45916 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0&&G(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 299 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 0 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 304 transition count 204
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 397 place count 106 transition count 105
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 494 place count 106 transition count 8
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 591 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 591 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 593 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 595 place count 7 transition count 6
Applied a total of 595 rules in 9 ms. Remains 7 /504 variables (removed 497) and now considering 6/403 (removed 397) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:29:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:29:24] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:29:24] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 15:29:24] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:29:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:29:24] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2021-05-17 15:29:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:29:24] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 15:29:24] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/504 places, 6/403 transitions.
[2021-05-17 15:29:24] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-15 finished in 192 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11146228091246630782
[2021-05-17 15:29:24] [INFO ] Applying decomposition
[2021-05-17 15:29:24] [INFO ] Computing symmetric may disable matrix : 403 transitions.
[2021-05-17 15:29:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:29:24] [INFO ] Computing symmetric may enable matrix : 403 transitions.
[2021-05-17 15:29:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:29:24] [INFO ] Flatten gal took : 11 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/graph9624622020351826782.txt, -o, /tmp/graph9624622020351826782.bin, -w, /tmp/graph9624622020351826782.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/graph9624622020351826782.bin, -l, -1, -v, -w, /tmp/graph9624622020351826782.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:29:24] [INFO ] Computing Do-Not-Accords matrix : 403 transitions.
[2021-05-17 15:29:24] [INFO ] Decomposing Gal with order
[2021-05-17 15:29:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:29:24] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:29:24] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11146228091246630782
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/ltsmin11146228091246630782]
[2021-05-17 15:29:24] [INFO ] Flatten gal took : 23 ms
[2021-05-17 15:29:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 15:29:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality10382284156972784704.gal : 14 ms
[2021-05-17 15:29:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality6604022373326517442.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/LTLCardinality10382284156972784704.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6604022373326517442.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/LTLCardinality10382284156972784704.gal -t CGAL -LTL /tmp/LTLCardinality6604022373326517442.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((X((G("(gu110.p484>gu110.p227)"))||(F(("(gu84.p173>gu84.psecond)")&&(F("(gu110.p484<=gu110.p227)")))))))
Formula 0 simplified : !X(G"(gu110.p484>gu110.p227)" | F("(gu84.p173>gu84.psecond)" & F"(gu110.p484<=gu110.p227)"))
Compilation finished in 1934 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11146228091246630782]
Link finished in 41 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))||<>(((LTLAPp1==true)&&<>(!(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11146228091246630782]
LTSmin run took 2464 ms.
FORMULA RefineWMG-PT-100100-02 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, <>(((LTLAPp2==true)||X((LTLAPp3==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11146228091246630782]
LTSmin run took 1893 ms.
FORMULA RefineWMG-PT-100100-09 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(<>(((LTLAPp4==true)||X(<>((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11146228091246630782]
LTSmin run took 3288 ms.
FORMULA RefineWMG-PT-100100-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621265374588

--------------------
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="RefineWMG-PT-100100"
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 RefineWMG-PT-100100, 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 r178-tajo-162089416200692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100100.tgz
mv RefineWMG-PT-100100 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;